/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread/queue_ok_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:00:55,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:00:55,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 04:00:55,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:00:55,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:00:55,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:00:55,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:00:55,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:00:55,134 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:00:55,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:00:55,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:00:55,138 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:00:55,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:00:55,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:00:55,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:00:55,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:00:55,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:00:55,140 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:00:55,141 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:00:55,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:00:55,141 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:00:55,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:00:55,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:00:55,142 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:00:55,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:00:55,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:00:55,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:00:55,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:00:55,145 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:00:55,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:00:55,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:00:55,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:00:55,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:00:55,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-11-30 04:00:55,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:00:55,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:00:55,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:00:55,407 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:00:55,407 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:00:55,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-11-30 04:00:56,515 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:00:56,774 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:00:56,774 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-11-30 04:00:56,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/602e9429d/2aa48aee369f4b5682a95808b5156f63/FLAGefa7f7c0a [2023-11-30 04:00:56,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/602e9429d/2aa48aee369f4b5682a95808b5156f63 [2023-11-30 04:00:56,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:00:56,812 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:00:56,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:00:56,813 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:00:56,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:00:56,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:00:56" (1/1) ... [2023-11-30 04:00:56,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39f020c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:56, skipping insertion in model container [2023-11-30 04:00:56,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:00:56" (1/1) ... [2023-11-30 04:00:56,876 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:00:57,267 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:00:57,281 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:00:57,342 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:00:57,387 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:00:57,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:57 WrapperNode [2023-11-30 04:00:57,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:00:57,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:00:57,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:00:57,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:00:57,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:57" (1/1) ... [2023-11-30 04:00:57,429 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:57" (1/1) ... [2023-11-30 04:00:57,471 INFO L138 Inliner]: procedures = 275, calls = 61, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 214 [2023-11-30 04:00:57,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:00:57,472 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:00:57,472 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:00:57,472 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:00:57,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:57" (1/1) ... [2023-11-30 04:00:57,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:57" (1/1) ... [2023-11-30 04:00:57,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:57" (1/1) ... [2023-11-30 04:00:57,510 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:57" (1/1) ... [2023-11-30 04:00:57,518 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:57" (1/1) ... [2023-11-30 04:00:57,521 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:57" (1/1) ... [2023-11-30 04:00:57,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:57" (1/1) ... [2023-11-30 04:00:57,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:57" (1/1) ... [2023-11-30 04:00:57,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:00:57,527 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:00:57,527 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:00:57,528 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:00:57,528 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:57" (1/1) ... [2023-11-30 04:00:57,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:00:57,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:00:57,557 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 04:00:57,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 04:00:57,599 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-30 04:00:57,599 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-30 04:00:57,599 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-30 04:00:57,599 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-30 04:00:57,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:00:57,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:00:57,600 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-30 04:00:57,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 04:00:57,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:00:57,600 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-30 04:00:57,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:00:57,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:00:57,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:00:57,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:00:57,602 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 04:00:57,743 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:00:57,745 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:00:58,070 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:00:58,090 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:00:58,090 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-30 04:00:58,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:00:58 BoogieIcfgContainer [2023-11-30 04:00:58,092 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:00:58,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:00:58,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:00:58,096 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:00:58,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:00:56" (1/3) ... [2023-11-30 04:00:58,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54864fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:00:58, skipping insertion in model container [2023-11-30 04:00:58,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:57" (2/3) ... [2023-11-30 04:00:58,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54864fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:00:58, skipping insertion in model container [2023-11-30 04:00:58,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:00:58" (3/3) ... [2023-11-30 04:00:58,098 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2023-11-30 04:00:58,112 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:00:58,113 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2023-11-30 04:00:58,113 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:00:58,234 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 04:00:58,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 294 transitions, 602 flow [2023-11-30 04:00:58,437 INFO L124 PetriNetUnfolderBase]: 15/292 cut-off events. [2023-11-30 04:00:58,437 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 04:00:58,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 292 events. 15/292 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 686 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 197. Up to 3 conditions per place. [2023-11-30 04:00:58,450 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 294 transitions, 602 flow [2023-11-30 04:00:58,463 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 274 places, 282 transitions, 573 flow [2023-11-30 04:00:58,477 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:00:58,485 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;@348644cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:00:58,485 INFO L363 AbstractCegarLoop]: Starting to check reachability of 100 error locations. [2023-11-30 04:00:58,494 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:00:58,494 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2023-11-30 04:00:58,494 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:00:58,495 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:00:58,495 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:00:58,495 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:00:58,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:00:58,500 INFO L85 PathProgramCache]: Analyzing trace with hash 258200551, now seen corresponding path program 1 times [2023-11-30 04:00:58,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:00:58,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432189129] [2023-11-30 04:00:58,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:00:58,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:00:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:00:59,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:00:59,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:00:59,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432189129] [2023-11-30 04:00:59,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432189129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:00:59,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:00:59,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 04:00:59,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130283158] [2023-11-30 04:00:59,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:00:59,075 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 04:00:59,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:00:59,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 04:00:59,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-30 04:00:59,109 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 294 [2023-11-30 04:00:59,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 282 transitions, 573 flow. Second operand has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:00:59,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:00:59,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 294 [2023-11-30 04:00:59,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:00,812 INFO L124 PetriNetUnfolderBase]: 3483/9979 cut-off events. [2023-11-30 04:01:00,813 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-30 04:01:00,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15330 conditions, 9979 events. 3483/9979 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 96738 event pairs, 2965 based on Foata normal form. 419/7697 useless extension candidates. Maximal degree in co-relation 14667. Up to 5258 conditions per place. [2023-11-30 04:01:00,902 INFO L140 encePairwiseOnDemand]: 280/294 looper letters, 78 selfloop transitions, 6 changer transitions 0/263 dead transitions. [2023-11-30 04:01:00,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 263 transitions, 703 flow [2023-11-30 04:01:00,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:01:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:01:00,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1262 transitions. [2023-11-30 04:01:00,922 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7154195011337868 [2023-11-30 04:01:00,922 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1262 transitions. [2023-11-30 04:01:00,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1262 transitions. [2023-11-30 04:01:00,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:00,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1262 transitions. [2023-11-30 04:01:00,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 210.33333333333334) internal successors, (1262), 6 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:00,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:00,942 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:00,946 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, -8 predicate places. [2023-11-30 04:01:00,946 INFO L500 AbstractCegarLoop]: Abstraction has has 266 places, 263 transitions, 703 flow [2023-11-30 04:01:00,947 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:00,947 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:00,947 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:00,947 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:01:00,947 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:01:00,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:00,948 INFO L85 PathProgramCache]: Analyzing trace with hash 258200552, now seen corresponding path program 1 times [2023-11-30 04:01:00,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:00,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891670431] [2023-11-30 04:01:00,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:00,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:01,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:01,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:01,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891670431] [2023-11-30 04:01:01,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891670431] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:01,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:01,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 04:01:01,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181028417] [2023-11-30 04:01:01,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:01,249 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 04:01:01,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:01,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 04:01:01,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-30 04:01:01,253 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 294 [2023-11-30 04:01:01,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 263 transitions, 703 flow. Second operand has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:01,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:01,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 294 [2023-11-30 04:01:01,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:04,182 INFO L124 PetriNetUnfolderBase]: 9204/20715 cut-off events. [2023-11-30 04:01:04,182 INFO L125 PetriNetUnfolderBase]: For 3521/6937 co-relation queries the response was YES. [2023-11-30 04:01:04,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44650 conditions, 20715 events. 9204/20715 cut-off events. For 3521/6937 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 208239 event pairs, 8239 based on Foata normal form. 0/15549 useless extension candidates. Maximal degree in co-relation 43418. Up to 13932 conditions per place. [2023-11-30 04:01:04,345 INFO L140 encePairwiseOnDemand]: 285/294 looper letters, 101 selfloop transitions, 6 changer transitions 0/260 dead transitions. [2023-11-30 04:01:04,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 260 transitions, 905 flow [2023-11-30 04:01:04,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:01:04,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:01:04,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1124 transitions. [2023-11-30 04:01:04,348 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.63718820861678 [2023-11-30 04:01:04,348 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1124 transitions. [2023-11-30 04:01:04,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1124 transitions. [2023-11-30 04:01:04,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:04,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1124 transitions. [2023-11-30 04:01:04,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:04,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:04,356 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:04,356 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, -6 predicate places. [2023-11-30 04:01:04,357 INFO L500 AbstractCegarLoop]: Abstraction has has 268 places, 260 transitions, 905 flow [2023-11-30 04:01:04,357 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:04,358 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:04,358 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:04,358 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:01:04,358 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:01:04,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:04,359 INFO L85 PathProgramCache]: Analyzing trace with hash 950976742, now seen corresponding path program 1 times [2023-11-30 04:01:04,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:04,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821228127] [2023-11-30 04:01:04,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:04,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:04,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:04,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:04,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821228127] [2023-11-30 04:01:04,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821228127] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:04,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:04,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-30 04:01:04,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161358685] [2023-11-30 04:01:04,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:04,594 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-30 04:01:04,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:04,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-30 04:01:04,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-30 04:01:04,596 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 294 [2023-11-30 04:01:04,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 260 transitions, 905 flow. Second operand has 8 states, 8 states have (on average 194.625) internal successors, (1557), 8 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:04,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:04,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 294 [2023-11-30 04:01:04,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:07,187 INFO L124 PetriNetUnfolderBase]: 9204/20713 cut-off events. [2023-11-30 04:01:07,187 INFO L125 PetriNetUnfolderBase]: For 14037/21741 co-relation queries the response was YES. [2023-11-30 04:01:07,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54533 conditions, 20713 events. 9204/20713 cut-off events. For 14037/21741 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 208120 event pairs, 8239 based on Foata normal form. 2/19490 useless extension candidates. Maximal degree in co-relation 53049. Up to 13930 conditions per place. [2023-11-30 04:01:07,330 INFO L140 encePairwiseOnDemand]: 282/294 looper letters, 74 selfloop transitions, 10 changer transitions 0/258 dead transitions. [2023-11-30 04:01:07,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 258 transitions, 1065 flow [2023-11-30 04:01:07,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-30 04:01:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-30 04:01:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2006 transitions. [2023-11-30 04:01:07,335 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.682312925170068 [2023-11-30 04:01:07,335 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2006 transitions. [2023-11-30 04:01:07,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2006 transitions. [2023-11-30 04:01:07,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:07,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2006 transitions. [2023-11-30 04:01:07,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 200.6) internal successors, (2006), 10 states have internal predecessors, (2006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:07,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 294.0) internal successors, (3234), 11 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:07,347 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 294.0) internal successors, (3234), 11 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:07,348 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 1 predicate places. [2023-11-30 04:01:07,348 INFO L500 AbstractCegarLoop]: Abstraction has has 275 places, 258 transitions, 1065 flow [2023-11-30 04:01:07,349 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 194.625) internal successors, (1557), 8 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:07,349 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:07,349 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:07,349 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:01:07,349 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:01:07,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:07,350 INFO L85 PathProgramCache]: Analyzing trace with hash 950976741, now seen corresponding path program 1 times [2023-11-30 04:01:07,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:07,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833067634] [2023-11-30 04:01:07,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:07,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:07,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:07,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:07,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833067634] [2023-11-30 04:01:07,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833067634] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:07,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:07,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-30 04:01:07,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156304759] [2023-11-30 04:01:07,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:07,469 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-30 04:01:07,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:07,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-30 04:01:07,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-30 04:01:07,472 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 294 [2023-11-30 04:01:07,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 258 transitions, 1065 flow. Second operand has 8 states, 8 states have (on average 191.75) internal successors, (1534), 8 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:07,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:07,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 294 [2023-11-30 04:01:07,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:09,897 INFO L124 PetriNetUnfolderBase]: 9204/20711 cut-off events. [2023-11-30 04:01:09,900 INFO L125 PetriNetUnfolderBase]: For 27630/39701 co-relation queries the response was YES. [2023-11-30 04:01:09,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64411 conditions, 20711 events. 9204/20711 cut-off events. For 27630/39701 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 208224 event pairs, 8239 based on Foata normal form. 0/19488 useless extension candidates. Maximal degree in co-relation 62680. Up to 13928 conditions per place. [2023-11-30 04:01:10,065 INFO L140 encePairwiseOnDemand]: 283/294 looper letters, 74 selfloop transitions, 9 changer transitions 0/256 dead transitions. [2023-11-30 04:01:10,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 256 transitions, 1215 flow [2023-11-30 04:01:10,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 04:01:10,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 04:01:10,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1786 transitions. [2023-11-30 04:01:10,069 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6749811035525322 [2023-11-30 04:01:10,070 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1786 transitions. [2023-11-30 04:01:10,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1786 transitions. [2023-11-30 04:01:10,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:10,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1786 transitions. [2023-11-30 04:01:10,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 198.44444444444446) internal successors, (1786), 9 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:10,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 294.0) internal successors, (2940), 10 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:10,079 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 294.0) internal successors, (2940), 10 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:10,081 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 7 predicate places. [2023-11-30 04:01:10,081 INFO L500 AbstractCegarLoop]: Abstraction has has 281 places, 256 transitions, 1215 flow [2023-11-30 04:01:10,082 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 191.75) internal successors, (1534), 8 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:10,082 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:10,082 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:10,082 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:01:10,082 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:01:10,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:10,083 INFO L85 PathProgramCache]: Analyzing trace with hash -670837734, now seen corresponding path program 1 times [2023-11-30 04:01:10,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:10,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473001323] [2023-11-30 04:01:10,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:10,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:10,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:10,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:10,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473001323] [2023-11-30 04:01:10,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473001323] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:10,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:10,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-30 04:01:10,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995508157] [2023-11-30 04:01:10,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:10,523 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-30 04:01:10,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:10,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-30 04:01:10,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-30 04:01:10,526 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 294 [2023-11-30 04:01:10,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 256 transitions, 1215 flow. Second operand has 12 states, 12 states have (on average 211.33333333333334) internal successors, (2536), 12 states have internal predecessors, (2536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:10,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:10,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 294 [2023-11-30 04:01:10,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:13,008 INFO L124 PetriNetUnfolderBase]: 9203/20707 cut-off events. [2023-11-30 04:01:13,009 INFO L125 PetriNetUnfolderBase]: For 43654/56932 co-relation queries the response was YES. [2023-11-30 04:01:13,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70236 conditions, 20707 events. 9203/20707 cut-off events. For 43654/56932 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 208167 event pairs, 8239 based on Foata normal form. 0/19485 useless extension candidates. Maximal degree in co-relation 68334. Up to 13928 conditions per place. [2023-11-30 04:01:13,193 INFO L140 encePairwiseOnDemand]: 277/294 looper letters, 46 selfloop transitions, 16 changer transitions 0/252 dead transitions. [2023-11-30 04:01:13,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 252 transitions, 1331 flow [2023-11-30 04:01:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-30 04:01:13,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-30 04:01:13,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2571 transitions. [2023-11-30 04:01:13,205 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7287414965986394 [2023-11-30 04:01:13,205 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2571 transitions. [2023-11-30 04:01:13,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2571 transitions. [2023-11-30 04:01:13,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:13,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2571 transitions. [2023-11-30 04:01:13,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 214.25) internal successors, (2571), 12 states have internal predecessors, (2571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:13,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 294.0) internal successors, (3822), 13 states have internal predecessors, (3822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:13,221 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 294.0) internal successors, (3822), 13 states have internal predecessors, (3822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:13,223 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 15 predicate places. [2023-11-30 04:01:13,223 INFO L500 AbstractCegarLoop]: Abstraction has has 289 places, 252 transitions, 1331 flow [2023-11-30 04:01:13,224 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 211.33333333333334) internal successors, (2536), 12 states have internal predecessors, (2536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:13,224 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:13,225 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:13,225 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:01:13,225 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:01:13,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:13,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1502147520, now seen corresponding path program 1 times [2023-11-30 04:01:13,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:13,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194383298] [2023-11-30 04:01:13,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:13,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:13,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:13,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194383298] [2023-11-30 04:01:13,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194383298] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:13,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:13,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:01:13,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533883283] [2023-11-30 04:01:13,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:13,516 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 04:01:13,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:13,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 04:01:13,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 04:01:13,518 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 294 [2023-11-30 04:01:13,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 252 transitions, 1331 flow. Second operand has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:13,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:13,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 294 [2023-11-30 04:01:13,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:14,599 INFO L124 PetriNetUnfolderBase]: 4139/10279 cut-off events. [2023-11-30 04:01:14,600 INFO L125 PetriNetUnfolderBase]: For 33183/40095 co-relation queries the response was YES. [2023-11-30 04:01:14,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42273 conditions, 10279 events. 4139/10279 cut-off events. For 33183/40095 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 96081 event pairs, 3665 based on Foata normal form. 2352/12021 useless extension candidates. Maximal degree in co-relation 40065. Up to 6624 conditions per place. [2023-11-30 04:01:14,673 INFO L140 encePairwiseOnDemand]: 289/294 looper letters, 88 selfloop transitions, 1 changer transitions 0/248 dead transitions. [2023-11-30 04:01:14,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 248 transitions, 1481 flow [2023-11-30 04:01:14,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:14,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 624 transitions. [2023-11-30 04:01:14,676 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7074829931972789 [2023-11-30 04:01:14,676 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 624 transitions. [2023-11-30 04:01:14,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 624 transitions. [2023-11-30 04:01:14,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:14,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 624 transitions. [2023-11-30 04:01:14,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:14,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:14,684 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:14,686 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 13 predicate places. [2023-11-30 04:01:14,686 INFO L500 AbstractCegarLoop]: Abstraction has has 287 places, 248 transitions, 1481 flow [2023-11-30 04:01:14,687 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:14,687 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:14,687 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:14,687 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:01:14,687 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:01:14,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:14,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1389959763, now seen corresponding path program 1 times [2023-11-30 04:01:14,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:14,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854268139] [2023-11-30 04:01:14,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:14,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:14,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:14,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854268139] [2023-11-30 04:01:14,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854268139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:14,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:14,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:01:14,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849159733] [2023-11-30 04:01:14,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:14,794 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:01:14,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:14,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:01:14,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:01:14,796 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 294 [2023-11-30 04:01:14,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 248 transitions, 1481 flow. Second operand has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:14,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:14,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 294 [2023-11-30 04:01:14,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:16,172 INFO L124 PetriNetUnfolderBase]: 4064/10048 cut-off events. [2023-11-30 04:01:16,173 INFO L125 PetriNetUnfolderBase]: For 41845/49521 co-relation queries the response was YES. [2023-11-30 04:01:16,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46224 conditions, 10048 events. 4064/10048 cut-off events. For 41845/49521 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 93580 event pairs, 3598 based on Foata normal form. 66/9515 useless extension candidates. Maximal degree in co-relation 44232. Up to 6486 conditions per place. [2023-11-30 04:01:16,238 INFO L140 encePairwiseOnDemand]: 291/294 looper letters, 65 selfloop transitions, 1 changer transitions 0/246 dead transitions. [2023-11-30 04:01:16,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 246 transitions, 1597 flow [2023-11-30 04:01:16,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:16,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:16,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2023-11-30 04:01:16,240 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2023-11-30 04:01:16,240 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 686 transitions. [2023-11-30 04:01:16,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 686 transitions. [2023-11-30 04:01:16,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:16,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 686 transitions. [2023-11-30 04:01:16,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:16,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:16,244 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:16,245 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 13 predicate places. [2023-11-30 04:01:16,245 INFO L500 AbstractCegarLoop]: Abstraction has has 287 places, 246 transitions, 1597 flow [2023-11-30 04:01:16,245 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:16,246 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:16,246 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:16,246 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:01:16,246 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:01:16,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:16,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1389959764, now seen corresponding path program 1 times [2023-11-30 04:01:16,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:16,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463974513] [2023-11-30 04:01:16,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:16,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:16,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:16,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:16,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463974513] [2023-11-30 04:01:16,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463974513] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:16,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:16,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:01:16,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336244209] [2023-11-30 04:01:16,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:16,310 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:01:16,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:16,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:01:16,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:01:16,312 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 294 [2023-11-30 04:01:16,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 246 transitions, 1597 flow. Second operand has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:16,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:16,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 294 [2023-11-30 04:01:16,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:17,555 INFO L124 PetriNetUnfolderBase]: 3989/9817 cut-off events. [2023-11-30 04:01:17,556 INFO L125 PetriNetUnfolderBase]: For 54101/62638 co-relation queries the response was YES. [2023-11-30 04:01:17,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49879 conditions, 9817 events. 3989/9817 cut-off events. For 54101/62638 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 90965 event pairs, 3531 based on Foata normal form. 66/9295 useless extension candidates. Maximal degree in co-relation 48266. Up to 6348 conditions per place. [2023-11-30 04:01:17,621 INFO L140 encePairwiseOnDemand]: 291/294 looper letters, 64 selfloop transitions, 1 changer transitions 0/244 dead transitions. [2023-11-30 04:01:17,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 244 transitions, 1703 flow [2023-11-30 04:01:17,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:17,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:17,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2023-11-30 04:01:17,624 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7698412698412699 [2023-11-30 04:01:17,624 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 679 transitions. [2023-11-30 04:01:17,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 679 transitions. [2023-11-30 04:01:17,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:17,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 679 transitions. [2023-11-30 04:01:17,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:17,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:17,629 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:17,630 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 13 predicate places. [2023-11-30 04:01:17,630 INFO L500 AbstractCegarLoop]: Abstraction has has 287 places, 244 transitions, 1703 flow [2023-11-30 04:01:17,630 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:17,630 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:17,631 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:17,631 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:01:17,631 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:01:17,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:17,631 INFO L85 PathProgramCache]: Analyzing trace with hash -287713448, now seen corresponding path program 1 times [2023-11-30 04:01:17,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:17,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080820690] [2023-11-30 04:01:17,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:17,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:17,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:17,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:17,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080820690] [2023-11-30 04:01:17,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080820690] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:17,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:17,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:01:17,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427496169] [2023-11-30 04:01:17,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:17,744 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:01:17,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:17,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:01:17,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:01:17,745 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 294 [2023-11-30 04:01:17,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 244 transitions, 1703 flow. Second operand has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:17,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:17,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 294 [2023-11-30 04:01:17,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:18,197 INFO L124 PetriNetUnfolderBase]: 618/1889 cut-off events. [2023-11-30 04:01:18,198 INFO L125 PetriNetUnfolderBase]: For 13037/13919 co-relation queries the response was YES. [2023-11-30 04:01:18,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10186 conditions, 1889 events. 618/1889 cut-off events. For 13037/13919 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 12541 event pairs, 534 based on Foata normal form. 0/1780 useless extension candidates. Maximal degree in co-relation 8326. Up to 1098 conditions per place. [2023-11-30 04:01:18,209 INFO L140 encePairwiseOnDemand]: 290/294 looper letters, 13 selfloop transitions, 3 changer transitions 3/250 dead transitions. [2023-11-30 04:01:18,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 250 transitions, 1839 flow [2023-11-30 04:01:18,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:18,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:18,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 833 transitions. [2023-11-30 04:01:18,211 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2023-11-30 04:01:18,211 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 833 transitions. [2023-11-30 04:01:18,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 833 transitions. [2023-11-30 04:01:18,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:18,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 833 transitions. [2023-11-30 04:01:18,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 277.6666666666667) internal successors, (833), 3 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:18,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:18,227 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:18,228 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 15 predicate places. [2023-11-30 04:01:18,228 INFO L500 AbstractCegarLoop]: Abstraction has has 289 places, 250 transitions, 1839 flow [2023-11-30 04:01:18,229 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:18,229 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:18,229 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:18,229 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:01:18,229 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:01:18,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:18,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1576458658, now seen corresponding path program 1 times [2023-11-30 04:01:18,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:18,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897876988] [2023-11-30 04:01:18,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:18,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:18,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:18,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:18,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897876988] [2023-11-30 04:01:18,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897876988] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:18,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:18,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-30 04:01:18,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832918103] [2023-11-30 04:01:18,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:18,363 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-30 04:01:18,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:18,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-30 04:01:18,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-30 04:01:18,365 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 294 [2023-11-30 04:01:18,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 250 transitions, 1839 flow. Second operand has 8 states, 8 states have (on average 186.5) internal successors, (1492), 8 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:18,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:18,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 294 [2023-11-30 04:01:18,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:18,747 INFO L124 PetriNetUnfolderBase]: 563/1713 cut-off events. [2023-11-30 04:01:18,747 INFO L125 PetriNetUnfolderBase]: For 16410/17064 co-relation queries the response was YES. [2023-11-30 04:01:18,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10195 conditions, 1713 events. 563/1713 cut-off events. For 16410/17064 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 10918 event pairs, 294 based on Foata normal form. 72/1699 useless extension candidates. Maximal degree in co-relation 8161. Up to 978 conditions per place. [2023-11-30 04:01:18,758 INFO L140 encePairwiseOnDemand]: 277/294 looper letters, 83 selfloop transitions, 9 changer transitions 3/252 dead transitions. [2023-11-30 04:01:18,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 252 transitions, 2129 flow [2023-11-30 04:01:18,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 04:01:18,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 04:01:18,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1744 transitions. [2023-11-30 04:01:18,763 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6591080876795162 [2023-11-30 04:01:18,763 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1744 transitions. [2023-11-30 04:01:18,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1744 transitions. [2023-11-30 04:01:18,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:18,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1744 transitions. [2023-11-30 04:01:18,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 193.77777777777777) internal successors, (1744), 9 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:18,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 294.0) internal successors, (2940), 10 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:18,771 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 294.0) internal successors, (2940), 10 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:18,772 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 15 predicate places. [2023-11-30 04:01:18,772 INFO L500 AbstractCegarLoop]: Abstraction has has 289 places, 252 transitions, 2129 flow [2023-11-30 04:01:18,772 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 186.5) internal successors, (1492), 8 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:18,772 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:18,772 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:18,773 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:01:18,773 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:01:18,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:18,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1576458659, now seen corresponding path program 1 times [2023-11-30 04:01:18,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:18,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812111174] [2023-11-30 04:01:18,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:18,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:19,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:19,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:19,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812111174] [2023-11-30 04:01:19,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812111174] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:19,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:19,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-30 04:01:19,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572366837] [2023-11-30 04:01:19,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:19,050 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-30 04:01:19,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:19,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-30 04:01:19,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-30 04:01:19,052 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 294 [2023-11-30 04:01:19,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 252 transitions, 2129 flow. Second operand has 10 states, 10 states have (on average 183.1) internal successors, (1831), 10 states have internal predecessors, (1831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:19,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:19,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 294 [2023-11-30 04:01:19,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:19,550 INFO L124 PetriNetUnfolderBase]: 493/1580 cut-off events. [2023-11-30 04:01:19,550 INFO L125 PetriNetUnfolderBase]: For 17311/18037 co-relation queries the response was YES. [2023-11-30 04:01:19,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9884 conditions, 1580 events. 493/1580 cut-off events. For 17311/18037 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 9856 event pairs, 294 based on Foata normal form. 63/1557 useless extension candidates. Maximal degree in co-relation 7673. Up to 845 conditions per place. [2023-11-30 04:01:19,564 INFO L140 encePairwiseOnDemand]: 273/294 looper letters, 74 selfloop transitions, 14 changer transitions 3/245 dead transitions. [2023-11-30 04:01:19,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 245 transitions, 2225 flow [2023-11-30 04:01:19,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-30 04:01:19,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-30 04:01:19,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2252 transitions. [2023-11-30 04:01:19,569 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6383219954648526 [2023-11-30 04:01:19,569 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2252 transitions. [2023-11-30 04:01:19,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2252 transitions. [2023-11-30 04:01:19,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:19,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2252 transitions. [2023-11-30 04:01:19,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 187.66666666666666) internal successors, (2252), 12 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:19,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 294.0) internal successors, (3822), 13 states have internal predecessors, (3822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:19,579 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 294.0) internal successors, (3822), 13 states have internal predecessors, (3822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:19,579 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 19 predicate places. [2023-11-30 04:01:19,580 INFO L500 AbstractCegarLoop]: Abstraction has has 293 places, 245 transitions, 2225 flow [2023-11-30 04:01:19,580 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 183.1) internal successors, (1831), 10 states have internal predecessors, (1831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:19,580 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:19,580 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:19,580 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:01:19,581 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:01:19,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:19,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1625578810, now seen corresponding path program 1 times [2023-11-30 04:01:19,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:19,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064758275] [2023-11-30 04:01:19,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:19,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:20,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:20,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:20,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064758275] [2023-11-30 04:01:20,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064758275] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:20,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:20,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-30 04:01:20,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37124608] [2023-11-30 04:01:20,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:20,520 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-30 04:01:20,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:20,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-30 04:01:20,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-11-30 04:01:20,523 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 294 [2023-11-30 04:01:20,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 245 transitions, 2225 flow. Second operand has 15 states, 15 states have (on average 151.8) internal successors, (2277), 15 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:20,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:20,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 294 [2023-11-30 04:01:20,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:21,397 INFO L124 PetriNetUnfolderBase]: 543/1689 cut-off events. [2023-11-30 04:01:21,397 INFO L125 PetriNetUnfolderBase]: For 21027/21912 co-relation queries the response was YES. [2023-11-30 04:01:21,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11627 conditions, 1689 events. 543/1689 cut-off events. For 21027/21912 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10629 event pairs, 267 based on Foata normal form. 9/1611 useless extension candidates. Maximal degree in co-relation 9207. Up to 917 conditions per place. [2023-11-30 04:01:21,413 INFO L140 encePairwiseOnDemand]: 273/294 looper letters, 111 selfloop transitions, 24 changer transitions 4/270 dead transitions. [2023-11-30 04:01:21,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 270 transitions, 2988 flow [2023-11-30 04:01:21,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-30 04:01:21,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-30 04:01:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2657 transitions. [2023-11-30 04:01:21,419 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5316126450580232 [2023-11-30 04:01:21,419 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2657 transitions. [2023-11-30 04:01:21,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2657 transitions. [2023-11-30 04:01:21,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:21,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2657 transitions. [2023-11-30 04:01:21,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 156.2941176470588) internal successors, (2657), 17 states have internal predecessors, (2657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:21,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 294.0) internal successors, (5292), 18 states have internal predecessors, (5292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:21,433 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 294.0) internal successors, (5292), 18 states have internal predecessors, (5292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:21,434 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 35 predicate places. [2023-11-30 04:01:21,434 INFO L500 AbstractCegarLoop]: Abstraction has has 309 places, 270 transitions, 2988 flow [2023-11-30 04:01:21,435 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 151.8) internal successors, (2277), 15 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:21,435 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:21,435 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:21,435 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:01:21,435 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:01:21,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:21,436 INFO L85 PathProgramCache]: Analyzing trace with hash 680851560, now seen corresponding path program 1 times [2023-11-30 04:01:21,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:21,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032241155] [2023-11-30 04:01:21,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:21,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:22,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:22,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:22,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032241155] [2023-11-30 04:01:22,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032241155] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:22,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:22,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-30 04:01:22,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004100162] [2023-11-30 04:01:22,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:22,431 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-30 04:01:22,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:22,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-30 04:01:22,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2023-11-30 04:01:22,434 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 294 [2023-11-30 04:01:22,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 270 transitions, 2988 flow. Second operand has 17 states, 17 states have (on average 150.52941176470588) internal successors, (2559), 17 states have internal predecessors, (2559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:22,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:22,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 294 [2023-11-30 04:01:22,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:23,687 INFO L124 PetriNetUnfolderBase]: 808/2582 cut-off events. [2023-11-30 04:01:23,687 INFO L125 PetriNetUnfolderBase]: For 37990/38947 co-relation queries the response was YES. [2023-11-30 04:01:23,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18805 conditions, 2582 events. 808/2582 cut-off events. For 37990/38947 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 18096 event pairs, 219 based on Foata normal form. 8/2459 useless extension candidates. Maximal degree in co-relation 14999. Up to 1388 conditions per place. [2023-11-30 04:01:23,708 INFO L140 encePairwiseOnDemand]: 272/294 looper letters, 162 selfloop transitions, 28 changer transitions 4/326 dead transitions. [2023-11-30 04:01:23,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 326 transitions, 4601 flow [2023-11-30 04:01:23,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-30 04:01:23,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-30 04:01:23,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2670 transitions. [2023-11-30 04:01:23,715 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5342136854741897 [2023-11-30 04:01:23,715 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2670 transitions. [2023-11-30 04:01:23,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2670 transitions. [2023-11-30 04:01:23,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:23,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2670 transitions. [2023-11-30 04:01:23,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 157.05882352941177) internal successors, (2670), 17 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:23,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 294.0) internal successors, (5292), 18 states have internal predecessors, (5292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:23,728 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 294.0) internal successors, (5292), 18 states have internal predecessors, (5292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:23,728 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 51 predicate places. [2023-11-30 04:01:23,729 INFO L500 AbstractCegarLoop]: Abstraction has has 325 places, 326 transitions, 4601 flow [2023-11-30 04:01:23,729 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 150.52941176470588) internal successors, (2559), 17 states have internal predecessors, (2559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:23,729 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:23,729 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:23,730 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:01:23,730 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:01:23,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:23,730 INFO L85 PathProgramCache]: Analyzing trace with hash -572052910, now seen corresponding path program 1 times [2023-11-30 04:01:23,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:23,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853124496] [2023-11-30 04:01:23,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:23,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:23,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:23,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:23,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853124496] [2023-11-30 04:01:23,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853124496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:23,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:23,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:01:23,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29662428] [2023-11-30 04:01:23,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:23,780 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:01:23,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:23,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:01:23,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:01:23,782 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 294 [2023-11-30 04:01:23,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 326 transitions, 4601 flow. Second operand has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:23,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:23,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 294 [2023-11-30 04:01:23,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:24,220 INFO L124 PetriNetUnfolderBase]: 702/2152 cut-off events. [2023-11-30 04:01:24,221 INFO L125 PetriNetUnfolderBase]: For 37623/37935 co-relation queries the response was YES. [2023-11-30 04:01:24,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16553 conditions, 2152 events. 702/2152 cut-off events. For 37623/37935 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 13292 event pairs, 166 based on Foata normal form. 4/2073 useless extension candidates. Maximal degree in co-relation 13846. Up to 1178 conditions per place. [2023-11-30 04:01:24,234 INFO L140 encePairwiseOnDemand]: 291/294 looper letters, 56 selfloop transitions, 2 changer transitions 5/317 dead transitions. [2023-11-30 04:01:24,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 317 transitions, 4547 flow [2023-11-30 04:01:24,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions. [2023-11-30 04:01:24,235 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9421768707482994 [2023-11-30 04:01:24,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 831 transitions. [2023-11-30 04:01:24,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 831 transitions. [2023-11-30 04:01:24,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:24,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 831 transitions. [2023-11-30 04:01:24,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:24,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:24,238 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:24,239 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 53 predicate places. [2023-11-30 04:01:24,239 INFO L500 AbstractCegarLoop]: Abstraction has has 327 places, 317 transitions, 4547 flow [2023-11-30 04:01:24,239 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:24,239 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:24,239 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:24,239 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 04:01:24,240 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:01:24,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:24,240 INFO L85 PathProgramCache]: Analyzing trace with hash 345468283, now seen corresponding path program 1 times [2023-11-30 04:01:24,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:24,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897507315] [2023-11-30 04:01:24,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:24,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:24,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:24,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:24,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897507315] [2023-11-30 04:01:24,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897507315] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:24,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:24,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 04:01:24,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881985989] [2023-11-30 04:01:24,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:24,408 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 04:01:24,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:24,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 04:01:24,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-30 04:01:24,409 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 294 [2023-11-30 04:01:24,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 317 transitions, 4547 flow. Second operand has 7 states, 7 states have (on average 203.71428571428572) internal successors, (1426), 7 states have internal predecessors, (1426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:24,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:24,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 294 [2023-11-30 04:01:24,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:24,800 INFO L124 PetriNetUnfolderBase]: 678/2106 cut-off events. [2023-11-30 04:01:24,800 INFO L125 PetriNetUnfolderBase]: For 43453/43765 co-relation queries the response was YES. [2023-11-30 04:01:24,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17012 conditions, 2106 events. 678/2106 cut-off events. For 43453/43765 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12921 event pairs, 162 based on Foata normal form. 22/2045 useless extension candidates. Maximal degree in co-relation 14189. Up to 1132 conditions per place. [2023-11-30 04:01:24,816 INFO L140 encePairwiseOnDemand]: 290/294 looper letters, 127 selfloop transitions, 2 changer transitions 5/315 dead transitions. [2023-11-30 04:01:24,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 315 transitions, 4779 flow [2023-11-30 04:01:24,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:01:24,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:01:24,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 861 transitions. [2023-11-30 04:01:24,818 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7321428571428571 [2023-11-30 04:01:24,818 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 861 transitions. [2023-11-30 04:01:24,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 861 transitions. [2023-11-30 04:01:24,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:24,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 861 transitions. [2023-11-30 04:01:24,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 215.25) internal successors, (861), 4 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:24,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:24,821 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:24,822 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 54 predicate places. [2023-11-30 04:01:24,822 INFO L500 AbstractCegarLoop]: Abstraction has has 328 places, 315 transitions, 4779 flow [2023-11-30 04:01:24,822 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 203.71428571428572) internal successors, (1426), 7 states have internal predecessors, (1426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:24,822 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:24,822 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:24,822 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 04:01:24,822 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:01:24,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:24,823 INFO L85 PathProgramCache]: Analyzing trace with hash 345468284, now seen corresponding path program 1 times [2023-11-30 04:01:24,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:24,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668765276] [2023-11-30 04:01:24,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:24,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:25,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:25,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:25,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668765276] [2023-11-30 04:01:25,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668765276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:25,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:25,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-11-30 04:01:25,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412353718] [2023-11-30 04:01:25,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:25,610 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-30 04:01:25,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:25,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-30 04:01:25,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-11-30 04:01:25,613 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 294 [2023-11-30 04:01:25,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 315 transitions, 4779 flow. Second operand has 18 states, 18 states have (on average 161.83333333333334) internal successors, (2913), 18 states have internal predecessors, (2913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:25,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:25,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 294 [2023-11-30 04:01:25,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:26,628 INFO L124 PetriNetUnfolderBase]: 754/2241 cut-off events. [2023-11-30 04:01:26,629 INFO L125 PetriNetUnfolderBase]: For 57238/57589 co-relation queries the response was YES. [2023-11-30 04:01:26,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19586 conditions, 2241 events. 754/2241 cut-off events. For 57238/57589 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 13610 event pairs, 164 based on Foata normal form. 2/2161 useless extension candidates. Maximal degree in co-relation 16579. Up to 1223 conditions per place. [2023-11-30 04:01:26,651 INFO L140 encePairwiseOnDemand]: 269/294 looper letters, 156 selfloop transitions, 33 changer transitions 5/338 dead transitions. [2023-11-30 04:01:26,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 338 transitions, 5775 flow [2023-11-30 04:01:26,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-30 04:01:26,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-30 04:01:26,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3145 transitions. [2023-11-30 04:01:26,656 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5630146795560329 [2023-11-30 04:01:26,656 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3145 transitions. [2023-11-30 04:01:26,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3145 transitions. [2023-11-30 04:01:26,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:26,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3145 transitions. [2023-11-30 04:01:26,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 165.52631578947367) internal successors, (3145), 19 states have internal predecessors, (3145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:26,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 294.0) internal successors, (5880), 20 states have internal predecessors, (5880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:26,669 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 294.0) internal successors, (5880), 20 states have internal predecessors, (5880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:26,669 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 72 predicate places. [2023-11-30 04:01:26,669 INFO L500 AbstractCegarLoop]: Abstraction has has 346 places, 338 transitions, 5775 flow [2023-11-30 04:01:26,670 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 161.83333333333334) internal successors, (2913), 18 states have internal predecessors, (2913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:26,670 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:26,670 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:26,670 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 04:01:26,670 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:01:26,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:26,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1161989109, now seen corresponding path program 1 times [2023-11-30 04:01:26,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:26,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142505237] [2023-11-30 04:01:26,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:26,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:27,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:27,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:27,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142505237] [2023-11-30 04:01:27,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142505237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:27,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:27,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 04:01:27,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962151368] [2023-11-30 04:01:27,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:27,022 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 04:01:27,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:27,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 04:01:27,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-30 04:01:27,024 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 294 [2023-11-30 04:01:27,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 338 transitions, 5775 flow. Second operand has 7 states, 7 states have (on average 173.28571428571428) internal successors, (1213), 7 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:27,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:27,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 294 [2023-11-30 04:01:27,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:27,572 INFO L124 PetriNetUnfolderBase]: 823/2405 cut-off events. [2023-11-30 04:01:27,572 INFO L125 PetriNetUnfolderBase]: For 72145/72353 co-relation queries the response was YES. [2023-11-30 04:01:27,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22298 conditions, 2405 events. 823/2405 cut-off events. For 72145/72353 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 14577 event pairs, 166 based on Foata normal form. 9/2339 useless extension candidates. Maximal degree in co-relation 19108. Up to 1311 conditions per place. [2023-11-30 04:01:27,594 INFO L140 encePairwiseOnDemand]: 287/294 looper letters, 169 selfloop transitions, 6 changer transitions 6/346 dead transitions. [2023-11-30 04:01:27,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 346 transitions, 6387 flow [2023-11-30 04:01:27,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 04:01:27,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 04:01:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1277 transitions. [2023-11-30 04:01:27,598 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6205053449951409 [2023-11-30 04:01:27,598 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1277 transitions. [2023-11-30 04:01:27,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1277 transitions. [2023-11-30 04:01:27,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:27,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1277 transitions. [2023-11-30 04:01:27,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 182.42857142857142) internal successors, (1277), 7 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:27,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:27,602 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:27,602 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 78 predicate places. [2023-11-30 04:01:27,603 INFO L500 AbstractCegarLoop]: Abstraction has has 352 places, 346 transitions, 6387 flow [2023-11-30 04:01:27,603 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 173.28571428571428) internal successors, (1213), 7 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:27,603 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:27,603 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:27,603 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 04:01:27,603 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:01:27,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:27,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1921399839, now seen corresponding path program 1 times [2023-11-30 04:01:27,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:27,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151473001] [2023-11-30 04:01:27,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:27,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:31,571 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:31,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:31,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151473001] [2023-11-30 04:01:31,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151473001] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 04:01:31,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548638024] [2023-11-30 04:01:31,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:31,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:01:31,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:01:31,574 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 04:01:31,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-30 04:01:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:31,737 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-30 04:01:31,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 04:01:31,929 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 04:01:31,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 04:01:32,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-30 04:01:32,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 04:01:32,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-30 04:01:33,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-30 04:01:33,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-30 04:01:33,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-30 04:01:33,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 04:01:33,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-30 04:01:33,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:33,727 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 04:01:34,161 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_345 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_345 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-11-30 04:01:34,173 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_345 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_345 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-11-30 04:01:35,247 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_341 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_345 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_341))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|) .cse5) 4)))) (forall ((v_ArrVal_341 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_345 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_341))) (store (store .cse6 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|) .cse5) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-11-30 04:01:35,639 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 (select .cse3 .cse2)))) (.cse5 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_341 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_345 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_341))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|) .cse5) 4)))) (forall ((v_ArrVal_341 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_345 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_341))) (store (store .cse6 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|) .cse5) 4)) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2023-11-30 04:01:37,688 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_341 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_345 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_341))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|) .cse2) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_341 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_345 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse3 .cse4 v_ArrVal_341))) (store (store .cse5 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|) .cse2) 4))))))) is different from false [2023-11-30 04:01:37,819 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_341 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_345 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_340))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_341)))) (store (store .cse1 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_341 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_345 (Array Int Int))) (<= (+ (* 4 (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_340))) (store .cse5 |c_~#queue~0.base| (let ((.cse6 (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_341)))) (store (store .cse6 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-11-30 04:01:38,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:01:38,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 276 treesize of output 280 [2023-11-30 04:01:42,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:01:42,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 159 treesize of output 105 [2023-11-30 04:01:42,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 120 [2023-11-30 04:01:42,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 55 [2023-11-30 04:01:42,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 100 [2023-11-30 04:01:42,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:01:42,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 79 [2023-11-30 04:01:42,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:01:42,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 157 treesize of output 103 [2023-11-30 04:01:42,827 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 04:01:42,828 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 04:01:42,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2023-11-30 04:01:42,843 INFO L349 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-11-30 04:01:42,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 38 [2023-11-30 04:01:43,450 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2023-11-30 04:01:43,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548638024] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 04:01:43,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 04:01:43,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 65 [2023-11-30 04:01:43,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571398843] [2023-11-30 04:01:43,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 04:01:43,452 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-11-30 04:01:43,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:43,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-11-30 04:01:43,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=3158, Unknown=70, NotChecked=726, Total=4290 [2023-11-30 04:01:43,460 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 294 [2023-11-30 04:01:43,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 346 transitions, 6387 flow. Second operand has 66 states, 66 states have (on average 147.36363636363637) internal successors, (9726), 66 states have internal predecessors, (9726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:43,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:43,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 294 [2023-11-30 04:01:43,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:53,589 INFO L124 PetriNetUnfolderBase]: 1710/4866 cut-off events. [2023-11-30 04:01:53,590 INFO L125 PetriNetUnfolderBase]: For 171359/172186 co-relation queries the response was YES. [2023-11-30 04:01:53,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47742 conditions, 4866 events. 1710/4866 cut-off events. For 171359/172186 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 35327 event pairs, 344 based on Foata normal form. 32/4729 useless extension candidates. Maximal degree in co-relation 40949. Up to 2690 conditions per place. [2023-11-30 04:01:53,642 INFO L140 encePairwiseOnDemand]: 259/294 looper letters, 324 selfloop transitions, 95 changer transitions 10/563 dead transitions. [2023-11-30 04:01:53,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 563 transitions, 13637 flow [2023-11-30 04:01:53,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-11-30 04:01:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-11-30 04:01:53,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 6975 transitions. [2023-11-30 04:01:53,649 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5157497781721384 [2023-11-30 04:01:53,649 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 6975 transitions. [2023-11-30 04:01:53,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 6975 transitions. [2023-11-30 04:01:53,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:53,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 6975 transitions. [2023-11-30 04:01:53,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 151.6304347826087) internal successors, (6975), 46 states have internal predecessors, (6975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:53,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 294.0) internal successors, (13818), 47 states have internal predecessors, (13818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:53,676 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 294.0) internal successors, (13818), 47 states have internal predecessors, (13818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:53,677 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 123 predicate places. [2023-11-30 04:01:53,677 INFO L500 AbstractCegarLoop]: Abstraction has has 397 places, 563 transitions, 13637 flow [2023-11-30 04:01:53,679 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 147.36363636363637) internal successors, (9726), 66 states have internal predecessors, (9726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:53,679 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:53,679 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:01:53,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-30 04:01:53,888 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-30 04:01:53,888 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:01:53,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:53,889 INFO L85 PathProgramCache]: Analyzing trace with hash -68706586, now seen corresponding path program 1 times [2023-11-30 04:01:53,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:53,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085587118] [2023-11-30 04:01:53,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:53,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:58,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:58,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085587118] [2023-11-30 04:01:58,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085587118] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:58,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:58,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-11-30 04:01:58,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151539265] [2023-11-30 04:01:58,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:58,204 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-30 04:01:58,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:58,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-30 04:01:58,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2023-11-30 04:01:58,206 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 294 [2023-11-30 04:01:58,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 563 transitions, 13637 flow. Second operand has 20 states, 20 states have (on average 146.9) internal successors, (2938), 20 states have internal predecessors, (2938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:58,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:58,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 294 [2023-11-30 04:01:58,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:02:04,640 INFO L124 PetriNetUnfolderBase]: 1834/5160 cut-off events. [2023-11-30 04:02:04,640 INFO L125 PetriNetUnfolderBase]: For 199272/200306 co-relation queries the response was YES. [2023-11-30 04:02:04,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54448 conditions, 5160 events. 1834/5160 cut-off events. For 199272/200306 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 37514 event pairs, 346 based on Foata normal form. 1/4993 useless extension candidates. Maximal degree in co-relation 47251. Up to 2897 conditions per place. [2023-11-30 04:02:04,704 INFO L140 encePairwiseOnDemand]: 269/294 looper letters, 432 selfloop transitions, 45 changer transitions 10/630 dead transitions. [2023-11-30 04:02:04,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 630 transitions, 16930 flow [2023-11-30 04:02:04,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-30 04:02:04,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-11-30 04:02:04,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3633 transitions. [2023-11-30 04:02:04,708 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5148809523809523 [2023-11-30 04:02:04,708 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3633 transitions. [2023-11-30 04:02:04,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3633 transitions. [2023-11-30 04:02:04,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:02:04,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3633 transitions. [2023-11-30 04:02:04,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 151.375) internal successors, (3633), 24 states have internal predecessors, (3633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:04,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 294.0) internal successors, (7350), 25 states have internal predecessors, (7350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:04,721 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 294.0) internal successors, (7350), 25 states have internal predecessors, (7350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:04,722 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 146 predicate places. [2023-11-30 04:02:04,722 INFO L500 AbstractCegarLoop]: Abstraction has has 420 places, 630 transitions, 16930 flow [2023-11-30 04:02:04,723 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 146.9) internal successors, (2938), 20 states have internal predecessors, (2938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:04,723 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:02:04,723 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:02:04,723 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-30 04:02:04,723 INFO L425 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:02:04,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:02:04,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1741720656, now seen corresponding path program 2 times [2023-11-30 04:02:04,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:02:04,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11811263] [2023-11-30 04:02:04,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:02:04,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:02:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:02:05,956 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:02:05,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:02:05,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11811263] [2023-11-30 04:02:05,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11811263] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:02:05,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:02:05,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-30 04:02:05,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387066243] [2023-11-30 04:02:05,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:02:05,957 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-30 04:02:05,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:02:05,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-30 04:02:05,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2023-11-30 04:02:05,959 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 294 [2023-11-30 04:02:05,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 630 transitions, 16930 flow. Second operand has 19 states, 19 states have (on average 147.05263157894737) internal successors, (2794), 19 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:05,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:02:05,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 294 [2023-11-30 04:02:05,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:02:08,360 INFO L124 PetriNetUnfolderBase]: 1954/5444 cut-off events. [2023-11-30 04:02:08,360 INFO L125 PetriNetUnfolderBase]: For 234845/236070 co-relation queries the response was YES. [2023-11-30 04:02:08,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61321 conditions, 5444 events. 1954/5444 cut-off events. For 234845/236070 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 40027 event pairs, 388 based on Foata normal form. 14/5284 useless extension candidates. Maximal degree in co-relation 53720. Up to 3080 conditions per place. [2023-11-30 04:02:08,409 INFO L140 encePairwiseOnDemand]: 268/294 looper letters, 464 selfloop transitions, 58 changer transitions 10/675 dead transitions. [2023-11-30 04:02:08,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 675 transitions, 19590 flow [2023-11-30 04:02:08,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-30 04:02:08,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-30 04:02:08,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3190 transitions. [2023-11-30 04:02:08,411 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5166828636216392 [2023-11-30 04:02:08,411 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3190 transitions. [2023-11-30 04:02:08,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3190 transitions. [2023-11-30 04:02:08,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:02:08,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3190 transitions. [2023-11-30 04:02:08,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 151.9047619047619) internal successors, (3190), 21 states have internal predecessors, (3190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:08,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 294.0) internal successors, (6468), 22 states have internal predecessors, (6468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:08,420 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 294.0) internal successors, (6468), 22 states have internal predecessors, (6468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:08,420 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 166 predicate places. [2023-11-30 04:02:08,420 INFO L500 AbstractCegarLoop]: Abstraction has has 440 places, 675 transitions, 19590 flow [2023-11-30 04:02:08,421 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 147.05263157894737) internal successors, (2794), 19 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:08,421 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:02:08,421 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:02:08,421 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-30 04:02:08,421 INFO L425 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:02:08,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:02:08,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1276130532, now seen corresponding path program 3 times [2023-11-30 04:02:08,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:02:08,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888327806] [2023-11-30 04:02:08,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:02:08,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:02:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:02:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:02:09,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:02:09,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888327806] [2023-11-30 04:02:09,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888327806] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 04:02:09,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000961558] [2023-11-30 04:02:09,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-30 04:02:09,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:02:09,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:02:09,231 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 04:02:09,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-30 04:02:09,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-30 04:02:09,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 04:02:09,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-30 04:02:09,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 04:02:09,820 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2023-11-30 04:02:09,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2023-11-30 04:02:09,913 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-11-30 04:02:09,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2023-11-30 04:02:10,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-30 04:02:10,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 04:02:11,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-30 04:02:11,497 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2023-11-30 04:02:11,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 24 [2023-11-30 04:02:11,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-30 04:02:11,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-30 04:02:11,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-30 04:02:11,724 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:02:11,725 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 04:02:11,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000961558] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:02:11,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 04:02:11,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [15] total 36 [2023-11-30 04:02:11,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594217874] [2023-11-30 04:02:11,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:02:11,726 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-30 04:02:11,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:02:11,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-30 04:02:11,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2023-11-30 04:02:11,728 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 294 [2023-11-30 04:02:11,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 675 transitions, 19590 flow. Second operand has 22 states, 22 states have (on average 161.5909090909091) internal successors, (3555), 22 states have internal predecessors, (3555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:11,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:02:11,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 294 [2023-11-30 04:02:11,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:02:14,152 INFO L124 PetriNetUnfolderBase]: 1923/5354 cut-off events. [2023-11-30 04:02:14,152 INFO L125 PetriNetUnfolderBase]: For 247766/248994 co-relation queries the response was YES. [2023-11-30 04:02:14,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63631 conditions, 5354 events. 1923/5354 cut-off events. For 247766/248994 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 39454 event pairs, 368 based on Foata normal form. 10/5200 useless extension candidates. Maximal degree in co-relation 55673. Up to 3042 conditions per place. [2023-11-30 04:02:14,217 INFO L140 encePairwiseOnDemand]: 269/294 looper letters, 449 selfloop transitions, 51 changer transitions 10/680 dead transitions. [2023-11-30 04:02:14,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 680 transitions, 20755 flow [2023-11-30 04:02:14,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-30 04:02:14,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-11-30 04:02:14,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3632 transitions. [2023-11-30 04:02:14,221 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5615337043908473 [2023-11-30 04:02:14,221 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3632 transitions. [2023-11-30 04:02:14,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3632 transitions. [2023-11-30 04:02:14,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:02:14,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3632 transitions. [2023-11-30 04:02:14,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 165.0909090909091) internal successors, (3632), 22 states have internal predecessors, (3632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:14,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 294.0) internal successors, (6762), 23 states have internal predecessors, (6762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:14,231 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 294.0) internal successors, (6762), 23 states have internal predecessors, (6762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:14,231 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 187 predicate places. [2023-11-30 04:02:14,231 INFO L500 AbstractCegarLoop]: Abstraction has has 461 places, 680 transitions, 20755 flow [2023-11-30 04:02:14,232 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 161.5909090909091) internal successors, (3555), 22 states have internal predecessors, (3555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:14,232 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:02:14,232 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:02:14,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-30 04:02:14,439 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-30 04:02:14,440 INFO L425 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:02:14,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:02:14,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1198348365, now seen corresponding path program 1 times [2023-11-30 04:02:14,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:02:14,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096473818] [2023-11-30 04:02:14,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:02:14,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:02:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:02:16,310 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:02:16,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:02:16,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096473818] [2023-11-30 04:02:16,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096473818] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 04:02:16,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570981674] [2023-11-30 04:02:16,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:02:16,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:02:16,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:02:16,311 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 04:02:16,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-30 04:02:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:02:16,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-30 04:02:16,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 04:02:16,559 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-30 04:02:16,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-30 04:02:16,600 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 04:02:16,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 04:02:16,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-30 04:02:16,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 04:02:17,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-30 04:02:17,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-30 04:02:17,775 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2023-11-30 04:02:17,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 24 [2023-11-30 04:02:17,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-30 04:02:18,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-30 04:02:18,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 04:02:18,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-30 04:02:18,509 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:02:18,509 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 04:02:18,673 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_533 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_533) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_533 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_533) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-11-30 04:02:18,798 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_533 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_533) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_533 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_533) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-11-30 04:02:18,808 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_533 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_533) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_533 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_533) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-11-30 04:02:22,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:02:22,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 284 treesize of output 288 [2023-11-30 04:02:22,885 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) 0)))) (and (or (and (forall ((v_ArrVal_528 (Array Int Int)) (v_ArrVal_527 (Array Int Int))) (< (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_527) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_528) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|) 0)) (forall ((v_prenex_5 Int) (v_prenex_10 (Array Int Int)) (v_prenex_6 (Array Int Int)) (v_prenex_8 Int) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse4 (store (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_prenex_7) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_6))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| (* v_prenex_9 4)))) (or (< (select .cse2 .cse1) v_prenex_9) (< .cse3 0) (< 0 (+ |c_~#queue~0.offset| 1 (* 4 (select (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 .cse3 v_prenex_5))) (store (store .cse5 .cse6 (+ v_prenex_8 1)) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_prenex_10) |c_~#queue~0.base|) .cse1))))))))) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|)) (forall ((v_ArrVal_530 Int) (v_ArrVal_528 (Array Int Int)) (v_ArrVal_527 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_533 (Array Int Int))) (let ((.cse7 (store (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_527) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_528))) (let ((.cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|))) (.cse9 (select .cse7 |c_~#queue~0.base|))) (or (< (+ (* (select (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse9 .cse10 v_ArrVal_530))) (store (store .cse8 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_533) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|) (+ 3209 |c_ULTIMATE.start_init_~q#1.offset|)) (< .cse10 0) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|))))) (forall ((v_prenex_5 Int) (v_prenex_10 (Array Int Int)) (v_prenex_6 (Array Int Int)) (v_prenex_8 Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse13 (store (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_prenex_7) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_6))) (let ((.cse11 (select .cse13 |c_~#queue~0.base|)) (.cse12 (+ |c_~#queue~0.offset| (* v_prenex_9 4)))) (or (< (select .cse11 .cse1) v_prenex_9) (< .cse12 0) (< 0 (+ |c_~#queue~0.offset| 1 (* 4 (select (select (store (store .cse13 |c_~#queue~0.base| (let ((.cse14 (store .cse11 .cse12 v_prenex_5))) (store (store .cse14 .cse6 (+ v_prenex_8 1)) .cse1 (+ (select .cse14 .cse1) 1)))) |c_~#stored_elements~0.base| v_prenex_10) |c_~#queue~0.base|) .cse1)))))))))) is different from false [2023-11-30 04:02:22,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:02:22,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 512 treesize of output 338 [2023-11-30 04:02:22,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:02:22,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1176 treesize of output 1162 [2023-11-30 04:02:22,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 904 treesize of output 888 [2023-11-30 04:02:23,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 888 treesize of output 872 [2023-11-30 04:02:23,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 883 treesize of output 875 [2023-11-30 04:02:23,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 875 treesize of output 867 [2023-11-30 04:02:23,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 867 treesize of output 863 [2023-11-30 04:02:23,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 874 treesize of output 866 [2023-11-30 04:02:23,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 878 treesize of output 870 [2023-11-30 04:02:23,114 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-30 04:02:23,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 894 treesize of output 878 [2023-11-30 04:02:23,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 878 treesize of output 862 [2023-11-30 04:02:23,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 884 treesize of output 868 [2023-11-30 04:02:23,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 868 treesize of output 852 [2023-11-30 04:02:23,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-30 04:02:23,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:02:23,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 157 [2023-11-30 04:02:24,533 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2023-11-30 04:02:24,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 90 [2023-11-30 04:02:24,581 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:02:24,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570981674] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 04:02:24,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 04:02:24,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 24] total 70 [2023-11-30 04:02:24,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309128866] [2023-11-30 04:02:24,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 04:02:24,583 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-11-30 04:02:24,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:02:24,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-11-30 04:02:24,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=4022, Unknown=40, NotChecked=532, Total=4970 [2023-11-30 04:02:24,589 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 294 [2023-11-30 04:02:24,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 680 transitions, 20755 flow. Second operand has 71 states, 71 states have (on average 146.2394366197183) internal successors, (10383), 71 states have internal predecessors, (10383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:24,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:02:24,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 294 [2023-11-30 04:02:24,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:02:33,532 INFO L124 PetriNetUnfolderBase]: 2731/7718 cut-off events. [2023-11-30 04:02:33,533 INFO L125 PetriNetUnfolderBase]: For 387395/389782 co-relation queries the response was YES. [2023-11-30 04:02:33,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94733 conditions, 7718 events. 2731/7718 cut-off events. For 387395/389782 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 63020 event pairs, 475 based on Foata normal form. 40/7489 useless extension candidates. Maximal degree in co-relation 82166. Up to 4353 conditions per place. [2023-11-30 04:02:33,622 INFO L140 encePairwiseOnDemand]: 259/294 looper letters, 625 selfloop transitions, 118 changer transitions 14/900 dead transitions. [2023-11-30 04:02:33,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 497 places, 900 transitions, 30600 flow [2023-11-30 04:02:33,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-30 04:02:33,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-11-30 04:02:33,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 5646 transitions. [2023-11-30 04:02:33,629 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5190292333149475 [2023-11-30 04:02:33,630 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 5646 transitions. [2023-11-30 04:02:33,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 5646 transitions. [2023-11-30 04:02:33,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:02:33,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 5646 transitions. [2023-11-30 04:02:33,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 152.59459459459458) internal successors, (5646), 37 states have internal predecessors, (5646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:33,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 294.0) internal successors, (11172), 38 states have internal predecessors, (11172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:33,645 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 294.0) internal successors, (11172), 38 states have internal predecessors, (11172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:33,645 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 223 predicate places. [2023-11-30 04:02:33,645 INFO L500 AbstractCegarLoop]: Abstraction has has 497 places, 900 transitions, 30600 flow [2023-11-30 04:02:33,646 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 146.2394366197183) internal successors, (10383), 71 states have internal predecessors, (10383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:33,647 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:02:33,647 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:02:33,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-30 04:02:33,851 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:02:33,852 INFO L425 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:02:33,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:02:33,852 INFO L85 PathProgramCache]: Analyzing trace with hash -204489033, now seen corresponding path program 1 times [2023-11-30 04:02:33,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:02:33,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498258645] [2023-11-30 04:02:33,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:02:33,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:02:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:02:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:02:33,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:02:33,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498258645] [2023-11-30 04:02:33,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498258645] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 04:02:33,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906995327] [2023-11-30 04:02:33,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:02:33,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:02:33,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:02:33,952 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 04:02:33,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-30 04:02:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:02:34,084 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 04:02:34,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 04:02:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:02:34,155 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 04:02:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:02:34,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906995327] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 04:02:34,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 04:02:34,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-30 04:02:34,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885653969] [2023-11-30 04:02:34,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 04:02:34,209 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-30 04:02:34,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:02:34,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-30 04:02:34,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-30 04:02:34,211 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 294 [2023-11-30 04:02:34,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 900 transitions, 30600 flow. Second operand has 10 states, 10 states have (on average 270.4) internal successors, (2704), 10 states have internal predecessors, (2704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:34,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:02:34,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 294 [2023-11-30 04:02:34,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:02:36,977 INFO L124 PetriNetUnfolderBase]: 3556/9710 cut-off events. [2023-11-30 04:02:36,977 INFO L125 PetriNetUnfolderBase]: For 554502/557406 co-relation queries the response was YES. [2023-11-30 04:02:37,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124006 conditions, 9710 events. 3556/9710 cut-off events. For 554502/557406 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 77696 event pairs, 542 based on Foata normal form. 2/9414 useless extension candidates. Maximal degree in co-relation 111357. Up to 5570 conditions per place. [2023-11-30 04:02:37,099 INFO L140 encePairwiseOnDemand]: 288/294 looper letters, 487 selfloop transitions, 9 changer transitions 14/1071 dead transitions. [2023-11-30 04:02:37,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 1071 transitions, 39299 flow [2023-11-30 04:02:37,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 04:02:37,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 04:02:37,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2463 transitions. [2023-11-30 04:02:37,101 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9308390022675737 [2023-11-30 04:02:37,101 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2463 transitions. [2023-11-30 04:02:37,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2463 transitions. [2023-11-30 04:02:37,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:02:37,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2463 transitions. [2023-11-30 04:02:37,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 273.6666666666667) internal successors, (2463), 9 states have internal predecessors, (2463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:37,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 294.0) internal successors, (2940), 10 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:37,105 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 294.0) internal successors, (2940), 10 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:37,105 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 231 predicate places. [2023-11-30 04:02:37,105 INFO L500 AbstractCegarLoop]: Abstraction has has 505 places, 1071 transitions, 39299 flow [2023-11-30 04:02:37,106 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 270.4) internal successors, (2704), 10 states have internal predecessors, (2704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:37,106 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:02:37,106 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:02:37,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-30 04:02:37,311 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:02:37,312 INFO L425 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:02:37,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:02:37,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1314089673, now seen corresponding path program 1 times [2023-11-30 04:02:37,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:02:37,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112806367] [2023-11-30 04:02:37,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:02:37,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:02:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:02:37,609 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:02:37,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:02:37,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112806367] [2023-11-30 04:02:37,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112806367] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 04:02:37,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285791064] [2023-11-30 04:02:37,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:02:37,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:02:37,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:02:37,612 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 04:02:37,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-30 04:02:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:02:37,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-30 04:02:37,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 04:02:37,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 04:02:37,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 04:02:37,835 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-30 04:02:37,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-30 04:02:37,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 04:02:37,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 04:02:38,624 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:02:38,624 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 04:02:39,139 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:02:39,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285791064] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 04:02:39,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 04:02:39,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2023-11-30 04:02:39,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958140715] [2023-11-30 04:02:39,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 04:02:39,141 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-30 04:02:39,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:02:39,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-30 04:02:39,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2023-11-30 04:02:39,143 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 294 [2023-11-30 04:02:39,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 505 places, 1071 transitions, 39299 flow. Second operand has 22 states, 22 states have (on average 173.22727272727272) internal successors, (3811), 22 states have internal predecessors, (3811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:39,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:02:39,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 294 [2023-11-30 04:02:39,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:02:43,381 INFO L124 PetriNetUnfolderBase]: 4460/11931 cut-off events. [2023-11-30 04:02:43,382 INFO L125 PetriNetUnfolderBase]: For 764430/767833 co-relation queries the response was YES. [2023-11-30 04:02:43,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161660 conditions, 11931 events. 4460/11931 cut-off events. For 764430/767833 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 101119 event pairs, 566 based on Foata normal form. 82/11682 useless extension candidates. Maximal degree in co-relation 148455. Up to 7015 conditions per place. [2023-11-30 04:02:43,535 INFO L140 encePairwiseOnDemand]: 285/294 looper letters, 1099 selfloop transitions, 16 changer transitions 14/1367 dead transitions. [2023-11-30 04:02:43,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 1367 transitions, 54849 flow [2023-11-30 04:02:43,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-30 04:02:43,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-30 04:02:43,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2166 transitions. [2023-11-30 04:02:43,537 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6139455782312925 [2023-11-30 04:02:43,537 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2166 transitions. [2023-11-30 04:02:43,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2166 transitions. [2023-11-30 04:02:43,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:02:43,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2166 transitions. [2023-11-30 04:02:43,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 180.5) internal successors, (2166), 12 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:43,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 294.0) internal successors, (3822), 13 states have internal predecessors, (3822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:43,542 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 294.0) internal successors, (3822), 13 states have internal predecessors, (3822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:43,543 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 242 predicate places. [2023-11-30 04:02:43,543 INFO L500 AbstractCegarLoop]: Abstraction has has 516 places, 1367 transitions, 54849 flow [2023-11-30 04:02:43,544 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 173.22727272727272) internal successors, (3811), 22 states have internal predecessors, (3811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:02:43,544 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:02:43,544 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:02:43,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-30 04:02:43,749 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-30 04:02:43,749 INFO L425 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:02:43,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:02:43,749 INFO L85 PathProgramCache]: Analyzing trace with hash 743015464, now seen corresponding path program 2 times [2023-11-30 04:02:43,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:02:43,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812404723] [2023-11-30 04:02:43,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:02:43,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:02:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:02:46,484 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:02:46,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:02:46,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812404723] [2023-11-30 04:02:46,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812404723] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 04:02:46,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729632824] [2023-11-30 04:02:46,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 04:02:46,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:02:46,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:02:46,486 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 04:02:46,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-30 04:02:46,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 04:02:46,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 04:02:46,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 92 conjunts are in the unsatisfiable core [2023-11-30 04:02:46,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 04:02:46,758 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-30 04:02:46,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-30 04:02:46,802 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 04:02:46,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 04:02:46,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-30 04:02:47,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 04:02:47,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-30 04:02:47,934 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2023-11-30 04:02:47,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 24 [2023-11-30 04:02:48,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-30 04:02:48,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-30 04:02:48,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 04:02:48,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-30 04:02:48,785 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-11-30 04:02:48,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2023-11-30 04:02:48,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-30 04:02:49,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2023-11-30 04:02:49,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 04:02:49,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-30 04:02:49,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-30 04:02:49,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-30 04:02:49,640 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:02:49,640 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 04:02:49,795 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (and (forall ((v_ArrVal_748 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_748) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) .cse0) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 4) (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (forall ((v_ArrVal_748 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_748) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) .cse0) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))))) is different from false [2023-11-30 04:02:49,832 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_748 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_748) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_748 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_748) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-11-30 04:02:50,046 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int))) (<= (+ (* 4 (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_747) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_748) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_747) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_748) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))))) is different from false [2023-11-30 04:02:50,057 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_747) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_748) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_747) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_748) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-11-30 04:02:50,067 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_747) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_748) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_747) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_748) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-11-30 04:02:52,128 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_747) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_748) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_747) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_748) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2023-11-30 04:02:53,033 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((v_ArrVal_742 (Array Int Int))) (let ((.cse5 (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_742) |c_~#queue~0.base|))) (let ((.cse0 (+ (* (select .cse5 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse0 0) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_744 Int)) (<= (+ (* (select (select (store (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse0 v_ArrVal_744))) (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_747) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_748) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))) (forall ((v_ArrVal_742 (Array Int Int))) (let ((.cse8 (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_742) |c_~#queue~0.base|))) (let ((.cse6 (+ (* (select .cse8 .cse4) 4) |c_~#queue~0.offset|))) (or (< .cse6 0) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_744 Int)) (<= 0 (+ (* (select (select (store (store (store .cse1 |c_~#queue~0.base| (let ((.cse7 (store .cse8 .cse6 v_ArrVal_744))) (store (store .cse7 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ (select .cse7 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_747) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_748) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))))))))) is different from false [2023-11-30 04:02:53,057 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_742 (Array Int Int))) (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_742) |c_~#queue~0.base|))) (let ((.cse5 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_744 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse5 v_ArrVal_744))) (store (store .cse1 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_747) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_748) |c_~#queue~0.base|) .cse3) 4)))) (< .cse5 0))))) (forall ((v_ArrVal_742 (Array Int Int))) (let ((.cse7 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_742) |c_~#queue~0.base|))) (let ((.cse8 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_744 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store .cse0 |c_~#queue~0.base| (let ((.cse6 (store .cse7 .cse8 v_ArrVal_744))) (store (store .cse6 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_747) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_748) |c_~#queue~0.base|) .cse3) 4)) (select |c_#length| |c_~#queue~0.base|))) (< .cse8 0))))))) is different from false [2023-11-30 04:03:49,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:03:49,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 758 treesize of output 762 [2023-11-30 04:03:49,318 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (and (or (forall ((v_prenex_27 Int) (v_prenex_32 Int) (v_prenex_31 Int) (v_prenex_33 (Array Int Int)) (v_prenex_28 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_prenex_28))) (let ((.cse1 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ (* v_prenex_27 4) |c_~#queue~0.offset|) v_prenex_32))) (let ((.cse0 (select .cse4 .cse2))) (or (= 800 .cse0) (< (select .cse1 .cse2) v_prenex_27) (< (+ (* (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 (+ v_prenex_31 1)) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_prenex_33) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|) 0))))))) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_~q#1.base|)) (forall ((v_prenex_27 Int) (v_prenex_34 Int) (v_prenex_30 (Array Int Int)) (v_prenex_32 Int) (v_prenex_31 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_subst_1 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_prenex_28))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse12 (store .cse7 (+ (* v_prenex_27 4) |c_~#queue~0.offset|) v_prenex_32))) (let ((.cse6 (select .cse12 .cse2))) (let ((.cse11 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse12 .cse5 (+ v_prenex_31 1)) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_prenex_33) |c_~#queue~0.base|))) (let ((.cse8 (+ (* (select .cse11 .cse2) 4) |c_~#queue~0.offset|))) (or (= 800 .cse6) (< (select .cse7 .cse2) v_prenex_27) (< .cse8 0) (< (+ (* (select (select (store (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse11 .cse8 v_prenex_34))) (store (store .cse10 .cse5 (+ v_subst_1 1)) .cse2 (+ (select .cse10 .cse2) 1)))) |c_~#stored_elements~0.base| v_prenex_30) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_29) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|) (+ |c_ULTIMATE.start_empty_~q#1.offset| 3205)))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_739 Int) (v_subst_2 Int) (v_ArrVal_742 (Array Int Int)) (v_ArrVal_744 Int)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_737))) (let ((.cse15 (select .cse16 |c_~#queue~0.base|))) (let ((.cse19 (store .cse15 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_739))) (let ((.cse13 (select .cse19 .cse2))) (let ((.cse18 (select (store (store .cse16 |c_~#queue~0.base| (store (store .cse19 .cse5 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_742) |c_~#queue~0.base|))) (let ((.cse14 (+ |c_~#queue~0.offset| (* (select .cse18 .cse2) 4)))) (or (= 800 .cse13) (< .cse14 0) (< (select .cse15 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< 0 (+ (* (select (select (store (store (store .cse16 |c_~#queue~0.base| (let ((.cse17 (store .cse18 .cse14 v_ArrVal_744))) (store (store .cse17 .cse5 (+ v_subst_2 1)) .cse2 (+ (select .cse17 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_747) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_748) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 1)))))))))))) is different from false [2023-11-30 04:03:52,461 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_prenex_27 Int) (v_prenex_34 Int) (v_prenex_30 (Array Int Int)) (v_prenex_32 Int) (v_prenex_31 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_subst_1 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_prenex_28))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse8 (store .cse1 (+ (* v_prenex_27 4) |c_~#queue~0.offset|) v_prenex_32))) (let ((.cse0 (select .cse8 .cse2))) (let ((.cse7 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse8 .cse6 (+ v_prenex_31 1)) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_prenex_33) |c_~#queue~0.base|))) (let ((.cse3 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|))) (or (= 800 .cse0) (< (select .cse1 .cse2) v_prenex_27) (< .cse3 0) (< (select (select (store (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse7 .cse3 v_prenex_34))) (store (store .cse5 .cse6 (+ v_subst_1 1)) .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_prenex_30) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_29) |c_~#queue~0.base|) .cse2) 802))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_739 Int) (v_subst_2 Int) (v_ArrVal_742 (Array Int Int)) (v_ArrVal_744 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_737))) (let ((.cse11 (select .cse12 |c_~#queue~0.base|))) (let ((.cse15 (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_739))) (let ((.cse9 (select .cse15 .cse2))) (let ((.cse14 (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse15 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_742) |c_~#queue~0.base|))) (let ((.cse10 (+ |c_~#queue~0.offset| (* (select .cse14 .cse2) 4)))) (or (= 800 .cse9) (< .cse10 0) (< (select .cse11 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (< 0 (+ (* (select (select (store (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse14 .cse10 v_ArrVal_744))) (store (store .cse13 .cse6 (+ v_subst_2 1)) .cse2 (+ (select .cse13 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_747) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_748) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 1)))))))))))) is different from false [2023-11-30 04:03:52,555 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse9 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) 0)))) (and (forall ((v_prenex_27 Int) (v_prenex_34 Int) (v_prenex_30 (Array Int Int)) (v_prenex_32 Int) (v_prenex_31 Int) (v_prenex_33 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_subst_1 Int)) (let ((.cse4 (store .cse9 |c_ULTIMATE.start_main_~#id1~0#1.base| v_prenex_28))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse8 (store .cse2 (+ (* v_prenex_27 4) |c_~#queue~0.offset|) v_prenex_32))) (let ((.cse1 (select .cse8 .cse3))) (let ((.cse7 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse8 .cse6 (+ v_prenex_31 1)) .cse3 (+ 1 .cse1))) |c_~#stored_elements~0.base| v_prenex_33) |c_~#queue~0.base|))) (let ((.cse0 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|))) (or (< .cse0 0) (= 800 .cse1) (< (select .cse2 .cse3) v_prenex_27) (< (select (select (store (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse7 .cse0 v_prenex_34))) (store (store .cse5 .cse6 (+ v_subst_1 1)) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_prenex_30) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_29) |c_~#queue~0.base|) .cse3) 802))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_739 Int) (v_subst_2 Int) (v_ArrVal_742 (Array Int Int)) (v_ArrVal_744 Int)) (let ((.cse10 (store .cse9 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_737))) (let ((.cse14 (select .cse10 |c_~#queue~0.base|))) (let ((.cse16 (store .cse14 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_739))) (let ((.cse15 (select .cse16 .cse3))) (let ((.cse12 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse16 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ .cse15 1))) |c_~#stored_elements~0.base| v_ArrVal_742) |c_~#queue~0.base|))) (let ((.cse13 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|))) (or (< 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse12 .cse13 v_ArrVal_744))) (store (store .cse11 .cse6 (+ v_subst_2 1)) .cse3 (+ (select .cse11 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_747) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_748) |c_~#queue~0.base|) .cse3) 4) 1)) (< (select .cse14 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) (= 800 .cse15) (< .cse13 0))))))))))) is different from false [2023-11-30 04:03:52,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:03:52,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1284 treesize of output 765 [2023-11-30 04:03:52,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:03:52,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1269 treesize of output 1243 [2023-11-30 04:03:52,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 829 treesize of output 805 [2023-11-30 04:03:52,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 805 treesize of output 789 [2023-11-30 04:03:52,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 789 treesize of output 781 [2023-11-30 04:03:52,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 781 treesize of output 773 [2023-11-30 04:03:52,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 773 treesize of output 757 [2023-11-30 04:03:52,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 757 treesize of output 749 [2023-11-30 04:03:52,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 762 treesize of output 738 [2023-11-30 04:03:52,707 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-30 04:03:52,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 728 treesize of output 720 [2023-11-30 04:03:52,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-30 04:03:53,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:03:53,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 369 treesize of output 307 [2023-11-30 04:03:54,106 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2023-11-30 04:03:54,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 90 [2023-11-30 04:03:54,197 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 31 not checked. [2023-11-30 04:03:54,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729632824] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 04:03:54,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 04:03:54,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34, 38] total 101 [2023-11-30 04:03:54,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103005799] [2023-11-30 04:03:54,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 04:03:54,199 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2023-11-30 04:03:54,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:03:54,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2023-11-30 04:03:54,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=679, Invalid=7414, Unknown=141, NotChecked=2068, Total=10302 [2023-11-30 04:03:54,209 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 294 [2023-11-30 04:03:54,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 1367 transitions, 54849 flow. Second operand has 102 states, 102 states have (on average 142.1764705882353) internal successors, (14502), 102 states have internal predecessors, (14502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:03:54,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:03:54,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 294 [2023-11-30 04:03:54,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:04:20,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:04:25,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:04:29,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:04:31,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:04:33,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:04:36,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:04:39,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:04:45,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:04:48,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:05:07,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:05:09,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:05:19,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:05:21,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:05:23,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:05:26,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:05:27,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:05:29,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:05:31,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:05:34,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:06:20,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:06:22,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:06:26,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:06:28,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:06:33,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:06:35,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:06:37,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:06:40,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:06:42,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:06:44,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:06:46,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:07:09,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:07:11,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:07:13,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:07:15,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:07:17,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:07:19,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:07:21,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:07:23,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:07:26,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:07:28,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:07:31,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:07:33,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:07:36,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:07:38,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:07:53,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:07:55,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:07:57,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:08:01,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:08:03,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:08:05,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:08:08,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:08:10,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:08:13,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:08:16,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:08:20,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:08:26,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:08:28,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:08:32,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:08:57,112 INFO L124 PetriNetUnfolderBase]: 6661/18054 cut-off events. [2023-11-30 04:08:57,112 INFO L125 PetriNetUnfolderBase]: For 1170280/1175123 co-relation queries the response was YES. [2023-11-30 04:08:57,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252386 conditions, 18054 events. 6661/18054 cut-off events. For 1170280/1175123 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 167596 event pairs, 864 based on Foata normal form. 105/17644 useless extension candidates. Maximal degree in co-relation 229278. Up to 10492 conditions per place. [2023-11-30 04:08:57,672 INFO L140 encePairwiseOnDemand]: 254/294 looper letters, 1608 selfloop transitions, 300 changer transitions 22/2063 dead transitions. [2023-11-30 04:08:57,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 2063 transitions, 88961 flow [2023-11-30 04:08:57,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-11-30 04:08:57,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2023-11-30 04:08:57,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 10266 transitions. [2023-11-30 04:08:57,680 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5060632948831707 [2023-11-30 04:08:57,680 INFO L72 ComplementDD]: Start complementDD. Operand 69 states and 10266 transitions. [2023-11-30 04:08:57,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 10266 transitions. [2023-11-30 04:08:57,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:08:57,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 69 states and 10266 transitions. [2023-11-30 04:08:57,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 70 states, 69 states have (on average 148.7826086956522) internal successors, (10266), 69 states have internal predecessors, (10266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:08:57,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 70 states, 70 states have (on average 294.0) internal successors, (20580), 70 states have internal predecessors, (20580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:08:57,708 INFO L81 ComplementDD]: Finished complementDD. Result has 70 states, 70 states have (on average 294.0) internal successors, (20580), 70 states have internal predecessors, (20580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:08:57,709 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 310 predicate places. [2023-11-30 04:08:57,709 INFO L500 AbstractCegarLoop]: Abstraction has has 584 places, 2063 transitions, 88961 flow [2023-11-30 04:08:57,711 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 142.1764705882353) internal successors, (14502), 102 states have internal predecessors, (14502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:08:57,711 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:08:57,711 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:08:57,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-30 04:08:57,916 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:08:57,916 INFO L425 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:08:57,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:08:57,917 INFO L85 PathProgramCache]: Analyzing trace with hash -713886796, now seen corresponding path program 1 times [2023-11-30 04:08:57,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:08:57,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577140101] [2023-11-30 04:08:57,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:08:57,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:08:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:08:58,043 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2023-11-30 04:08:58,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:08:58,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577140101] [2023-11-30 04:08:58,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577140101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:08:58,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:08:58,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:08:58,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266945078] [2023-11-30 04:08:58,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:08:58,044 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:08:58,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:08:58,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:08:58,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:08:58,045 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 294 [2023-11-30 04:08:58,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 2063 transitions, 88961 flow. Second operand has 3 states, 3 states have (on average 273.6666666666667) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:08:58,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:08:58,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 294 [2023-11-30 04:08:58,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:09:02,871 INFO L124 PetriNetUnfolderBase]: 2540/9326 cut-off events. [2023-11-30 04:09:02,871 INFO L125 PetriNetUnfolderBase]: For 677592/680025 co-relation queries the response was YES. [2023-11-30 04:09:02,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116464 conditions, 9326 events. 2540/9326 cut-off events. For 677592/680025 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 84798 event pairs, 399 based on Foata normal form. 1109/10133 useless extension candidates. Maximal degree in co-relation 93445. Up to 4925 conditions per place. [2023-11-30 04:09:02,960 INFO L140 encePairwiseOnDemand]: 290/294 looper letters, 321 selfloop transitions, 22 changer transitions 42/1520 dead transitions. [2023-11-30 04:09:02,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 1520 transitions, 61578 flow [2023-11-30 04:09:02,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:09:02,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:09:02,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2023-11-30 04:09:02,961 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9387755102040817 [2023-11-30 04:09:02,961 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 828 transitions. [2023-11-30 04:09:02,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 828 transitions. [2023-11-30 04:09:02,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:09:02,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 828 transitions. [2023-11-30 04:09:02,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:09:02,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:09:02,963 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:09:02,964 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 312 predicate places. [2023-11-30 04:09:02,964 INFO L500 AbstractCegarLoop]: Abstraction has has 586 places, 1520 transitions, 61578 flow [2023-11-30 04:09:02,964 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.6666666666667) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:09:02,964 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:09:02,964 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:09:02,965 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-30 04:09:02,965 INFO L425 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:09:02,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:09:02,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1227267264, now seen corresponding path program 1 times [2023-11-30 04:09:02,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:09:02,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334400301] [2023-11-30 04:09:02,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:09:02,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:09:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:09:03,460 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:09:03,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:09:03,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334400301] [2023-11-30 04:09:03,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334400301] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 04:09:03,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233338860] [2023-11-30 04:09:03,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:09:03,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:09:03,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:09:03,464 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 04:09:03,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-30 04:09:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:09:03,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-30 04:09:03,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 04:09:04,497 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:09:04,497 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 04:09:05,702 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:09:05,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233338860] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 04:09:05,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 04:09:05,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-11-30 04:09:05,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250218169] [2023-11-30 04:09:05,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 04:09:05,703 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-30 04:09:05,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:09:05,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-30 04:09:05,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-11-30 04:09:05,707 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 294 [2023-11-30 04:09:05,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 1520 transitions, 61578 flow. Second operand has 18 states, 18 states have (on average 270.5) internal successors, (4869), 18 states have internal predecessors, (4869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:09:05,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:09:05,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 294 [2023-11-30 04:09:05,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:09:15,673 INFO L124 PetriNetUnfolderBase]: 5129/18036 cut-off events. [2023-11-30 04:09:15,673 INFO L125 PetriNetUnfolderBase]: For 1057328/1059031 co-relation queries the response was YES. [2023-11-30 04:09:15,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234880 conditions, 18036 events. 5129/18036 cut-off events. For 1057328/1059031 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 161820 event pairs, 324 based on Foata normal form. 0/17641 useless extension candidates. Maximal degree in co-relation 211689. Up to 10230 conditions per place. [2023-11-30 04:09:15,875 INFO L140 encePairwiseOnDemand]: 288/294 looper letters, 874 selfloop transitions, 21 changer transitions 37/2025 dead transitions. [2023-11-30 04:09:15,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 2025 transitions, 90699 flow [2023-11-30 04:09:15,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-30 04:09:15,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-30 04:09:15,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 5701 transitions. [2023-11-30 04:09:15,879 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9233884029802397 [2023-11-30 04:09:15,879 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 5701 transitions. [2023-11-30 04:09:15,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 5701 transitions. [2023-11-30 04:09:15,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:09:15,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 5701 transitions. [2023-11-30 04:09:15,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 271.4761904761905) internal successors, (5701), 21 states have internal predecessors, (5701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:09:15,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 294.0) internal successors, (6468), 22 states have internal predecessors, (6468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:09:15,889 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 294.0) internal successors, (6468), 22 states have internal predecessors, (6468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:09:15,890 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 332 predicate places. [2023-11-30 04:09:15,890 INFO L500 AbstractCegarLoop]: Abstraction has has 606 places, 2025 transitions, 90699 flow [2023-11-30 04:09:15,890 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 270.5) internal successors, (4869), 18 states have internal predecessors, (4869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:09:15,891 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:09:15,891 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:09:15,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-30 04:09:16,096 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:09:16,096 INFO L425 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:09:16,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:09:16,097 INFO L85 PathProgramCache]: Analyzing trace with hash -517469301, now seen corresponding path program 3 times [2023-11-30 04:09:16,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:09:16,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617795769] [2023-11-30 04:09:16,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:09:16,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:09:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:09:26,382 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:09:26,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:09:26,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617795769] [2023-11-30 04:09:26,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617795769] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 04:09:26,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047563818] [2023-11-30 04:09:26,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-30 04:09:26,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:09:26,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:09:26,383 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 04:09:26,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-30 04:09:26,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-30 04:09:26,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 04:09:26,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-30 04:09:26,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 04:09:29,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 04:09:29,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 04:09:29,704 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-30 04:09:29,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-30 04:09:36,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-30 04:09:37,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-30 04:09:39,481 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-11-30 04:09:39,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 30 [2023-11-30 04:09:39,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-30 04:09:42,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-11-30 04:09:43,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-30 04:09:45,498 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-11-30 04:09:45,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 40 [2023-11-30 04:09:46,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 22 [2023-11-30 04:09:48,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 24 [2023-11-30 04:09:49,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2023-11-30 04:09:52,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 04:09:52,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2023-11-30 04:09:52,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2023-11-30 04:09:53,230 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 74 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:09:53,230 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 04:09:54,101 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_993 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_993) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0) 4) 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (forall ((v_ArrVal_993 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_993) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))))) is different from false [2023-11-30 04:09:54,952 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_993 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_993) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_993 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_993) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2023-11-30 04:09:55,158 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_993 (Array Int Int)) (v_ArrVal_992 (Array Int Int))) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_992) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_993) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_993 (Array Int Int)) (v_ArrVal_992 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_992) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_993) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))))) is different from false [2023-11-30 04:09:55,340 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_993 (Array Int Int)) (v_ArrVal_992 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_992) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_993) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_993 (Array Int Int)) (v_ArrVal_992 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_992) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_993) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-11-30 04:09:55,372 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_993 (Array Int Int)) (v_ArrVal_992 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_992) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_993) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_993 (Array Int Int)) (v_ArrVal_992 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_992) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_993) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-11-30 04:09:55,403 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_993 (Array Int Int)) (v_ArrVal_992 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_992) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_993) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_993 (Array Int Int)) (v_ArrVal_992 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_992) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_993) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-11-30 04:10:19,259 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select |c_#length| |c_~#queue~0.base|)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse18 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse19 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse18 .cse19 (+ (select .cse18 .cse19) 1)))))) (and (forall ((v_ArrVal_983 Int) (v_ArrVal_982 (Array Int Int))) (let ((.cse8 (let ((.cse10 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_982) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_983)))) (let ((.cse9 (select .cse8 .cse5))) (or (forall ((v_ArrVal_987 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse6 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse8 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse1 (* (select .cse6 .cse5) 4))) (let ((.cse7 (+ .cse1 |c_~#queue~0.offset|))) (or (< .cse0 (+ .cse1 |c_~#queue~0.offset| 4)) (forall ((v_subst_3 Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (v_ArrVal_992 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse6 .cse7 v_ArrVal_988))) (store (store .cse3 .cse4 (+ v_subst_3 1)) .cse5 (+ (select .cse3 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_992) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_993) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (< .cse7 0)))))) (= .cse9 800))))) (forall ((v_ArrVal_983 Int) (v_ArrVal_982 (Array Int Int))) (let ((.cse16 (let ((.cse17 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_982) |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_983)))) (let ((.cse11 (select .cse16 .cse5))) (or (= .cse11 800) (forall ((v_ArrVal_987 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse14 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse16 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|))) (let ((.cse12 (* (select .cse14 .cse5) 4))) (let ((.cse15 (+ .cse12 |c_~#queue~0.offset|))) (or (< .cse0 (+ .cse12 |c_~#queue~0.offset| 4)) (forall ((v_subst_4 Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (v_ArrVal_992 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse2 |c_~#queue~0.base| (let ((.cse13 (store .cse14 .cse15 v_ArrVal_988))) (store (store .cse13 .cse4 (+ v_subst_4 1)) .cse5 (+ (select .cse13 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_992) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_993) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) .cse0)) (< .cse15 0)))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800)) is different from false [2023-11-30 04:10:19,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:10:19,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2250 treesize of output 1068 [2023-11-30 04:10:19,495 INFO L349 Elim1Store]: treesize reduction 125, result has 53.0 percent of original size [2023-11-30 04:10:19,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1384 treesize of output 1348 [2023-11-30 04:10:19,513 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-30 04:10:19,571 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-30 04:10:19,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 498 treesize of output 490 [2023-11-30 04:10:19,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 490 treesize of output 486 [2023-11-30 04:10:19,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 486 treesize of output 478 [2023-11-30 04:10:19,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 488 treesize of output 476 [2023-11-30 04:10:19,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:10:19,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 857 treesize of output 829 [2023-11-30 04:10:19,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 488 treesize of output 476 [2023-11-30 04:10:19,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 471 treesize of output 463 [2023-11-30 04:10:19,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 463 treesize of output 459 [2023-11-30 04:10:19,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 459 treesize of output 451 [2023-11-30 04:10:19,950 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-30 04:10:20,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-30 04:10:20,561 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:10:20,567 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 869 [2023-11-30 04:10:25,635 INFO L349 Elim1Store]: treesize reduction 10, result has 98.1 percent of original size [2023-11-30 04:10:25,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 47602 treesize of output 37363 [2023-11-30 04:10:29,914 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-30 04:10:29,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 378 treesize of output 370 [2023-11-30 04:10:29,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 370 treesize of output 362 [2023-11-30 04:10:29,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 372 treesize of output 360 [2023-11-30 04:10:30,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 355 treesize of output 351 [2023-11-30 04:10:30,058 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-30 04:10:30,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 445 treesize of output 1 [2023-11-30 04:10:30,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:10:30,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 399 treesize of output 397 [2023-11-30 04:10:30,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 302 [2023-11-30 04:10:30,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 302 treesize of output 298 [2023-11-30 04:10:30,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 298 treesize of output 290 [2023-11-30 04:10:30,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 300 treesize of output 288 [2023-11-30 04:10:30,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 279 [2023-11-30 04:10:30,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 279 treesize of output 271 [2023-11-30 04:10:30,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 271 treesize of output 263 [2023-11-30 04:10:30,342 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-30 04:10:30,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 261 [2023-11-30 04:10:30,568 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:10:30,568 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2023-11-30 04:10:30,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-30 04:10:30,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:10:30,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2023-11-30 04:10:30,672 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-30 04:10:30,712 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-30 04:10:30,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 280 treesize of output 272 [2023-11-30 04:10:30,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 272 treesize of output 268 [2023-11-30 04:10:30,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 268 treesize of output 260 [2023-11-30 04:10:30,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 258 [2023-11-30 04:10:30,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 249 [2023-11-30 04:10:30,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 245 [2023-11-30 04:10:30,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 238 [2023-11-30 04:10:30,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 233 treesize of output 225 [2023-11-30 04:10:30,859 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-30 04:10:30,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:10:30,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 40 [2023-11-30 04:10:31,276 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:10:31,277 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2023-11-30 04:10:31,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-30 04:10:31,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:10:31,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 100 [2023-11-30 04:10:31,468 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-30 04:10:31,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 346 treesize of output 338 [2023-11-30 04:10:31,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 338 treesize of output 330 [2023-11-30 04:10:31,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 340 treesize of output 328 [2023-11-30 04:10:31,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 323 treesize of output 319 [2023-11-30 04:10:31,644 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-30 04:10:31,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 464 treesize of output 1 [2023-11-30 04:10:31,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 280 treesize of output 272 [2023-11-30 04:10:31,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 272 treesize of output 264 [2023-11-30 04:10:31,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 274 treesize of output 262 [2023-11-30 04:10:31,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 253 [2023-11-30 04:10:31,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 249 [2023-11-30 04:10:31,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 245 [2023-11-30 04:10:31,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 238 [2023-11-30 04:10:31,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 233 treesize of output 225 [2023-11-30 04:10:31,801 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-30 04:10:31,818 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-30 04:10:31,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 340 treesize of output 332 [2023-11-30 04:10:31,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 332 treesize of output 324 [2023-11-30 04:10:31,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 322 [2023-11-30 04:10:31,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 317 treesize of output 313 [2023-11-30 04:10:31,965 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-30 04:10:31,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 404 treesize of output 1 [2023-11-30 04:10:45,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 229 [2023-11-30 04:10:47,845 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 13 times theorem prover too weak. 0 trivial. 59 not checked. [2023-11-30 04:10:47,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047563818] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 04:10:47,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 04:10:47,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 41, 41] total 118 [2023-11-30 04:10:47,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045835319] [2023-11-30 04:10:47,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 04:10:47,847 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 119 states [2023-11-30 04:10:47,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:10:47,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2023-11-30 04:10:47,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=970, Invalid=11299, Unknown=191, NotChecked=1582, Total=14042 [2023-11-30 04:10:47,858 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 294 [2023-11-30 04:10:47,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 2025 transitions, 90699 flow. Second operand has 119 states, 119 states have (on average 141.45378151260505) internal successors, (16833), 119 states have internal predecessors, (16833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:10:47,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:10:47,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 294 [2023-11-30 04:10:47,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:12:25,693 INFO L124 PetriNetUnfolderBase]: 2163/7856 cut-off events. [2023-11-30 04:12:25,693 INFO L125 PetriNetUnfolderBase]: For 491913/493350 co-relation queries the response was YES. [2023-11-30 04:12:25,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106112 conditions, 7856 events. 2163/7856 cut-off events. For 491913/493350 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 55419 event pairs, 227 based on Foata normal form. 68/7752 useless extension candidates. Maximal degree in co-relation 89460. Up to 4180 conditions per place. [2023-11-30 04:12:25,770 INFO L140 encePairwiseOnDemand]: 255/294 looper letters, 1003 selfloop transitions, 240 changer transitions 28/1418 dead transitions. [2023-11-30 04:12:25,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 669 places, 1418 transitions, 60158 flow [2023-11-30 04:12:25,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-11-30 04:12:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2023-11-30 04:12:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 9918 transitions. [2023-11-30 04:12:25,775 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.4960984393757503 [2023-11-30 04:12:25,775 INFO L72 ComplementDD]: Start complementDD. Operand 68 states and 9918 transitions. [2023-11-30 04:12:25,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 9918 transitions. [2023-11-30 04:12:25,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:12:25,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 68 states and 9918 transitions. [2023-11-30 04:12:25,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 69 states, 68 states have (on average 145.85294117647058) internal successors, (9918), 68 states have internal predecessors, (9918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:12:25,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 69 states, 69 states have (on average 294.0) internal successors, (20286), 69 states have internal predecessors, (20286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:12:25,795 INFO L81 ComplementDD]: Finished complementDD. Result has 69 states, 69 states have (on average 294.0) internal successors, (20286), 69 states have internal predecessors, (20286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:12:25,796 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 395 predicate places. [2023-11-30 04:12:25,796 INFO L500 AbstractCegarLoop]: Abstraction has has 669 places, 1418 transitions, 60158 flow [2023-11-30 04:12:25,798 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 119 states, 119 states have (on average 141.45378151260505) internal successors, (16833), 119 states have internal predecessors, (16833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:12:25,798 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:12:25,799 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:12:25,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-30 04:12:26,005 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-30 04:12:26,006 INFO L425 AbstractCegarLoop]: === Iteration 29 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:12:26,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:12:26,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1292500518, now seen corresponding path program 1 times [2023-11-30 04:12:26,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:12:26,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865132622] [2023-11-30 04:12:26,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:12:26,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:12:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:12:27,778 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:12:27,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:12:27,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865132622] [2023-11-30 04:12:27,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865132622] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 04:12:27,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382059835] [2023-11-30 04:12:27,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:12:27,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:12:27,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:12:27,779 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 04:12:27,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-30 04:12:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:12:27,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-30 04:12:27,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 04:12:28,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 04:12:28,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 04:12:28,553 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-30 04:12:28,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-30 04:12:28,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 04:12:28,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 04:12:35,199 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:12:35,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 04:12:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:12:40,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382059835] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 04:12:40,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 04:12:40,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 34 [2023-11-30 04:12:40,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266053455] [2023-11-30 04:12:40,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 04:12:40,325 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-30 04:12:40,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:12:40,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-30 04:12:40,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1046, Unknown=0, NotChecked=0, Total=1190 [2023-11-30 04:12:40,328 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 294 [2023-11-30 04:12:40,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 669 places, 1418 transitions, 60158 flow. Second operand has 35 states, 35 states have (on average 173.42857142857142) internal successors, (6070), 35 states have internal predecessors, (6070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:12:40,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:12:40,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 294 [2023-11-30 04:12:40,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:12:56,130 INFO L124 PetriNetUnfolderBase]: 2390/8715 cut-off events. [2023-11-30 04:12:56,130 INFO L125 PetriNetUnfolderBase]: For 597383/598395 co-relation queries the response was YES. [2023-11-30 04:12:56,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121669 conditions, 8715 events. 2390/8715 cut-off events. For 597383/598395 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 65175 event pairs, 170 based on Foata normal form. 66/8615 useless extension candidates. Maximal degree in co-relation 104489. Up to 4656 conditions per place. [2023-11-30 04:12:56,242 INFO L140 encePairwiseOnDemand]: 285/294 looper letters, 1358 selfloop transitions, 28 changer transitions 25/1734 dead transitions. [2023-11-30 04:12:56,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 692 places, 1734 transitions, 78733 flow [2023-11-30 04:12:56,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-30 04:12:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-11-30 04:12:56,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4253 transitions. [2023-11-30 04:12:56,245 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6027494331065759 [2023-11-30 04:12:56,245 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4253 transitions. [2023-11-30 04:12:56,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4253 transitions. [2023-11-30 04:12:56,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:12:56,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4253 transitions. [2023-11-30 04:12:56,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 177.20833333333334) internal successors, (4253), 24 states have internal predecessors, (4253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:12:56,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 294.0) internal successors, (7350), 25 states have internal predecessors, (7350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:12:56,252 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 294.0) internal successors, (7350), 25 states have internal predecessors, (7350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:12:56,254 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 418 predicate places. [2023-11-30 04:12:56,255 INFO L500 AbstractCegarLoop]: Abstraction has has 692 places, 1734 transitions, 78733 flow [2023-11-30 04:12:56,257 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 173.42857142857142) internal successors, (6070), 35 states have internal predecessors, (6070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:12:56,257 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:12:56,257 INFO L232 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:12:56,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-30 04:12:56,462 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-30 04:12:56,463 INFO L425 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:12:56,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:12:56,463 INFO L85 PathProgramCache]: Analyzing trace with hash -794812741, now seen corresponding path program 2 times [2023-11-30 04:12:56,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:12:56,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284153878] [2023-11-30 04:12:56,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:12:56,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:12:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:12:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 0 proven. 727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:12:57,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:12:57,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284153878] [2023-11-30 04:12:57,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284153878] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 04:12:57,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430294363] [2023-11-30 04:12:57,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 04:12:57,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:12:57,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:12:57,492 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 04:12:57,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-30 04:12:57,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-30 04:12:57,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 04:12:57,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-30 04:12:57,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 04:13:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2023-11-30 04:13:06,246 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 04:13:06,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430294363] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:13:06,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 04:13:06,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 23 [2023-11-30 04:13:06,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179796482] [2023-11-30 04:13:06,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:13:06,247 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-30 04:13:06,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:13:06,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-30 04:13:06,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2023-11-30 04:13:06,249 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 294 [2023-11-30 04:13:06,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 692 places, 1734 transitions, 78733 flow. Second operand has 8 states, 8 states have (on average 197.125) internal successors, (1577), 8 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:13:06,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:13:06,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 294 [2023-11-30 04:13:06,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:13:12,929 INFO L124 PetriNetUnfolderBase]: 2420/8625 cut-off events. [2023-11-30 04:13:12,929 INFO L125 PetriNetUnfolderBase]: For 658342/660008 co-relation queries the response was YES. [2023-11-30 04:13:12,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125668 conditions, 8625 events. 2420/8625 cut-off events. For 658342/660008 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 63980 event pairs, 154 based on Foata normal form. 50/8505 useless extension candidates. Maximal degree in co-relation 107764. Up to 4640 conditions per place. [2023-11-30 04:13:13,030 INFO L140 encePairwiseOnDemand]: 282/294 looper letters, 1367 selfloop transitions, 15 changer transitions 27/1758 dead transitions. [2023-11-30 04:13:13,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 699 places, 1758 transitions, 83097 flow [2023-11-30 04:13:13,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-30 04:13:13,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-30 04:13:13,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1998 transitions. [2023-11-30 04:13:13,031 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6795918367346939 [2023-11-30 04:13:13,031 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1998 transitions. [2023-11-30 04:13:13,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1998 transitions. [2023-11-30 04:13:13,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:13:13,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1998 transitions. [2023-11-30 04:13:13,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 199.8) internal successors, (1998), 10 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:13:13,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 294.0) internal successors, (3234), 11 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:13:13,034 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 294.0) internal successors, (3234), 11 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:13:13,035 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 425 predicate places. [2023-11-30 04:13:13,035 INFO L500 AbstractCegarLoop]: Abstraction has has 699 places, 1758 transitions, 83097 flow [2023-11-30 04:13:13,035 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 197.125) internal successors, (1577), 8 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:13:13,035 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:13:13,035 INFO L232 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:13:13,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-30 04:13:13,240 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:13:13,240 INFO L425 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:13:13,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:13:13,241 INFO L85 PathProgramCache]: Analyzing trace with hash -794812742, now seen corresponding path program 1 times [2023-11-30 04:13:13,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:13:13,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762332469] [2023-11-30 04:13:13,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:13:13,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:13:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:13:13,693 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2023-11-30 04:13:13,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:13:13,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762332469] [2023-11-30 04:13:13,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762332469] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:13:13,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:13:13,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-30 04:13:13,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623715276] [2023-11-30 04:13:13,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:13:13,694 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-30 04:13:13,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:13:13,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-30 04:13:13,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-30 04:13:13,695 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 294 [2023-11-30 04:13:13,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 699 places, 1758 transitions, 83097 flow. Second operand has 8 states, 8 states have (on average 194.25) internal successors, (1554), 8 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:13:13,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:13:13,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 294 [2023-11-30 04:13:13,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:13:20,301 INFO L124 PetriNetUnfolderBase]: 2386/8589 cut-off events. [2023-11-30 04:13:20,301 INFO L125 PetriNetUnfolderBase]: For 707540/708690 co-relation queries the response was YES. [2023-11-30 04:13:20,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127562 conditions, 8589 events. 2386/8589 cut-off events. For 707540/708690 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 63668 event pairs, 128 based on Foata normal form. 50/8475 useless extension candidates. Maximal degree in co-relation 110231. Up to 4556 conditions per place. [2023-11-30 04:13:20,401 INFO L140 encePairwiseOnDemand]: 283/294 looper letters, 1353 selfloop transitions, 14 changer transitions 25/1746 dead transitions. [2023-11-30 04:13:20,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 705 places, 1746 transitions, 85351 flow [2023-11-30 04:13:20,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 04:13:20,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 04:13:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1776 transitions. [2023-11-30 04:13:20,403 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.671201814058957 [2023-11-30 04:13:20,403 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1776 transitions. [2023-11-30 04:13:20,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1776 transitions. [2023-11-30 04:13:20,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:13:20,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1776 transitions. [2023-11-30 04:13:20,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 197.33333333333334) internal successors, (1776), 9 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:13:20,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 294.0) internal successors, (2940), 10 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:13:20,406 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 294.0) internal successors, (2940), 10 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:13:20,407 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 431 predicate places. [2023-11-30 04:13:20,407 INFO L500 AbstractCegarLoop]: Abstraction has has 705 places, 1746 transitions, 85351 flow [2023-11-30 04:13:20,407 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 194.25) internal successors, (1554), 8 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:13:20,407 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:13:20,407 INFO L232 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:13:20,408 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-30 04:13:20,408 INFO L425 AbstractCegarLoop]: === Iteration 32 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:13:20,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:13:20,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1225900775, now seen corresponding path program 2 times [2023-11-30 04:13:20,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:13:20,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880599982] [2023-11-30 04:13:20,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:13:20,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:13:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:13:31,452 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 520 proven. 296 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2023-11-30 04:13:31,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:13:31,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880599982] [2023-11-30 04:13:31,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880599982] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 04:13:31,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011145249] [2023-11-30 04:13:31,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 04:13:31,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:13:31,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:13:31,453 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 04:13:31,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-30 04:13:31,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 04:13:31,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 04:13:31,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-30 04:13:31,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 04:13:32,506 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-30 04:13:32,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-30 04:13:32,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 04:13:32,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 04:13:32,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-30 04:13:46,767 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 945 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:13:46,767 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 04:13:46,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011145249] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:13:46,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 04:13:46,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [42] total 61 [2023-11-30 04:13:46,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785112612] [2023-11-30 04:13:46,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:13:46,768 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-30 04:13:46,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:13:46,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-30 04:13:46,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=3308, Unknown=0, NotChecked=0, Total=3660 [2023-11-30 04:13:46,771 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 294 [2023-11-30 04:13:46,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 705 places, 1746 transitions, 85351 flow. Second operand has 21 states, 21 states have (on average 176.33333333333334) internal successors, (3703), 21 states have internal predecessors, (3703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:13:46,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:13:46,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 294 [2023-11-30 04:13:46,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:14:01,405 INFO L124 PetriNetUnfolderBase]: 2399/8651 cut-off events. [2023-11-30 04:14:01,406 INFO L125 PetriNetUnfolderBase]: For 755105/756183 co-relation queries the response was YES. [2023-11-30 04:14:01,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131898 conditions, 8651 events. 2399/8651 cut-off events. For 755105/756183 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 64438 event pairs, 115 based on Foata normal form. 32/8522 useless extension candidates. Maximal degree in co-relation 113965. Up to 4538 conditions per place. [2023-11-30 04:14:01,493 INFO L140 encePairwiseOnDemand]: 286/294 looper letters, 1430 selfloop transitions, 27 changer transitions 30/1807 dead transitions. [2023-11-30 04:14:01,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 1807 transitions, 91813 flow [2023-11-30 04:14:01,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-30 04:14:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-11-30 04:14:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 5022 transitions. [2023-11-30 04:14:01,496 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6100583090379009 [2023-11-30 04:14:01,496 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 5022 transitions. [2023-11-30 04:14:01,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 5022 transitions. [2023-11-30 04:14:01,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:14:01,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 5022 transitions. [2023-11-30 04:14:01,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 179.35714285714286) internal successors, (5022), 28 states have internal predecessors, (5022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:14:01,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 294.0) internal successors, (8526), 29 states have internal predecessors, (8526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:14:01,504 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 294.0) internal successors, (8526), 29 states have internal predecessors, (8526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:14:01,505 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 457 predicate places. [2023-11-30 04:14:01,505 INFO L500 AbstractCegarLoop]: Abstraction has has 731 places, 1807 transitions, 91813 flow [2023-11-30 04:14:01,505 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 176.33333333333334) internal successors, (3703), 21 states have internal predecessors, (3703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:14:01,505 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:14:01,506 INFO L232 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:14:01,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-30 04:14:01,707 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-11-30 04:14:01,707 INFO L425 AbstractCegarLoop]: === Iteration 33 === Targeting t2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:14:01,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:14:01,707 INFO L85 PathProgramCache]: Analyzing trace with hash -255700654, now seen corresponding path program 1 times [2023-11-30 04:14:01,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:14:01,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037267795] [2023-11-30 04:14:01,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:14:01,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:14:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:14:02,736 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 0 proven. 727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:14:02,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:14:02,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037267795] [2023-11-30 04:14:02,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037267795] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 04:14:02,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194377102] [2023-11-30 04:14:02,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:14:02,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:14:02,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:14:02,741 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 04:14:02,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-30 04:14:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:14:02,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 1008 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-30 04:14:03,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 04:14:05,016 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 0 proven. 727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:14:05,016 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 04:14:08,341 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 0 proven. 727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:14:08,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194377102] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 04:14:08,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 04:14:08,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2023-11-30 04:14:08,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408137329] [2023-11-30 04:14:08,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 04:14:08,343 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-30 04:14:08,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:14:08,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-30 04:14:08,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2023-11-30 04:14:08,348 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 294 [2023-11-30 04:14:08,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 731 places, 1807 transitions, 91813 flow. Second operand has 34 states, 34 states have (on average 270.5) internal successors, (9197), 34 states have internal predecessors, (9197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:14:08,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:14:08,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 294 [2023-11-30 04:14:08,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:14:26,306 INFO L124 PetriNetUnfolderBase]: 5362/18530 cut-off events. [2023-11-30 04:14:26,307 INFO L125 PetriNetUnfolderBase]: For 1691190/1692546 co-relation queries the response was YES. [2023-11-30 04:14:26,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293891 conditions, 18530 events. 5362/18530 cut-off events. For 1691190/1692546 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 141760 event pairs, 128 based on Foata normal form. 2/18326 useless extension candidates. Maximal degree in co-relation 275779. Up to 10493 conditions per place. [2023-11-30 04:14:26,508 INFO L140 encePairwiseOnDemand]: 288/294 looper letters, 1009 selfloop transitions, 45 changer transitions 31/2363 dead transitions. [2023-11-30 04:14:26,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 775 places, 2363 transitions, 130468 flow [2023-11-30 04:14:26,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-30 04:14:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-11-30 04:14:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 12197 transitions. [2023-11-30 04:14:26,514 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9219198790627362 [2023-11-30 04:14:26,514 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 12197 transitions. [2023-11-30 04:14:26,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 12197 transitions. [2023-11-30 04:14:26,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:14:26,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 12197 transitions. [2023-11-30 04:14:26,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 271.0444444444444) internal successors, (12197), 45 states have internal predecessors, (12197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:14:26,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 294.0) internal successors, (13524), 46 states have internal predecessors, (13524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:14:26,537 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 294.0) internal successors, (13524), 46 states have internal predecessors, (13524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:14:26,537 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 501 predicate places. [2023-11-30 04:14:26,537 INFO L500 AbstractCegarLoop]: Abstraction has has 775 places, 2363 transitions, 130468 flow [2023-11-30 04:14:26,538 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 270.5) internal successors, (9197), 34 states have internal predecessors, (9197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:14:26,538 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:14:26,539 INFO L232 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 12, 12, 12, 12, 12, 12, 12, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:14:26,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-30 04:14:26,746 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-11-30 04:14:26,747 INFO L425 AbstractCegarLoop]: === Iteration 34 === Targeting t2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:14:26,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:14:26,747 INFO L85 PathProgramCache]: Analyzing trace with hash -757902664, now seen corresponding path program 2 times [2023-11-30 04:14:26,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:14:26,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732562313] [2023-11-30 04:14:26,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:14:26,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:14:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:14:30,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3567 backedges. 0 proven. 3567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:14:30,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:14:30,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732562313] [2023-11-30 04:14:30,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732562313] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 04:14:30,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33860573] [2023-11-30 04:14:30,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 04:14:30,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:14:30,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:14:30,310 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 04:14:30,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-30 04:14:30,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-30 04:14:30,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 04:14:30,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-30 04:14:30,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2023-11-30 04:14:30,827 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 100 remaining) [2023-11-30 04:14:30,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-30 04:14:30,865 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-30 04:14:30,865 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-30 04:14:31,027 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-11-30 04:14:31,028 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. [2023-11-30 04:14:31,030 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 100 remaining) [2023-11-30 04:14:31,030 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 100 remaining) [2023-11-30 04:14:31,030 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 100 remaining) [2023-11-30 04:14:31,030 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 100 remaining) [2023-11-30 04:14:31,030 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 100 remaining) [2023-11-30 04:14:31,030 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 100 remaining) [2023-11-30 04:14:31,031 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 100 remaining) [2023-11-30 04:14:31,031 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 100 remaining) [2023-11-30 04:14:31,031 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 100 remaining) [2023-11-30 04:14:31,031 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 100 remaining) [2023-11-30 04:14:31,031 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 100 remaining) [2023-11-30 04:14:31,031 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 100 remaining) [2023-11-30 04:14:31,031 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 100 remaining) [2023-11-30 04:14:31,031 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 100 remaining) [2023-11-30 04:14:31,032 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 100 remaining) [2023-11-30 04:14:31,032 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 100 remaining) [2023-11-30 04:14:31,032 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 100 remaining) [2023-11-30 04:14:31,032 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 100 remaining) [2023-11-30 04:14:31,032 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (80 of 100 remaining) [2023-11-30 04:14:31,032 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (79 of 100 remaining) [2023-11-30 04:14:31,032 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 100 remaining) [2023-11-30 04:14:31,032 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 100 remaining) [2023-11-30 04:14:31,032 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 100 remaining) [2023-11-30 04:14:31,033 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 100 remaining) [2023-11-30 04:14:31,033 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 100 remaining) [2023-11-30 04:14:31,033 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 100 remaining) [2023-11-30 04:14:31,033 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 100 remaining) [2023-11-30 04:14:31,033 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 100 remaining) [2023-11-30 04:14:31,033 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 100 remaining) [2023-11-30 04:14:31,033 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 100 remaining) [2023-11-30 04:14:31,033 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 100 remaining) [2023-11-30 04:14:31,033 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 100 remaining) [2023-11-30 04:14:31,034 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 100 remaining) [2023-11-30 04:14:31,034 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 100 remaining) [2023-11-30 04:14:31,034 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 100 remaining) [2023-11-30 04:14:31,034 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 100 remaining) [2023-11-30 04:14:31,034 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 100 remaining) [2023-11-30 04:14:31,034 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 100 remaining) [2023-11-30 04:14:31,034 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 100 remaining) [2023-11-30 04:14:31,034 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 100 remaining) [2023-11-30 04:14:31,034 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 100 remaining) [2023-11-30 04:14:31,034 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 100 remaining) [2023-11-30 04:14:31,035 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 100 remaining) [2023-11-30 04:14:31,035 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 100 remaining) [2023-11-30 04:14:31,035 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 100 remaining) [2023-11-30 04:14:31,035 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 100 remaining) [2023-11-30 04:14:31,035 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 100 remaining) [2023-11-30 04:14:31,035 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 100 remaining) [2023-11-30 04:14:31,035 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 100 remaining) [2023-11-30 04:14:31,035 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 100 remaining) [2023-11-30 04:14:31,035 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 100 remaining) [2023-11-30 04:14:31,036 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 100 remaining) [2023-11-30 04:14:31,036 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 100 remaining) [2023-11-30 04:14:31,036 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 100 remaining) [2023-11-30 04:14:31,036 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 100 remaining) [2023-11-30 04:14:31,036 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 100 remaining) [2023-11-30 04:14:31,036 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 100 remaining) [2023-11-30 04:14:31,036 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 100 remaining) [2023-11-30 04:14:31,036 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 100 remaining) [2023-11-30 04:14:31,036 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 100 remaining) [2023-11-30 04:14:31,036 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 100 remaining) [2023-11-30 04:14:31,037 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 100 remaining) [2023-11-30 04:14:31,037 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 100 remaining) [2023-11-30 04:14:31,037 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 100 remaining) [2023-11-30 04:14:31,037 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 100 remaining) [2023-11-30 04:14:31,037 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 100 remaining) [2023-11-30 04:14:31,037 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 100 remaining) [2023-11-30 04:14:31,037 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 100 remaining) [2023-11-30 04:14:31,037 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 100 remaining) [2023-11-30 04:14:31,037 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 100 remaining) [2023-11-30 04:14:31,038 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 100 remaining) [2023-11-30 04:14:31,038 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 100 remaining) [2023-11-30 04:14:31,038 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 100 remaining) [2023-11-30 04:14:31,038 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 100 remaining) [2023-11-30 04:14:31,038 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 100 remaining) [2023-11-30 04:14:31,038 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 100 remaining) [2023-11-30 04:14:31,038 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 100 remaining) [2023-11-30 04:14:31,038 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 100 remaining) [2023-11-30 04:14:31,038 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 100 remaining) [2023-11-30 04:14:31,038 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 100 remaining) [2023-11-30 04:14:31,039 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 100 remaining) [2023-11-30 04:14:31,039 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 100 remaining) [2023-11-30 04:14:31,039 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 100 remaining) [2023-11-30 04:14:31,039 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 100 remaining) [2023-11-30 04:14:31,039 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 100 remaining) [2023-11-30 04:14:31,039 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 100 remaining) [2023-11-30 04:14:31,039 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 100 remaining) [2023-11-30 04:14:31,039 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 100 remaining) [2023-11-30 04:14:31,039 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 100 remaining) [2023-11-30 04:14:31,039 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 100 remaining) [2023-11-30 04:14:31,040 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 100 remaining) [2023-11-30 04:14:31,040 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 100 remaining) [2023-11-30 04:14:31,040 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 100 remaining) [2023-11-30 04:14:31,040 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 100 remaining) [2023-11-30 04:14:31,040 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 100 remaining) [2023-11-30 04:14:31,040 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 100 remaining) [2023-11-30 04:14:31,040 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 100 remaining) [2023-11-30 04:14:31,040 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 100 remaining) [2023-11-30 04:14:31,040 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 100 remaining) [2023-11-30 04:14:31,041 INFO L457 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:14:31,050 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:14:31,050 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:14:31,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:14:31 BasicIcfg [2023-11-30 04:14:31,054 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:14:31,054 INFO L158 Benchmark]: Toolchain (without parser) took 814242.26ms. Allocated memory was 526.4MB in the beginning and 11.7GB in the end (delta: 11.2GB). Free memory was 476.0MB in the beginning and 7.5GB in the end (delta: -7.0GB). Peak memory consumption was 4.2GB. Max. memory is 16.0GB. [2023-11-30 04:14:31,054 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 352.3MB. Free memory is still 306.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:14:31,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.01ms. Allocated memory is still 526.4MB. Free memory was 476.0MB in the beginning and 445.8MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-11-30 04:14:31,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.03ms. Allocated memory is still 526.4MB. Free memory was 445.8MB in the beginning and 493.1MB in the end (delta: -47.4MB). Peak memory consumption was 9.9MB. Max. memory is 16.0GB. [2023-11-30 04:14:31,054 INFO L158 Benchmark]: Boogie Preprocessor took 54.83ms. Allocated memory is still 526.4MB. Free memory was 493.1MB in the beginning and 491.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:14:31,055 INFO L158 Benchmark]: RCFGBuilder took 564.47ms. Allocated memory is still 526.4MB. Free memory was 491.0MB in the beginning and 459.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-11-30 04:14:31,055 INFO L158 Benchmark]: TraceAbstraction took 812960.20ms. Allocated memory was 526.4MB in the beginning and 11.7GB in the end (delta: 11.2GB). Free memory was 458.7MB in the beginning and 7.5GB in the end (delta: -7.0GB). Peak memory consumption was 4.2GB. Max. memory is 16.0GB. [2023-11-30 04:14:31,055 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.13ms. Allocated memory is still 352.3MB. Free memory is still 306.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 575.01ms. Allocated memory is still 526.4MB. Free memory was 476.0MB in the beginning and 445.8MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 83.03ms. Allocated memory is still 526.4MB. Free memory was 445.8MB in the beginning and 493.1MB in the end (delta: -47.4MB). Peak memory consumption was 9.9MB. Max. memory is 16.0GB. * Boogie Preprocessor took 54.83ms. Allocated memory is still 526.4MB. Free memory was 493.1MB in the beginning and 491.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 564.47ms. Allocated memory is still 526.4MB. Free memory was 491.0MB in the beginning and 459.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * TraceAbstraction took 812960.20ms. Allocated memory was 526.4MB in the beginning and 11.7GB in the end (delta: 11.2GB). Free memory was 458.7MB in the beginning and 7.5GB in the end (delta: -7.0GB). Peak memory consumption was 4.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was analyzing trace of length 632 with TraceHistMax 15,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 454 locations, 100 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: 812.8s, OverallIterations: 34, TraceHistogramMax: 15, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 540.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 57 mSolverCounterUnknown, 19077 SdHoareTripleChecker+Valid, 234.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19077 mSDsluCounter, 5853 SdHoareTripleChecker+Invalid, 227.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 12650 IncrementalHoareTripleChecker+Unchecked, 5211 mSDsCounter, 1364 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38562 IncrementalHoareTripleChecker+Invalid, 52633 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1364 mSolverCounterUnsat, 642 mSDtfsCounter, 38562 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4981 GetRequests, 3722 SyntacticMatches, 108 SemanticMatches, 1151 ConstructedPredicates, 28 IntricatePredicates, 0 DeprecatedPredicates, 29189 ImplicationChecksByTransitivity, 357.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130468occurred in iteration=33, InterpolantAutomatonStates: 591, 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.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 262.3s InterpolantComputationTime, 6582 NumberOfCodeBlocks, 6334 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 8091 ConstructedInterpolants, 407 QuantifiedInterpolants, 216169 SizeOfPredicates, 218 NumberOfNonLiveVariables, 6194 ConjunctsInSsa, 522 ConjunctsInUnsatCore, 54 InterpolantComputations, 24 PerfectInterpolantSequences, 3253/8069 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown