/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.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:00:47,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:00:47,640 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:47,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:00:47,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:00:47,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:00:47,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:00:47,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:00:47,672 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:00:47,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:00:47,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:00:47,673 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:00:47,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:00:47,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:00:47,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:00:47,674 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:00:47,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:00:47,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:00:47,675 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:00:47,675 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:00:47,675 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:00:47,675 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:00:47,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:00:47,676 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:00:47,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:00:47,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:00:47,677 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:00:47,677 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:00:47,677 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:00:47,677 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:00:47,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:00:47,678 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:00:47,678 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:00:47,678 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:47,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:00:47,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:00:47,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:00:47,875 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:00:47,875 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:00:47,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2023-11-30 04:00:49,009 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:00:49,248 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:00:49,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2023-11-30 04:00:49,267 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4dae58bc/2333b86a8b8541f08c934377d91c566a/FLAG3b8e530db [2023-11-30 04:00:49,281 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4dae58bc/2333b86a8b8541f08c934377d91c566a [2023-11-30 04:00:49,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:00:49,284 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:00:49,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:00:49,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:00:49,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:00:49,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:00:49" (1/1) ... [2023-11-30 04:00:49,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21ba8aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:49, skipping insertion in model container [2023-11-30 04:00:49,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:00:49" (1/1) ... [2023-11-30 04:00:49,325 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:00:49,684 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:00:49,695 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:00:49,756 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:00:49,815 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:00:49,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:49 WrapperNode [2023-11-30 04:00:49,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:00:49,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:00:49,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:00:49,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:00:49,825 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:49" (1/1) ... [2023-11-30 04:00:49,841 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:49" (1/1) ... [2023-11-30 04:00:49,870 INFO L138 Inliner]: procedures = 275, calls = 61, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 214 [2023-11-30 04:00:49,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:00:49,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:00:49,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:00:49,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:00:49,879 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:49" (1/1) ... [2023-11-30 04:00:49,879 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:49" (1/1) ... [2023-11-30 04:00:49,882 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:49" (1/1) ... [2023-11-30 04:00:49,883 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:49" (1/1) ... [2023-11-30 04:00:49,891 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:49" (1/1) ... [2023-11-30 04:00:49,895 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:49" (1/1) ... [2023-11-30 04:00:49,897 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:49" (1/1) ... [2023-11-30 04:00:49,898 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:49" (1/1) ... [2023-11-30 04:00:49,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:00:49,901 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:00:49,901 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:00:49,901 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:00:49,902 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:49" (1/1) ... [2023-11-30 04:00:49,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:00:49,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:00:49,929 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:49,967 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:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-30 04:00:49,978 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-30 04:00:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-30 04:00:49,978 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-30 04:00:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:00:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:00:49,979 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-30 04:00:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 04:00:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:00:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-30 04:00:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:00:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:00:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:00:49,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:00:49,982 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:50,191 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:00:50,193 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:00:50,515 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:00:50,537 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:00:50,537 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-30 04:00:50,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:00:50 BoogieIcfgContainer [2023-11-30 04:00:50,538 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:00:50,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:00:50,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:00:50,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:00:50,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:00:49" (1/3) ... [2023-11-30 04:00:50,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2706c70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:00:50, skipping insertion in model container [2023-11-30 04:00:50,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:00:49" (2/3) ... [2023-11-30 04:00:50,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2706c70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:00:50, skipping insertion in model container [2023-11-30 04:00:50,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:00:50" (3/3) ... [2023-11-30 04:00:50,543 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-11-30 04:00:50,559 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:00:50,560 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2023-11-30 04:00:50,560 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:00:50,630 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 04:00:50,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 294 transitions, 602 flow [2023-11-30 04:00:50,747 INFO L124 PetriNetUnfolderBase]: 15/292 cut-off events. [2023-11-30 04:00:50,747 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 04:00:50,756 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:50,757 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 294 transitions, 602 flow [2023-11-30 04:00:50,767 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 274 places, 282 transitions, 573 flow [2023-11-30 04:00:50,782 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:00:50,789 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;@108fe8c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:00:50,790 INFO L363 AbstractCegarLoop]: Starting to check reachability of 100 error locations. [2023-11-30 04:00:50,798 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:00:50,799 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2023-11-30 04:00:50,799 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:00:50,799 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:00:50,799 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:50,800 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:50,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:00:50,805 INFO L85 PathProgramCache]: Analyzing trace with hash 258200551, now seen corresponding path program 1 times [2023-11-30 04:00:50,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:00:50,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212429570] [2023-11-30 04:00:50,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:00:50,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:00:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:00:51,278 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:51,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:00:51,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212429570] [2023-11-30 04:00:51,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212429570] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:00:51,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:00:51,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 04:00:51,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131329324] [2023-11-30 04:00:51,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:00:51,295 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 04:00:51,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:00:51,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 04:00:51,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-30 04:00:51,322 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 294 [2023-11-30 04:00:51,327 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:51,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:00:51,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 294 [2023-11-30 04:00:51,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:00:52,679 INFO L124 PetriNetUnfolderBase]: 3483/9979 cut-off events. [2023-11-30 04:00:52,679 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-30 04:00:52,700 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:00:52,749 INFO L140 encePairwiseOnDemand]: 280/294 looper letters, 78 selfloop transitions, 6 changer transitions 0/263 dead transitions. [2023-11-30 04:00:52,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 263 transitions, 703 flow [2023-11-30 04:00:52,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:00:52,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:00:52,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1262 transitions. [2023-11-30 04:00:52,762 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7154195011337868 [2023-11-30 04:00:52,763 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1262 transitions. [2023-11-30 04:00:52,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1262 transitions. [2023-11-30 04:00:52,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:00:52,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1262 transitions. [2023-11-30 04:00:52,771 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:00:52,776 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:00:52,777 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:00:52,779 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, -8 predicate places. [2023-11-30 04:00:52,780 INFO L500 AbstractCegarLoop]: Abstraction has has 266 places, 263 transitions, 703 flow [2023-11-30 04:00:52,781 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:00:52,781 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:00:52,781 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:52,781 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:00:52,781 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:00:52,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:00:52,782 INFO L85 PathProgramCache]: Analyzing trace with hash 258200552, now seen corresponding path program 1 times [2023-11-30 04:00:52,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:00:52,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573532157] [2023-11-30 04:00:52,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:00:52,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:00:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:00:52,978 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:52,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:00:52,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573532157] [2023-11-30 04:00:52,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573532157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:00:52,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:00:52,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 04:00:52,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467417836] [2023-11-30 04:00:52,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:00:52,980 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 04:00:52,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:00:52,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 04:00:52,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-30 04:00:52,982 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 294 [2023-11-30 04:00:52,983 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:00:52,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:00:52,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 294 [2023-11-30 04:00:52,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:00:55,168 INFO L124 PetriNetUnfolderBase]: 9204/20715 cut-off events. [2023-11-30 04:00:55,168 INFO L125 PetriNetUnfolderBase]: For 3521/6937 co-relation queries the response was YES. [2023-11-30 04:00:55,215 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:00:55,319 INFO L140 encePairwiseOnDemand]: 285/294 looper letters, 101 selfloop transitions, 6 changer transitions 0/260 dead transitions. [2023-11-30 04:00:55,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 260 transitions, 905 flow [2023-11-30 04:00:55,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:00:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:00:55,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1124 transitions. [2023-11-30 04:00:55,322 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.63718820861678 [2023-11-30 04:00:55,322 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1124 transitions. [2023-11-30 04:00:55,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1124 transitions. [2023-11-30 04:00:55,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:00:55,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1124 transitions. [2023-11-30 04:00:55,325 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:00:55,327 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:00:55,328 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:00:55,328 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, -6 predicate places. [2023-11-30 04:00:55,328 INFO L500 AbstractCegarLoop]: Abstraction has has 268 places, 260 transitions, 905 flow [2023-11-30 04:00:55,329 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:00:55,329 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:00:55,329 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:00:55,329 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:00:55,329 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:00:55,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:00:55,330 INFO L85 PathProgramCache]: Analyzing trace with hash 950976742, now seen corresponding path program 1 times [2023-11-30 04:00:55,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:00:55,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403389322] [2023-11-30 04:00:55,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:00:55,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:00:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:00:55,660 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:55,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:00:55,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403389322] [2023-11-30 04:00:55,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403389322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:00:55,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:00:55,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-30 04:00:55,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496355923] [2023-11-30 04:00:55,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:00:55,664 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-30 04:00:55,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:00:55,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-30 04:00:55,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-30 04:00:55,669 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 294 [2023-11-30 04:00:55,671 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:00:55,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:00:55,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 294 [2023-11-30 04:00:55,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:00:57,716 INFO L124 PetriNetUnfolderBase]: 9204/20713 cut-off events. [2023-11-30 04:00:57,717 INFO L125 PetriNetUnfolderBase]: For 14037/21741 co-relation queries the response was YES. [2023-11-30 04:00:57,755 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:00:57,845 INFO L140 encePairwiseOnDemand]: 282/294 looper letters, 74 selfloop transitions, 10 changer transitions 0/258 dead transitions. [2023-11-30 04:00:57,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 258 transitions, 1065 flow [2023-11-30 04:00:57,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-30 04:00:57,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-30 04:00:57,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2006 transitions. [2023-11-30 04:00:57,849 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.682312925170068 [2023-11-30 04:00:57,849 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2006 transitions. [2023-11-30 04:00:57,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2006 transitions. [2023-11-30 04:00:57,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:00:57,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2006 transitions. [2023-11-30 04:00:57,853 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:00:57,856 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:00:57,857 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:00:57,858 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 1 predicate places. [2023-11-30 04:00:57,858 INFO L500 AbstractCegarLoop]: Abstraction has has 275 places, 258 transitions, 1065 flow [2023-11-30 04:00:57,858 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:00:57,858 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:00:57,859 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:00:57,859 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:00:57,859 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:00:57,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:00:57,859 INFO L85 PathProgramCache]: Analyzing trace with hash 950976741, now seen corresponding path program 1 times [2023-11-30 04:00:57,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:00:57,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622778444] [2023-11-30 04:00:57,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:00:57,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:00:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:00:58,070 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:58,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:00:58,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622778444] [2023-11-30 04:00:58,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622778444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:00:58,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:00:58,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-30 04:00:58,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822893880] [2023-11-30 04:00:58,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:00:58,072 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-30 04:00:58,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:00:58,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-30 04:00:58,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-30 04:00:58,074 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 294 [2023-11-30 04:00:58,075 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:00:58,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:00:58,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 294 [2023-11-30 04:00:58,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:00,181 INFO L124 PetriNetUnfolderBase]: 9204/20711 cut-off events. [2023-11-30 04:01:00,181 INFO L125 PetriNetUnfolderBase]: For 27630/39701 co-relation queries the response was YES. [2023-11-30 04:01:00,234 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:00,341 INFO L140 encePairwiseOnDemand]: 283/294 looper letters, 74 selfloop transitions, 9 changer transitions 0/256 dead transitions. [2023-11-30 04:01:00,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 256 transitions, 1215 flow [2023-11-30 04:01:00,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 04:01:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 04:01:00,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1786 transitions. [2023-11-30 04:01:00,348 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6749811035525322 [2023-11-30 04:01:00,348 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1786 transitions. [2023-11-30 04:01:00,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1786 transitions. [2023-11-30 04:01:00,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:00,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1786 transitions. [2023-11-30 04:01:00,355 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:00,361 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:00,362 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:00,363 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 7 predicate places. [2023-11-30 04:01:00,363 INFO L500 AbstractCegarLoop]: Abstraction has has 281 places, 256 transitions, 1215 flow [2023-11-30 04:01:00,364 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:00,364 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:00,364 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:00,364 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:01:00,365 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:00,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:00,365 INFO L85 PathProgramCache]: Analyzing trace with hash -670837734, now seen corresponding path program 1 times [2023-11-30 04:01:00,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:00,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760816141] [2023-11-30 04:01:00,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:00,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:00,737 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:00,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:00,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760816141] [2023-11-30 04:01:00,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760816141] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:00,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:00,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-30 04:01:00,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968385524] [2023-11-30 04:01:00,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:00,738 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-30 04:01:00,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:00,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-30 04:01:00,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-30 04:01:00,741 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 294 [2023-11-30 04:01:00,743 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:00,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:00,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 294 [2023-11-30 04:01:00,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:03,152 INFO L124 PetriNetUnfolderBase]: 9203/20707 cut-off events. [2023-11-30 04:01:03,153 INFO L125 PetriNetUnfolderBase]: For 43654/56932 co-relation queries the response was YES. [2023-11-30 04:01:03,208 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:03,415 INFO L140 encePairwiseOnDemand]: 277/294 looper letters, 46 selfloop transitions, 16 changer transitions 0/252 dead transitions. [2023-11-30 04:01:03,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 252 transitions, 1331 flow [2023-11-30 04:01:03,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-30 04:01:03,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-30 04:01:03,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2571 transitions. [2023-11-30 04:01:03,420 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7287414965986394 [2023-11-30 04:01:03,420 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2571 transitions. [2023-11-30 04:01:03,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2571 transitions. [2023-11-30 04:01:03,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:03,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2571 transitions. [2023-11-30 04:01:03,425 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:03,428 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:03,429 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:03,429 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 15 predicate places. [2023-11-30 04:01:03,430 INFO L500 AbstractCegarLoop]: Abstraction has has 289 places, 252 transitions, 1331 flow [2023-11-30 04:01:03,430 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:03,430 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:03,430 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:03,431 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:01:03,431 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:03,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:03,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1502147520, now seen corresponding path program 1 times [2023-11-30 04:01:03,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:03,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552372900] [2023-11-30 04:01:03,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:03,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:03,530 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:03,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:03,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552372900] [2023-11-30 04:01:03,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552372900] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:03,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:03,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:01:03,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317112222] [2023-11-30 04:01:03,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:03,534 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 04:01:03,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:03,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 04:01:03,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 04:01:03,535 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 294 [2023-11-30 04:01:03,536 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:03,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:03,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 294 [2023-11-30 04:01:03,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:04,619 INFO L124 PetriNetUnfolderBase]: 4139/10279 cut-off events. [2023-11-30 04:01:04,620 INFO L125 PetriNetUnfolderBase]: For 33183/40095 co-relation queries the response was YES. [2023-11-30 04:01:04,641 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:04,696 INFO L140 encePairwiseOnDemand]: 289/294 looper letters, 88 selfloop transitions, 1 changer transitions 0/248 dead transitions. [2023-11-30 04:01:04,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 248 transitions, 1481 flow [2023-11-30 04:01:04,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:04,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:04,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 624 transitions. [2023-11-30 04:01:04,698 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7074829931972789 [2023-11-30 04:01:04,698 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 624 transitions. [2023-11-30 04:01:04,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 624 transitions. [2023-11-30 04:01:04,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:04,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 624 transitions. [2023-11-30 04:01:04,700 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:04,701 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:04,701 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:04,701 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 13 predicate places. [2023-11-30 04:01:04,702 INFO L500 AbstractCegarLoop]: Abstraction has has 287 places, 248 transitions, 1481 flow [2023-11-30 04:01:04,702 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:04,702 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:04,702 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:04,702 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:01:04,702 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:04,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:04,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1389959763, now seen corresponding path program 1 times [2023-11-30 04:01:04,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:04,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907788351] [2023-11-30 04:01:04,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:04,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:04,768 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,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:04,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907788351] [2023-11-30 04:01:04,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907788351] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:04,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:04,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:01:04,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247344561] [2023-11-30 04:01:04,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:04,769 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:01:04,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:04,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:01:04,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:01:04,770 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 294 [2023-11-30 04:01:04,771 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:04,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:04,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 294 [2023-11-30 04:01:04,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:05,916 INFO L124 PetriNetUnfolderBase]: 4064/10048 cut-off events. [2023-11-30 04:01:05,916 INFO L125 PetriNetUnfolderBase]: For 41845/49521 co-relation queries the response was YES. [2023-11-30 04:01:05,936 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:05,982 INFO L140 encePairwiseOnDemand]: 291/294 looper letters, 65 selfloop transitions, 1 changer transitions 0/246 dead transitions. [2023-11-30 04:01:05,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 246 transitions, 1597 flow [2023-11-30 04:01:05,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:05,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2023-11-30 04:01:06,000 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2023-11-30 04:01:06,000 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 686 transitions. [2023-11-30 04:01:06,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 686 transitions. [2023-11-30 04:01:06,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:06,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 686 transitions. [2023-11-30 04:01:06,002 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:06,003 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:06,003 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:06,005 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 13 predicate places. [2023-11-30 04:01:06,005 INFO L500 AbstractCegarLoop]: Abstraction has has 287 places, 246 transitions, 1597 flow [2023-11-30 04:01:06,005 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:06,005 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:06,006 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:06,006 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:01:06,006 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:06,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:06,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1389959764, now seen corresponding path program 1 times [2023-11-30 04:01:06,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:06,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787475364] [2023-11-30 04:01:06,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:06,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:06,058 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:06,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:06,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787475364] [2023-11-30 04:01:06,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787475364] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:06,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:06,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:01:06,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525010908] [2023-11-30 04:01:06,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:06,060 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:01:06,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:06,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:01:06,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:01:06,061 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 294 [2023-11-30 04:01:06,061 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:06,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:06,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 294 [2023-11-30 04:01:06,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:07,081 INFO L124 PetriNetUnfolderBase]: 3989/9817 cut-off events. [2023-11-30 04:01:07,081 INFO L125 PetriNetUnfolderBase]: For 54101/62638 co-relation queries the response was YES. [2023-11-30 04:01:07,108 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:07,167 INFO L140 encePairwiseOnDemand]: 291/294 looper letters, 64 selfloop transitions, 1 changer transitions 0/244 dead transitions. [2023-11-30 04:01:07,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 244 transitions, 1703 flow [2023-11-30 04:01:07,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:07,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:07,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2023-11-30 04:01:07,177 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7698412698412699 [2023-11-30 04:01:07,177 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 679 transitions. [2023-11-30 04:01:07,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 679 transitions. [2023-11-30 04:01:07,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:07,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 679 transitions. [2023-11-30 04:01:07,179 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:07,180 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:07,180 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:07,180 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 13 predicate places. [2023-11-30 04:01:07,181 INFO L500 AbstractCegarLoop]: Abstraction has has 287 places, 244 transitions, 1703 flow [2023-11-30 04:01:07,181 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:07,181 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:07,181 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:07,181 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:01:07,181 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:07,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:07,181 INFO L85 PathProgramCache]: Analyzing trace with hash -287713448, now seen corresponding path program 1 times [2023-11-30 04:01:07,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:07,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119629621] [2023-11-30 04:01:07,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:07,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:01:07,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:07,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119629621] [2023-11-30 04:01:07,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119629621] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:07,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:07,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:01:07,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946763923] [2023-11-30 04:01:07,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:07,252 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:01:07,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:07,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:01:07,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:01:07,254 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 294 [2023-11-30 04:01:07,255 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:07,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:07,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 294 [2023-11-30 04:01:07,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:07,604 INFO L124 PetriNetUnfolderBase]: 618/1889 cut-off events. [2023-11-30 04:01:07,604 INFO L125 PetriNetUnfolderBase]: For 13037/13919 co-relation queries the response was YES. [2023-11-30 04:01:07,608 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:07,617 INFO L140 encePairwiseOnDemand]: 290/294 looper letters, 13 selfloop transitions, 3 changer transitions 3/250 dead transitions. [2023-11-30 04:01:07,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 250 transitions, 1839 flow [2023-11-30 04:01:07,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:07,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:07,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 833 transitions. [2023-11-30 04:01:07,619 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2023-11-30 04:01:07,619 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 833 transitions. [2023-11-30 04:01:07,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 833 transitions. [2023-11-30 04:01:07,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:07,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 833 transitions. [2023-11-30 04:01:07,621 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:07,622 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:07,632 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:07,632 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 15 predicate places. [2023-11-30 04:01:07,633 INFO L500 AbstractCegarLoop]: Abstraction has has 289 places, 250 transitions, 1839 flow [2023-11-30 04:01:07,633 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:07,633 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:07,633 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:07,633 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:01:07,634 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:07,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:07,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1576458658, now seen corresponding path program 1 times [2023-11-30 04:01:07,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:07,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052505787] [2023-11-30 04:01:07,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:07,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:07,744 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,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:07,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052505787] [2023-11-30 04:01:07,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052505787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:07,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:07,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-30 04:01:07,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959339112] [2023-11-30 04:01:07,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:07,749 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-30 04:01:07,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:07,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-30 04:01:07,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-30 04:01:07,751 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 294 [2023-11-30 04:01:07,751 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:07,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:07,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 294 [2023-11-30 04:01:07,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:08,108 INFO L124 PetriNetUnfolderBase]: 563/1713 cut-off events. [2023-11-30 04:01:08,108 INFO L125 PetriNetUnfolderBase]: For 16410/17064 co-relation queries the response was YES. [2023-11-30 04:01:08,112 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:08,122 INFO L140 encePairwiseOnDemand]: 277/294 looper letters, 83 selfloop transitions, 9 changer transitions 3/252 dead transitions. [2023-11-30 04:01:08,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 252 transitions, 2129 flow [2023-11-30 04:01:08,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 04:01:08,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 04:01:08,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1744 transitions. [2023-11-30 04:01:08,125 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6591080876795162 [2023-11-30 04:01:08,126 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1744 transitions. [2023-11-30 04:01:08,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1744 transitions. [2023-11-30 04:01:08,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:08,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1744 transitions. [2023-11-30 04:01:08,129 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:08,131 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:08,131 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:08,132 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 15 predicate places. [2023-11-30 04:01:08,132 INFO L500 AbstractCegarLoop]: Abstraction has has 289 places, 252 transitions, 2129 flow [2023-11-30 04:01:08,132 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:08,133 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:08,133 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:08,133 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:01:08,133 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:08,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:08,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1576458659, now seen corresponding path program 1 times [2023-11-30 04:01:08,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:08,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676625276] [2023-11-30 04:01:08,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:08,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:08,371 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:08,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:08,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676625276] [2023-11-30 04:01:08,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676625276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:08,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:08,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-30 04:01:08,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29744177] [2023-11-30 04:01:08,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:08,372 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-30 04:01:08,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:08,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-30 04:01:08,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-30 04:01:08,374 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 294 [2023-11-30 04:01:08,375 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:08,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:08,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 294 [2023-11-30 04:01:08,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:08,809 INFO L124 PetriNetUnfolderBase]: 493/1580 cut-off events. [2023-11-30 04:01:08,809 INFO L125 PetriNetUnfolderBase]: For 17311/18037 co-relation queries the response was YES. [2023-11-30 04:01:08,813 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:08,821 INFO L140 encePairwiseOnDemand]: 273/294 looper letters, 74 selfloop transitions, 14 changer transitions 3/245 dead transitions. [2023-11-30 04:01:08,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 245 transitions, 2225 flow [2023-11-30 04:01:08,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-30 04:01:08,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-30 04:01:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2252 transitions. [2023-11-30 04:01:08,825 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6383219954648526 [2023-11-30 04:01:08,826 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2252 transitions. [2023-11-30 04:01:08,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2252 transitions. [2023-11-30 04:01:08,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:08,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2252 transitions. [2023-11-30 04:01:08,829 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:08,832 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:08,833 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:08,833 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 19 predicate places. [2023-11-30 04:01:08,833 INFO L500 AbstractCegarLoop]: Abstraction has has 293 places, 245 transitions, 2225 flow [2023-11-30 04:01:08,833 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:08,833 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:08,834 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:08,834 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:01:08,834 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:08,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:08,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1625578810, now seen corresponding path program 1 times [2023-11-30 04:01:08,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:08,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917500979] [2023-11-30 04:01:08,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:08,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:09,492 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:09,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:09,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917500979] [2023-11-30 04:01:09,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917500979] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:09,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:09,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-30 04:01:09,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551546148] [2023-11-30 04:01:09,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:09,493 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-30 04:01:09,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:09,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-30 04:01:09,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-11-30 04:01:09,495 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 294 [2023-11-30 04:01:09,496 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:09,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:09,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 294 [2023-11-30 04:01:09,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:10,263 INFO L124 PetriNetUnfolderBase]: 543/1689 cut-off events. [2023-11-30 04:01:10,263 INFO L125 PetriNetUnfolderBase]: For 21027/21912 co-relation queries the response was YES. [2023-11-30 04:01:10,267 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:10,277 INFO L140 encePairwiseOnDemand]: 274/294 looper letters, 112 selfloop transitions, 23 changer transitions 4/270 dead transitions. [2023-11-30 04:01:10,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 270 transitions, 2988 flow [2023-11-30 04:01:10,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-30 04:01:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-30 04:01:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2508 transitions. [2023-11-30 04:01:10,282 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5331632653061225 [2023-11-30 04:01:10,282 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2508 transitions. [2023-11-30 04:01:10,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2508 transitions. [2023-11-30 04:01:10,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:10,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2508 transitions. [2023-11-30 04:01:10,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 156.75) internal successors, (2508), 16 states have internal predecessors, (2508), 0 states have call successors, (0), 0 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,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 294.0) internal successors, (4998), 17 states have internal predecessors, (4998), 0 states have call successors, (0), 0 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,292 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 294.0) internal successors, (4998), 17 states have internal predecessors, (4998), 0 states have call successors, (0), 0 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,292 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 34 predicate places. [2023-11-30 04:01:10,293 INFO L500 AbstractCegarLoop]: Abstraction has has 308 places, 270 transitions, 2988 flow [2023-11-30 04:01:10,293 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:10,293 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:10,293 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:10,293 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:01:10,294 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:10,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:10,294 INFO L85 PathProgramCache]: Analyzing trace with hash 680851560, now seen corresponding path program 1 times [2023-11-30 04:01:10,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:10,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716475267] [2023-11-30 04:01:10,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:10,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:11,143 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:11,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:11,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716475267] [2023-11-30 04:01:11,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716475267] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:11,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:11,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-30 04:01:11,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715462748] [2023-11-30 04:01:11,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:11,144 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-30 04:01:11,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:11,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-30 04:01:11,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-11-30 04:01:11,146 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 294 [2023-11-30 04:01:11,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 270 transitions, 2988 flow. Second operand has 16 states, 16 states have (on average 150.6875) internal successors, (2411), 16 states have internal predecessors, (2411), 0 states have call successors, (0), 0 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:11,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:11,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 294 [2023-11-30 04:01:11,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:12,284 INFO L124 PetriNetUnfolderBase]: 895/2806 cut-off events. [2023-11-30 04:01:12,284 INFO L125 PetriNetUnfolderBase]: For 40550/41537 co-relation queries the response was YES. [2023-11-30 04:01:12,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20850 conditions, 2806 events. 895/2806 cut-off events. For 40550/41537 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 19953 event pairs, 233 based on Foata normal form. 8/2683 useless extension candidates. Maximal degree in co-relation 16904. Up to 1545 conditions per place. [2023-11-30 04:01:12,311 INFO L140 encePairwiseOnDemand]: 270/294 looper letters, 175 selfloop transitions, 34 changer transitions 4/345 dead transitions. [2023-11-30 04:01:12,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 345 transitions, 5073 flow [2023-11-30 04:01:12,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-30 04:01:12,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-30 04:01:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2687 transitions. [2023-11-30 04:01:12,316 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5376150460184074 [2023-11-30 04:01:12,316 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2687 transitions. [2023-11-30 04:01:12,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2687 transitions. [2023-11-30 04:01:12,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:12,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2687 transitions. [2023-11-30 04:01:12,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 158.05882352941177) internal successors, (2687), 17 states have internal predecessors, (2687), 0 states have call successors, (0), 0 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:12,325 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:12,325 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:12,326 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 50 predicate places. [2023-11-30 04:01:12,326 INFO L500 AbstractCegarLoop]: Abstraction has has 324 places, 345 transitions, 5073 flow [2023-11-30 04:01:12,326 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 150.6875) internal successors, (2411), 16 states have internal predecessors, (2411), 0 states have call successors, (0), 0 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:12,326 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:12,327 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:12,327 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:01:12,327 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:01:12,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:12,327 INFO L85 PathProgramCache]: Analyzing trace with hash 764572978, now seen corresponding path program 2 times [2023-11-30 04:01:12,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:12,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552974088] [2023-11-30 04:01:12,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:12,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:13,073 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,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:13,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552974088] [2023-11-30 04:01:13,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552974088] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:13,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:13,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-30 04:01:13,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196139001] [2023-11-30 04:01:13,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:13,074 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-30 04:01:13,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:13,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-30 04:01:13,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2023-11-30 04:01:13,076 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 294 [2023-11-30 04:01:13,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 345 transitions, 5073 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:13,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:13,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 294 [2023-11-30 04:01:13,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:14,149 INFO L124 PetriNetUnfolderBase]: 942/2947 cut-off events. [2023-11-30 04:01:14,149 INFO L125 PetriNetUnfolderBase]: For 50185/51298 co-relation queries the response was YES. [2023-11-30 04:01:14,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23668 conditions, 2947 events. 942/2947 cut-off events. For 50185/51298 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 21345 event pairs, 233 based on Foata normal form. 13/2822 useless extension candidates. Maximal degree in co-relation 19413. Up to 1627 conditions per place. [2023-11-30 04:01:14,177 INFO L140 encePairwiseOnDemand]: 272/294 looper letters, 192 selfloop transitions, 35 changer transitions 4/363 dead transitions. [2023-11-30 04:01:14,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 363 transitions, 6018 flow [2023-11-30 04:01:14,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-30 04:01:14,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-30 04:01:14,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2670 transitions. [2023-11-30 04:01:14,180 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5342136854741897 [2023-11-30 04:01:14,180 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2670 transitions. [2023-11-30 04:01:14,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2670 transitions. [2023-11-30 04:01:14,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:14,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2670 transitions. [2023-11-30 04:01:14,183 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:14,187 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:14,187 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:14,187 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 66 predicate places. [2023-11-30 04:01:14,187 INFO L500 AbstractCegarLoop]: Abstraction has has 340 places, 363 transitions, 6018 flow [2023-11-30 04:01:14,188 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:14,188 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:14,188 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:14,188 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 04:01:14,188 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:01:14,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:14,189 INFO L85 PathProgramCache]: Analyzing trace with hash -572052910, now seen corresponding path program 1 times [2023-11-30 04:01:14,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:14,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001105182] [2023-11-30 04:01:14,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:14,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:14,219 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,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:14,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001105182] [2023-11-30 04:01:14,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001105182] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:14,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:14,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:01:14,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932843899] [2023-11-30 04:01:14,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:14,220 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:01:14,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:14,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:01:14,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:01:14,221 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 294 [2023-11-30 04:01:14,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 363 transitions, 6018 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:14,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:14,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 294 [2023-11-30 04:01:14,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:14,606 INFO L124 PetriNetUnfolderBase]: 836/2517 cut-off events. [2023-11-30 04:01:14,606 INFO L125 PetriNetUnfolderBase]: For 49696/50066 co-relation queries the response was YES. [2023-11-30 04:01:14,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21280 conditions, 2517 events. 836/2517 cut-off events. For 49696/50066 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 16176 event pairs, 180 based on Foata normal form. 4/2431 useless extension candidates. Maximal degree in co-relation 18363. Up to 1417 conditions per place. [2023-11-30 04:01:14,634 INFO L140 encePairwiseOnDemand]: 291/294 looper letters, 71 selfloop transitions, 2 changer transitions 5/354 dead transitions. [2023-11-30 04:01:14,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 354 transitions, 5970 flow [2023-11-30 04:01:14,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:01:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:01:14,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions. [2023-11-30 04:01:14,637 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9421768707482994 [2023-11-30 04:01:14,637 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 831 transitions. [2023-11-30 04:01:14,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 831 transitions. [2023-11-30 04:01:14,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:14,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 831 transitions. [2023-11-30 04:01:14,640 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:14,641 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,641 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,642 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 68 predicate places. [2023-11-30 04:01:14,642 INFO L500 AbstractCegarLoop]: Abstraction has has 342 places, 354 transitions, 5970 flow [2023-11-30 04:01:14,642 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:14,642 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:14,642 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:14,643 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 04:01:14,643 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:14,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:14,643 INFO L85 PathProgramCache]: Analyzing trace with hash 345468284, now seen corresponding path program 1 times [2023-11-30 04:01:14,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:14,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111327328] [2023-11-30 04:01:14,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:14,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:15,337 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:15,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:15,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111327328] [2023-11-30 04:01:15,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111327328] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:15,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:15,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-11-30 04:01:15,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656397872] [2023-11-30 04:01:15,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:15,338 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-30 04:01:15,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:15,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-30 04:01:15,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-11-30 04:01:15,343 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 294 [2023-11-30 04:01:15,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 354 transitions, 5970 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:15,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:15,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 294 [2023-11-30 04:01:15,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:16,465 INFO L124 PetriNetUnfolderBase]: 976/2742 cut-off events. [2023-11-30 04:01:16,466 INFO L125 PetriNetUnfolderBase]: For 74220/74798 co-relation queries the response was YES. [2023-11-30 04:01:16,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25291 conditions, 2742 events. 976/2742 cut-off events. For 74220/74798 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 17589 event pairs, 218 based on Foata normal form. 2/2639 useless extension candidates. Maximal degree in co-relation 22186. Up to 1572 conditions per place. [2023-11-30 04:01:16,498 INFO L140 encePairwiseOnDemand]: 269/294 looper letters, 201 selfloop transitions, 35 changer transitions 5/385 dead transitions. [2023-11-30 04:01:16,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 385 transitions, 7316 flow [2023-11-30 04:01:16,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-30 04:01:16,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-30 04:01:16,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3147 transitions. [2023-11-30 04:01:16,501 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5633727175080558 [2023-11-30 04:01:16,501 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3147 transitions. [2023-11-30 04:01:16,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3147 transitions. [2023-11-30 04:01:16,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:16,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3147 transitions. [2023-11-30 04:01:16,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 165.6315789473684) internal successors, (3147), 19 states have internal predecessors, (3147), 0 states have call successors, (0), 0 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,509 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:16,509 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:16,511 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 86 predicate places. [2023-11-30 04:01:16,512 INFO L500 AbstractCegarLoop]: Abstraction has has 360 places, 385 transitions, 7316 flow [2023-11-30 04:01:16,512 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:16,512 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:16,512 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:16,513 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 04:01:16,513 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:16,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:16,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1161989109, now seen corresponding path program 1 times [2023-11-30 04:01:16,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:16,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199599257] [2023-11-30 04:01:16,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:16,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:16,761 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,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:16,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199599257] [2023-11-30 04:01:16,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199599257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:16,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:16,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 04:01:16,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108219314] [2023-11-30 04:01:16,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:16,763 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 04:01:16,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:16,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 04:01:16,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-30 04:01:16,764 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 294 [2023-11-30 04:01:16,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 385 transitions, 7316 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:16,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:16,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 294 [2023-11-30 04:01:16,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:17,361 INFO L124 PetriNetUnfolderBase]: 1047/2914 cut-off events. [2023-11-30 04:01:17,361 INFO L125 PetriNetUnfolderBase]: For 91600/91954 co-relation queries the response was YES. [2023-11-30 04:01:17,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28408 conditions, 2914 events. 1047/2914 cut-off events. For 91600/91954 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 18727 event pairs, 220 based on Foata normal form. 9/2828 useless extension candidates. Maximal degree in co-relation 25116. Up to 1664 conditions per place. [2023-11-30 04:01:17,389 INFO L140 encePairwiseOnDemand]: 287/294 looper letters, 214 selfloop transitions, 6 changer transitions 6/394 dead transitions. [2023-11-30 04:01:17,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 394 transitions, 8040 flow [2023-11-30 04:01:17,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 04:01:17,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 04:01:17,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1280 transitions. [2023-11-30 04:01:17,391 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6219630709426628 [2023-11-30 04:01:17,391 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1280 transitions. [2023-11-30 04:01:17,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1280 transitions. [2023-11-30 04:01:17,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:17,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1280 transitions. [2023-11-30 04:01:17,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 182.85714285714286) internal successors, (1280), 7 states have internal predecessors, (1280), 0 states have call successors, (0), 0 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,393 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:17,393 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:17,394 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 92 predicate places. [2023-11-30 04:01:17,394 INFO L500 AbstractCegarLoop]: Abstraction has has 366 places, 394 transitions, 8040 flow [2023-11-30 04:01:17,394 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:17,395 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:17,395 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:17,395 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 04:01:17,395 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:01:17,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:17,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1161989108, now seen corresponding path program 1 times [2023-11-30 04:01:17,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:17,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246268810] [2023-11-30 04:01:17,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:17,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:17,534 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,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:17,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246268810] [2023-11-30 04:01:17,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246268810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:17,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:17,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 04:01:17,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7730373] [2023-11-30 04:01:17,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:17,535 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 04:01:17,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:17,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 04:01:17,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-30 04:01:17,537 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 294 [2023-11-30 04:01:17,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 394 transitions, 8040 flow. Second operand has 7 states, 7 states have (on average 203.85714285714286) internal successors, (1427), 7 states have internal predecessors, (1427), 0 states have call successors, (0), 0 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,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:17,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 294 [2023-11-30 04:01:17,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:18,054 INFO L124 PetriNetUnfolderBase]: 1021/2864 cut-off events. [2023-11-30 04:01:18,054 INFO L125 PetriNetUnfolderBase]: For 103168/103530 co-relation queries the response was YES. [2023-11-30 04:01:18,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29102 conditions, 2864 events. 1021/2864 cut-off events. For 103168/103530 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 18212 event pairs, 216 based on Foata normal form. 24/2793 useless extension candidates. Maximal degree in co-relation 25706. Up to 1614 conditions per place. [2023-11-30 04:01:18,089 INFO L140 encePairwiseOnDemand]: 290/294 looper letters, 195 selfloop transitions, 2 changer transitions 6/391 dead transitions. [2023-11-30 04:01:18,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 391 transitions, 8374 flow [2023-11-30 04:01:18,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:01:18,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:01:18,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 861 transitions. [2023-11-30 04:01:18,091 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7321428571428571 [2023-11-30 04:01:18,091 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 861 transitions. [2023-11-30 04:01:18,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 861 transitions. [2023-11-30 04:01:18,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:18,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 861 transitions. [2023-11-30 04:01:18,092 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:18,093 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:18,093 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:18,093 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 93 predicate places. [2023-11-30 04:01:18,094 INFO L500 AbstractCegarLoop]: Abstraction has has 367 places, 391 transitions, 8374 flow [2023-11-30 04:01:18,094 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 203.85714285714286) internal successors, (1427), 7 states have internal predecessors, (1427), 0 states have call successors, (0), 0 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,094 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:18,094 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:18,094 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 04:01:18,094 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:18,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:18,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1921399839, now seen corresponding path program 1 times [2023-11-30 04:01:18,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:18,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938470601] [2023-11-30 04:01:18,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:18,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:20,875 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:20,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:20,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938470601] [2023-11-30 04:01:20,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938470601] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 04:01:20,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44772262] [2023-11-30 04:01:20,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:20,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:01:20,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:01:20,878 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:20,883 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:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:21,026 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-30 04:01:21,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 04:01:21,181 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 04:01:21,182 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:21,356 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:21,418 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:21,773 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:22,160 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:22,223 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:22,453 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:22,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 04:01:22,587 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:22,844 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:22,844 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 04:01:23,282 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_366 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_366) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_366 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_366) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2023-11-30 04:01:23,300 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_366 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_366) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_366 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_366) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-11-30 04:01:23,492 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_366 (Array Int Int))) (<= 0 (+ (* (select (select (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_366) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_366 (Array Int Int))) (<= (+ (* (select (select (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_366) |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:01:23,542 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 84 |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 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_362 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_366 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_362))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_366) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_362 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_366 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_362))) (store (store .cse6 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_366) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-11-30 04:01:26,167 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_362 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_366 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_362))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_366) |c_~#queue~0.base|) .cse2) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_362 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_366 (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_362))) (store (store .cse5 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_366) |c_~#queue~0.base|) .cse2) 4))))))) is different from false [2023-11-30 04:01:26,299 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_360 (Array Int Int)) (v_ArrVal_362 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_366 (Array Int Int))) (<= (+ (* 4 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_360))) (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_362)))) (store (store .cse1 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_366) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_360 (Array Int Int)) (v_ArrVal_362 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_366 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_360))) (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_362)))) (store (store .cse6 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_366) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|))))) is different from false [2023-11-30 04:01:26,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:01:26,487 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:27,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:01:27,337 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 157 treesize of output 103 [2023-11-30 04:01:27,374 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 124 treesize of output 116 [2023-11-30 04:01:27,380 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 63 treesize of output 51 [2023-11-30 04:01:27,385 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 101 treesize of output 93 [2023-11-30 04:01:27,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:01:27,399 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 77 treesize of output 75 [2023-11-30 04:01:27,482 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-30 04:01:27,482 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 159 treesize of output 1 [2023-11-30 04:01:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-11-30 04:01:28,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44772262] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 04:01:28,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 04:01:28,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 22] total 67 [2023-11-30 04:01:28,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689843495] [2023-11-30 04:01:28,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 04:01:28,029 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-11-30 04:01:28,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:28,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-11-30 04:01:28,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=3381, Unknown=67, NotChecked=750, Total=4556 [2023-11-30 04:01:28,037 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 294 [2023-11-30 04:01:28,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 391 transitions, 8374 flow. Second operand has 68 states, 68 states have (on average 147.2941176470588) internal successors, (10016), 68 states have internal predecessors, (10016), 0 states have call successors, (0), 0 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:28,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:28,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 294 [2023-11-30 04:01:28,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:38,361 INFO L124 PetriNetUnfolderBase]: 1487/4121 cut-off events. [2023-11-30 04:01:38,361 INFO L125 PetriNetUnfolderBase]: For 168433/169344 co-relation queries the response was YES. [2023-11-30 04:01:38,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43792 conditions, 4121 events. 1487/4121 cut-off events. For 168433/169344 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 29062 event pairs, 316 based on Foata normal form. 23/3997 useless extension candidates. Maximal degree in co-relation 38375. Up to 2319 conditions per place. [2023-11-30 04:01:38,414 INFO L140 encePairwiseOnDemand]: 263/294 looper letters, 325 selfloop transitions, 92 changer transitions 8/559 dead transitions. [2023-11-30 04:01:38,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 559 transitions, 14338 flow [2023-11-30 04:01:38,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-11-30 04:01:38,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2023-11-30 04:01:38,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 7665 transitions. [2023-11-30 04:01:38,419 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.511204481792717 [2023-11-30 04:01:38,419 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 7665 transitions. [2023-11-30 04:01:38,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 7665 transitions. [2023-11-30 04:01:38,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:38,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 7665 transitions. [2023-11-30 04:01:38,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 150.2941176470588) internal successors, (7665), 51 states have internal predecessors, (7665), 0 states have call successors, (0), 0 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:38,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 294.0) internal successors, (15288), 52 states have internal predecessors, (15288), 0 states have call successors, (0), 0 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:38,438 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 294.0) internal successors, (15288), 52 states have internal predecessors, (15288), 0 states have call successors, (0), 0 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:38,438 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 143 predicate places. [2023-11-30 04:01:38,438 INFO L500 AbstractCegarLoop]: Abstraction has has 417 places, 559 transitions, 14338 flow [2023-11-30 04:01:38,439 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 147.2941176470588) internal successors, (10016), 68 states have internal predecessors, (10016), 0 states have call successors, (0), 0 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:38,439 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:38,439 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:38,447 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:38,644 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:01:38,644 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:01:38,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:38,645 INFO L85 PathProgramCache]: Analyzing trace with hash -68706586, now seen corresponding path program 1 times [2023-11-30 04:01:38,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:38,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219899038] [2023-11-30 04:01:38,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:38,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:43,019 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:43,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:43,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219899038] [2023-11-30 04:01:43,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219899038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:43,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:43,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-11-30 04:01:43,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433682988] [2023-11-30 04:01:43,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:43,021 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-30 04:01:43,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:43,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-30 04:01:43,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2023-11-30 04:01:43,024 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 294 [2023-11-30 04:01:43,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 559 transitions, 14338 flow. Second operand has 21 states, 21 states have (on average 146.76190476190476) internal successors, (3082), 21 states have internal predecessors, (3082), 0 states have call successors, (0), 0 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,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:43,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 294 [2023-11-30 04:01:43,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:49,194 INFO L124 PetriNetUnfolderBase]: 1556/4288 cut-off events. [2023-11-30 04:01:49,195 INFO L125 PetriNetUnfolderBase]: For 188638/189755 co-relation queries the response was YES. [2023-11-30 04:01:49,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48777 conditions, 4288 events. 1556/4288 cut-off events. For 188638/189755 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 30422 event pairs, 311 based on Foata normal form. 3/4155 useless extension candidates. Maximal degree in co-relation 43054. Up to 2443 conditions per place. [2023-11-30 04:01:49,467 INFO L140 encePairwiseOnDemand]: 268/294 looper letters, 424 selfloop transitions, 51 changer transitions 8/625 dead transitions. [2023-11-30 04:01:49,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 625 transitions, 17770 flow [2023-11-30 04:01:49,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-30 04:01:49,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-30 04:01:49,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3777 transitions. [2023-11-30 04:01:49,471 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5138775510204082 [2023-11-30 04:01:49,471 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3777 transitions. [2023-11-30 04:01:49,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3777 transitions. [2023-11-30 04:01:49,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:49,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3777 transitions. [2023-11-30 04:01:49,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 151.08) internal successors, (3777), 25 states have internal predecessors, (3777), 0 states have call successors, (0), 0 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:49,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 294.0) internal successors, (7644), 26 states have internal predecessors, (7644), 0 states have call successors, (0), 0 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:49,495 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 294.0) internal successors, (7644), 26 states have internal predecessors, (7644), 0 states have call successors, (0), 0 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:49,495 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 167 predicate places. [2023-11-30 04:01:49,495 INFO L500 AbstractCegarLoop]: Abstraction has has 441 places, 625 transitions, 17770 flow [2023-11-30 04:01:49,496 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 146.76190476190476) internal successors, (3082), 21 states have internal predecessors, (3082), 0 states have call successors, (0), 0 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:49,496 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:49,496 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:49,496 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-30 04:01:49,496 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:01:49,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:49,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1741720656, now seen corresponding path program 2 times [2023-11-30 04:01:49,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:49,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529824992] [2023-11-30 04:01:49,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:49,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:52,367 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:52,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:52,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529824992] [2023-11-30 04:01:52,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529824992] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:52,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:52,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-30 04:01:52,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667705505] [2023-11-30 04:01:52,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:52,369 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-30 04:01:52,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:52,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-30 04:01:52,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2023-11-30 04:01:52,373 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 294 [2023-11-30 04:01:52,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 625 transitions, 17770 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:01:52,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:52,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 294 [2023-11-30 04:01:52,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:56,439 INFO L124 PetriNetUnfolderBase]: 1605/4451 cut-off events. [2023-11-30 04:01:56,439 INFO L125 PetriNetUnfolderBase]: For 212112/213324 co-relation queries the response was YES. [2023-11-30 04:01:56,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53341 conditions, 4451 events. 1605/4451 cut-off events. For 212112/213324 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 32069 event pairs, 315 based on Foata normal form. 16/4337 useless extension candidates. Maximal degree in co-relation 47312. Up to 2526 conditions per place. [2023-11-30 04:01:56,490 INFO L140 encePairwiseOnDemand]: 270/294 looper letters, 456 selfloop transitions, 56 changer transitions 8/662 dead transitions. [2023-11-30 04:01:56,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 662 transitions, 20169 flow [2023-11-30 04:01:56,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-30 04:01:56,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-30 04:01:56,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3050 transitions. [2023-11-30 04:01:56,493 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5187074829931972 [2023-11-30 04:01:56,493 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3050 transitions. [2023-11-30 04:01:56,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3050 transitions. [2023-11-30 04:01:56,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:56,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3050 transitions. [2023-11-30 04:01:56,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 152.5) internal successors, (3050), 20 states have internal predecessors, (3050), 0 states have call successors, (0), 0 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:56,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 294.0) internal successors, (6174), 21 states have internal predecessors, (6174), 0 states have call successors, (0), 0 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:56,499 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 294.0) internal successors, (6174), 21 states have internal predecessors, (6174), 0 states have call successors, (0), 0 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:56,499 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 186 predicate places. [2023-11-30 04:01:56,499 INFO L500 AbstractCegarLoop]: Abstraction has has 460 places, 662 transitions, 20169 flow [2023-11-30 04:01:56,499 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:01:56,499 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:56,500 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:56,500 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-30 04:01:56,500 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:01:56,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:56,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1276130532, now seen corresponding path program 3 times [2023-11-30 04:01:56,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:56,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964735125] [2023-11-30 04:01:56,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:56,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:01:57,141 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:57,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:01:57,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964735125] [2023-11-30 04:01:57,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964735125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:01:57,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:01:57,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-30 04:01:57,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090503072] [2023-11-30 04:01:57,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:01:57,142 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-30 04:01:57,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:01:57,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-30 04:01:57,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2023-11-30 04:01:57,144 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 294 [2023-11-30 04:01:57,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 662 transitions, 20169 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:01:57,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:01:57,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 294 [2023-11-30 04:01:57,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:01:58,943 INFO L124 PetriNetUnfolderBase]: 1569/4321 cut-off events. [2023-11-30 04:01:58,943 INFO L125 PetriNetUnfolderBase]: For 219848/220728 co-relation queries the response was YES. [2023-11-30 04:01:58,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55054 conditions, 4321 events. 1569/4321 cut-off events. For 219848/220728 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 30941 event pairs, 292 based on Foata normal form. 20/4230 useless extension candidates. Maximal degree in co-relation 48759. Up to 2481 conditions per place. [2023-11-30 04:01:58,996 INFO L140 encePairwiseOnDemand]: 271/294 looper letters, 460 selfloop transitions, 53 changer transitions 8/663 dead transitions. [2023-11-30 04:01:58,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 663 transitions, 21187 flow [2023-11-30 04:01:58,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-30 04:01:58,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-30 04:01:58,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3032 transitions. [2023-11-30 04:01:59,000 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5156462585034014 [2023-11-30 04:01:59,000 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3032 transitions. [2023-11-30 04:01:59,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3032 transitions. [2023-11-30 04:01:59,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:01:59,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3032 transitions. [2023-11-30 04:01:59,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 151.6) internal successors, (3032), 20 states have internal predecessors, (3032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:01:59,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 294.0) internal successors, (6174), 21 states have internal predecessors, (6174), 0 states have call successors, (0), 0 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:59,006 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 294.0) internal successors, (6174), 21 states have internal predecessors, (6174), 0 states have call successors, (0), 0 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:59,006 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 205 predicate places. [2023-11-30 04:01:59,006 INFO L500 AbstractCegarLoop]: Abstraction has has 479 places, 663 transitions, 21187 flow [2023-11-30 04:01:59,006 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:01:59,006 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:01:59,007 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:01:59,007 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-30 04:01:59,007 INFO L425 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:01:59,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:01:59,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1198348365, now seen corresponding path program 1 times [2023-11-30 04:01:59,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:01:59,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248208742] [2023-11-30 04:01:59,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:01:59,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:01:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:02:00,328 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:00,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:02:00,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248208742] [2023-11-30 04:02:00,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248208742] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 04:02:00,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282891065] [2023-11-30 04:02:00,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:02:00,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:02:00,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:02:00,329 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:00,331 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:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:02:00,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-30 04:02:00,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 04:02:00,597 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-30 04:02:00,597 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:00,632 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 04:02:00,632 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:00,785 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:00,831 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:01,403 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:01,625 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:01,926 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2023-11-30 04:02:01,928 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:02,028 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:02,276 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:02,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 04:02:02,377 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:02,568 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:02,568 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 04:02:02,857 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_518 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_518) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_518 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_518) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2023-11-30 04:02:03,055 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_518 (Array Int Int))) (<= (+ (* (select (select (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_518) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_518 (Array Int Int))) (<= 0 (+ (* (select (select (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_518) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2023-11-30 04:02:03,968 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_512 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_512))) (let ((.cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|))) (.cse5 (select .cse1 |c_~#queue~0.base|))) (or (< .cse0 0) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_513 Int)) (<= 0 (+ (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse0 v_ArrVal_513))) (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_518) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|))))) (forall ((v_ArrVal_512 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_512))) (let ((.cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|))) (.cse9 (select .cse7 |c_~#queue~0.base|))) (or (< .cse6 0) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_513 Int)) (<= (+ (* (select (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse9 .cse6 v_ArrVal_513))) (store (store .cse8 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ (select .cse8 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_518) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse9 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|))))))) is different from false [2023-11-30 04:02:04,167 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_512 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_511 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_512))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_513 Int)) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse5 v_ArrVal_513))) (store (store .cse1 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_518) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|) (< .cse5 0))))) (forall ((v_ArrVal_512 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (v_ArrVal_511 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_512))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|)) (.cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)))) (or (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|) (< .cse7 0) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_513 Int)) (<= 0 (+ (* (select (select (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse6 .cse7 v_ArrVal_513))) (store (store .cse9 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse9 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_518) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))))))) is different from false [2023-11-30 04:02:04,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:02:04,629 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:04,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:02:04,881 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 354 treesize of output 240 [2023-11-30 04:02:04,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:02:04,897 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 1002 treesize of output 990 [2023-11-30 04:02:04,916 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 630 treesize of output 622 [2023-11-30 04:02:04,925 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 622 treesize of output 606 [2023-11-30 04:02:04,936 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 630 treesize of output 614 [2023-11-30 04:02:04,946 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 614 treesize of output 598 [2023-11-30 04:02:04,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 620 treesize of output 604 [2023-11-30 04:02:04,969 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 604 treesize of output 600 [2023-11-30 04:02:04,980 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 600 treesize of output 592 [2023-11-30 04:02:04,987 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-30 04:02:04,992 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 603 treesize of output 595 [2023-11-30 04:02:05,019 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:05,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:02:05,371 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 255 treesize of output 225 [2023-11-30 04:02:08,181 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2023-11-30 04:02:08,182 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:08,239 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:08,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282891065] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 04:02:08,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 04:02:08,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 24] total 72 [2023-11-30 04:02:08,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007302226] [2023-11-30 04:02:08,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 04:02:08,240 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-11-30 04:02:08,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:02:08,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-11-30 04:02:08,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=4277, Unknown=33, NotChecked=548, Total=5256 [2023-11-30 04:02:08,245 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 294 [2023-11-30 04:02:08,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 663 transitions, 21187 flow. Second operand has 73 states, 73 states have (on average 146.17808219178082) internal successors, (10671), 73 states have internal predecessors, (10671), 0 states have call successors, (0), 0 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,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:02:08,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 294 [2023-11-30 04:02:08,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:02:16,317 INFO L124 PetriNetUnfolderBase]: 2371/6671 cut-off events. [2023-11-30 04:02:16,317 INFO L125 PetriNetUnfolderBase]: For 359176/361237 co-relation queries the response was YES. [2023-11-30 04:02:16,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86723 conditions, 6671 events. 2371/6671 cut-off events. For 359176/361237 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 52132 event pairs, 408 based on Foata normal form. 40/6501 useless extension candidates. Maximal degree in co-relation 75695. Up to 3781 conditions per place. [2023-11-30 04:02:16,406 INFO L140 encePairwiseOnDemand]: 259/294 looper letters, 611 selfloop transitions, 121 changer transitions 12/887 dead transitions. [2023-11-30 04:02:16,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 887 transitions, 31646 flow [2023-11-30 04:02:16,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-30 04:02:16,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-11-30 04:02:16,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 5794 transitions. [2023-11-30 04:02:16,410 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5186179735051916 [2023-11-30 04:02:16,411 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 5794 transitions. [2023-11-30 04:02:16,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 5794 transitions. [2023-11-30 04:02:16,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:02:16,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 5794 transitions. [2023-11-30 04:02:16,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 152.47368421052633) internal successors, (5794), 38 states have internal predecessors, (5794), 0 states have call successors, (0), 0 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:16,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 294.0) internal successors, (11466), 39 states have internal predecessors, (11466), 0 states have call successors, (0), 0 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:16,424 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 294.0) internal successors, (11466), 39 states have internal predecessors, (11466), 0 states have call successors, (0), 0 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:16,424 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 242 predicate places. [2023-11-30 04:02:16,424 INFO L500 AbstractCegarLoop]: Abstraction has has 516 places, 887 transitions, 31646 flow [2023-11-30 04:02:16,426 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 146.17808219178082) internal successors, (10671), 73 states have internal predecessors, (10671), 0 states have call successors, (0), 0 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:16,426 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:02:16,426 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:16,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-30 04:02:16,630 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,SelfDestructingSolverStorable22 [2023-11-30 04:02:16,630 INFO L425 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:02:16,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:02:16,631 INFO L85 PathProgramCache]: Analyzing trace with hash -204489032, now seen corresponding path program 1 times [2023-11-30 04:02:16,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:02:16,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181608669] [2023-11-30 04:02:16,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:02:16,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:02:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:02:16,692 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:16,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:02:16,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181608669] [2023-11-30 04:02:16,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181608669] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 04:02:16,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226182048] [2023-11-30 04:02:16,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:02:16,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:02:16,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:02:16,694 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,709 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,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:02:16,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 04:02:16,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 04:02:16,894 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:16,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 04:02:16,939 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:16,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226182048] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 04:02:16,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 04:02:16,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-30 04:02:16,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977280183] [2023-11-30 04:02:16,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 04:02:16,940 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-30 04:02:16,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:02:16,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-30 04:02:16,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-30 04:02:16,942 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 294 [2023-11-30 04:02:16,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 887 transitions, 31646 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:16,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:02:16,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 294 [2023-11-30 04:02:16,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:02:19,248 INFO L124 PetriNetUnfolderBase]: 2704/7351 cut-off events. [2023-11-30 04:02:19,248 INFO L125 PetriNetUnfolderBase]: For 455390/458278 co-relation queries the response was YES. [2023-11-30 04:02:19,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99344 conditions, 7351 events. 2704/7351 cut-off events. For 455390/458278 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 54167 event pairs, 393 based on Foata normal form. 1/7154 useless extension candidates. Maximal degree in co-relation 90434. Up to 4241 conditions per place. [2023-11-30 04:02:19,345 INFO L140 encePairwiseOnDemand]: 288/294 looper letters, 428 selfloop transitions, 9 changer transitions 10/977 dead transitions. [2023-11-30 04:02:19,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 977 transitions, 36847 flow [2023-11-30 04:02:19,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 04:02:19,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 04:02:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2463 transitions. [2023-11-30 04:02:19,347 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9308390022675737 [2023-11-30 04:02:19,347 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2463 transitions. [2023-11-30 04:02:19,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2463 transitions. [2023-11-30 04:02:19,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:02:19,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2463 transitions. [2023-11-30 04:02:19,349 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:19,351 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:19,351 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:19,351 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 250 predicate places. [2023-11-30 04:02:19,351 INFO L500 AbstractCegarLoop]: Abstraction has has 524 places, 977 transitions, 36847 flow [2023-11-30 04:02:19,351 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:19,351 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:02:19,352 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:19,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-30 04:02:19,556 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:02:19,556 INFO L425 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:02:19,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:02:19,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1314089673, now seen corresponding path program 1 times [2023-11-30 04:02:19,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:02:19,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206198129] [2023-11-30 04:02:19,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:02:19,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:02:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:02:19,989 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:19,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:02:19,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206198129] [2023-11-30 04:02:19,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206198129] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 04:02:19,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942122962] [2023-11-30 04:02:19,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:02:19,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:02:19,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:02:19,990 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:20,031 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:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:02:20,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-30 04:02:20,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 04:02:20,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 04:02:20,204 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:20,218 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-30 04:02:20,219 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:20,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 04:02:20,228 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:20,736 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:20,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 04:02:21,234 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:21,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942122962] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 04:02:21,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 04:02:21,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2023-11-30 04:02:21,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455284965] [2023-11-30 04:02:21,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 04:02:21,235 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-30 04:02:21,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:02:21,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-30 04:02:21,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2023-11-30 04:02:21,237 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 294 [2023-11-30 04:02:21,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 977 transitions, 36847 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:21,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:02:21,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 294 [2023-11-30 04:02:21,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:02:24,550 INFO L124 PetriNetUnfolderBase]: 3352/8920 cut-off events. [2023-11-30 04:02:24,550 INFO L125 PetriNetUnfolderBase]: For 612998/616291 co-relation queries the response was YES. [2023-11-30 04:02:24,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127492 conditions, 8920 events. 3352/8920 cut-off events. For 612998/616291 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 69530 event pairs, 410 based on Foata normal form. 53/8760 useless extension candidates. Maximal degree in co-relation 118212. Up to 5278 conditions per place. [2023-11-30 04:02:24,667 INFO L140 encePairwiseOnDemand]: 285/294 looper letters, 938 selfloop transitions, 16 changer transitions 10/1202 dead transitions. [2023-11-30 04:02:24,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 1202 transitions, 49261 flow [2023-11-30 04:02:24,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-30 04:02:24,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-30 04:02:24,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2166 transitions. [2023-11-30 04:02:24,669 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6139455782312925 [2023-11-30 04:02:24,669 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2166 transitions. [2023-11-30 04:02:24,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2166 transitions. [2023-11-30 04:02:24,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:02:24,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2166 transitions. [2023-11-30 04:02:24,685 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:24,686 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:24,687 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:24,687 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 261 predicate places. [2023-11-30 04:02:24,687 INFO L500 AbstractCegarLoop]: Abstraction has has 535 places, 1202 transitions, 49261 flow [2023-11-30 04:02:24,687 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:24,691 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:02:24,691 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:24,698 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:24,895 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:02:24,896 INFO L425 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:02:24,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:02:24,896 INFO L85 PathProgramCache]: Analyzing trace with hash 743015464, now seen corresponding path program 2 times [2023-11-30 04:02:24,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:02:24,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788106432] [2023-11-30 04:02:24,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:02:24,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:02:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:02:27,099 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:27,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:02:27,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788106432] [2023-11-30 04:02:27,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788106432] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 04:02:27,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103571528] [2023-11-30 04:02:27,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 04:02:27,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:02:27,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:02:27,104 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:27,131 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:27,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 04:02:27,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 04:02:27,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 102 conjunts are in the unsatisfiable core [2023-11-30 04:02:27,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 04:02:27,393 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-30 04:02:27,394 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 17 treesize of output 21 [2023-11-30 04:02:27,445 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-30 04:02:27,446 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 16 treesize of output 18 [2023-11-30 04:02:27,597 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:27,649 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:28,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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:28,475 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2023-11-30 04:02:28,476 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2023-11-30 04:02:28,532 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:28,812 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:28,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 04:02:28,923 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:29,268 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-11-30 04:02:29,269 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:29,375 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:29,697 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:29,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 04:02:29,815 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:30,025 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:30,142 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:30,193 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:30,193 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 04:02:30,467 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_735 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_735) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_735 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_735) |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:30,498 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_735) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_735) |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:30,662 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_735) |c_~#queue~0.base|) .cse1))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_735) |c_~#queue~0.base|) .cse1)) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-11-30 04:02:30,669 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_735) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_735) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2023-11-30 04:02:32,698 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_728 (Array Int Int))) (let ((.cse5 (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_728) |c_~#queue~0.base|))) (let ((.cse6 (+ |c_~#queue~0.offset| (* (select .cse5 .cse4) 4)))) (or (forall ((v_ArrVal_729 Int)) (let ((.cse2 (store .cse5 .cse6 v_ArrVal_729))) (let ((.cse0 (select .cse2 .cse4))) (or (= .cse0 20) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= (+ (* (select (select (store (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_735) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))) (< .cse6 0))))) (forall ((v_ArrVal_728 (Array Int Int))) (let ((.cse10 (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_728) |c_~#queue~0.base|))) (let ((.cse7 (+ |c_~#queue~0.offset| (* (select .cse10 .cse4) 4)))) (or (< .cse7 0) (forall ((v_ArrVal_729 Int)) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_729))) (let ((.cse8 (select .cse9 .cse4))) (or (= .cse8 20) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= 0 (+ (* (select (select (store (store (store .cse1 |c_~#queue~0.base| (store (store .cse9 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_735) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))))))))))))) is different from false [2023-11-30 04:02:58,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:02:58,717 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 1252 treesize of output 1256 [2023-11-30 04:02:58,820 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (or (forall ((v_ArrVal_722 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 Int) (v_ArrVal_724 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_722))) (let ((.cse5 (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)) v_ArrVal_724)))) (let ((.cse0 (select .cse5 .cse3))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_728) |c_~#queue~0.base|))) (let ((.cse1 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|))) (or (= .cse0 20) (< .cse1 0) (= (select (store .cse2 .cse1 v_ArrVal_729) .cse3) 20)))))))) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_~q#1.base|)) (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 Int) (v_ArrVal_724 Int) (v_subst_1 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_722))) (let ((.cse14 (let ((.cse15 (select .cse11 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse3) 4)) v_ArrVal_724)))) (let ((.cse8 (select .cse14 .cse3))) (let ((.cse13 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse14 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_728) |c_~#queue~0.base|))) (let ((.cse9 (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|))) (let ((.cse12 (store .cse13 .cse9 v_ArrVal_729))) (let ((.cse10 (select .cse12 .cse3))) (or (= .cse8 20) (< .cse9 0) (= .cse10 20) (< (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse6 (+ v_subst_1 1)) .cse3 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_735) |c_~#queue~0.base|) .cse3) 4)) (+ |c_ULTIMATE.start_empty_~q#1.offset| 85))))))))))) (forall ((v_prenex_26 Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_subst_2 Int) (v_prenex_27 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_prenex_23))) (let ((.cse22 (let ((.cse23 (select .cse19 |c_~#queue~0.base|))) (store .cse23 (+ |c_~#queue~0.offset| (* (select .cse23 .cse3) 4)) v_prenex_29)))) (let ((.cse18 (select .cse22 .cse3))) (let ((.cse21 (select (store (store .cse19 |c_~#queue~0.base| (store (store .cse22 .cse6 (+ v_prenex_26 1)) .cse3 (+ .cse18 1))) |c_~#stored_elements~0.base| v_prenex_27) |c_~#queue~0.base|))) (let ((.cse16 (+ (* 4 (select .cse21 .cse3)) |c_~#queue~0.offset|))) (let ((.cse20 (store .cse21 .cse16 v_prenex_28))) (let ((.cse17 (select .cse20 .cse3))) (or (< .cse16 0) (= 20 .cse17) (= 20 .cse18) (< 0 (+ (* (select (select (store (store (store .cse19 |c_~#queue~0.base| (store (store .cse20 .cse6 (+ v_subst_2 1)) .cse3 (+ .cse17 1))) |c_~#stored_elements~0.base| v_prenex_25) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_24) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 1))))))))))))) is different from false [2023-11-30 04:02:58,926 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (or (forall ((v_ArrVal_722 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 Int) (v_ArrVal_724 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_722))) (let ((.cse5 (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)) v_ArrVal_724)))) (let ((.cse0 (select .cse5 .cse3))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_728) |c_~#queue~0.base|))) (let ((.cse1 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|))) (or (= .cse0 20) (< .cse1 0) (= (select (store .cse2 .cse1 v_ArrVal_729) .cse3) 20)))))))) (= |c_~#queue~0.base| |c_ULTIMATE.start_empty_#in~q#1.base|)) (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 Int) (v_ArrVal_724 Int) (v_subst_1 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_722))) (let ((.cse14 (let ((.cse15 (select .cse9 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse3) 4)) v_ArrVal_724)))) (let ((.cse8 (select .cse14 .cse3))) (let ((.cse13 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse14 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_728) |c_~#queue~0.base|))) (let ((.cse12 (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|))) (let ((.cse10 (store .cse13 .cse12 v_ArrVal_729))) (let ((.cse11 (select .cse10 .cse3))) (or (= .cse8 20) (< (+ |c_~#queue~0.offset| (* (select (select (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse6 (+ v_subst_1 1)) .cse3 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_735) |c_~#queue~0.base|) .cse3) 4)) (+ |c_ULTIMATE.start_empty_#in~q#1.offset| 85)) (< .cse12 0) (= .cse11 20)))))))))) (forall ((v_prenex_26 Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_subst_2 Int) (v_prenex_27 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_prenex_23))) (let ((.cse22 (let ((.cse23 (select .cse19 |c_~#queue~0.base|))) (store .cse23 (+ |c_~#queue~0.offset| (* (select .cse23 .cse3) 4)) v_prenex_29)))) (let ((.cse18 (select .cse22 .cse3))) (let ((.cse21 (select (store (store .cse19 |c_~#queue~0.base| (store (store .cse22 .cse6 (+ v_prenex_26 1)) .cse3 (+ .cse18 1))) |c_~#stored_elements~0.base| v_prenex_27) |c_~#queue~0.base|))) (let ((.cse16 (+ (* 4 (select .cse21 .cse3)) |c_~#queue~0.offset|))) (let ((.cse20 (store .cse21 .cse16 v_prenex_28))) (let ((.cse17 (select .cse20 .cse3))) (or (< .cse16 0) (= 20 .cse17) (= 20 .cse18) (< 0 (+ (* (select (select (store (store (store .cse19 |c_~#queue~0.base| (store (store .cse20 .cse6 (+ v_subst_2 1)) .cse3 (+ .cse17 1))) |c_~#stored_elements~0.base| v_prenex_25) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_24) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 1))))))))))))) is different from false [2023-11-30 04:02:59,060 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 Int) (v_ArrVal_724 Int) (v_subst_1 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_722))) (let ((.cse8 (let ((.cse9 (select .cse0 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse3) 4)) v_ArrVal_724)))) (let ((.cse5 (select .cse8 .cse3))) (let ((.cse7 (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse8 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_728) |c_~#queue~0.base|))) (let ((.cse6 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|))) (let ((.cse1 (store .cse7 .cse6 v_ArrVal_729))) (let ((.cse4 (select .cse1 .cse3))) (or (< (select (select (store (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 (+ v_subst_1 1)) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_735) |c_~#queue~0.base|) .cse3) 22) (= .cse5 20) (< .cse6 0) (= .cse4 20)))))))))) (forall ((v_prenex_26 Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_subst_2 Int) (v_prenex_27 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_prenex_23))) (let ((.cse16 (let ((.cse17 (select .cse13 |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse3) 4)) v_prenex_29)))) (let ((.cse12 (select .cse16 .cse3))) (let ((.cse15 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse16 .cse2 (+ v_prenex_26 1)) .cse3 (+ .cse12 1))) |c_~#stored_elements~0.base| v_prenex_27) |c_~#queue~0.base|))) (let ((.cse10 (+ (* 4 (select .cse15 .cse3)) |c_~#queue~0.offset|))) (let ((.cse14 (store .cse15 .cse10 v_prenex_28))) (let ((.cse11 (select .cse14 .cse3))) (or (< .cse10 0) (= 20 .cse11) (= 20 .cse12) (< 0 (+ (* (select (select (store (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse2 (+ v_subst_2 1)) .cse3 (+ .cse11 1))) |c_~#stored_elements~0.base| v_prenex_25) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_24) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 1))))))))))))) is different from false [2023-11-30 04:03:01,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:03:01,624 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 2378 treesize of output 1259 [2023-11-30 04:03:01,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:03:01,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 2171 treesize of output 2099 [2023-11-30 04:03:01,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 1261 treesize of output 1197 [2023-11-30 04:03:01,695 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 1182 treesize of output 1166 [2023-11-30 04:03:01,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 1166 treesize of output 1158 [2023-11-30 04:03:01,721 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 1178 treesize of output 1146 [2023-11-30 04:03:01,738 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 1136 treesize of output 1120 [2023-11-30 04:03:01,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 1129 treesize of output 1065 [2023-11-30 04:03:01,772 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 1040 treesize of output 1032 [2023-11-30 04:03:01,781 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-30 04:03:01,787 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 1052 treesize of output 1020 [2023-11-30 04:03:01,840 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:05,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:03:05,897 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 2114 treesize of output 1384 [2023-11-30 04:03:07,070 INFO L349 Elim1Store]: treesize reduction 18, result has 63.3 percent of original size [2023-11-30 04:03:07,070 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 44 treesize of output 64 [2023-11-30 04:03:07,163 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 29 refuted. 4 times theorem prover too weak. 0 trivial. 27 not checked. [2023-11-30 04:03:07,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103571528] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 04:03:07,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 04:03:07,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 35, 40] total 104 [2023-11-30 04:03:07,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552604208] [2023-11-30 04:03:07,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 04:03:07,164 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2023-11-30 04:03:07,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:03:07,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2023-11-30 04:03:07,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=8409, Unknown=184, NotChecked=1576, Total=10920 [2023-11-30 04:03:07,171 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 294 [2023-11-30 04:03:07,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 1202 transitions, 49261 flow. Second operand has 105 states, 105 states have (on average 142.11428571428573) internal successors, (14922), 105 states have internal predecessors, (14922), 0 states have call successors, (0), 0 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:07,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:03:07,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 294 [2023-11-30 04:03:07,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:03:39,509 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:03:58,080 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:00,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:04:02,139 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:04:04,152 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:12,714 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:27,252 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:33,043 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:35,057 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:37,118 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:56,973 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:58,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:05:01,013 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:04,343 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:11,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:05:13,573 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:05:15,641 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:18,810 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:20,864 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:22,978 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:25,031 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:43,905 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:45,916 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:05,254 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:07,279 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:09,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.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:11,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:06:13,807 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:19,335 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:21,393 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:22,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:06:24,503 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:26,525 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:28,542 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:30,556 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:32,568 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:34,582 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:36,595 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:38,605 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,709 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:42,734 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,747 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,756 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:50,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:06:52,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.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:55,190 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:57,571 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:05,661 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:07,678 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:09,691 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,711 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,762 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:15,778 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:17,798 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:19,804 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,957 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:24,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s 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,923 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:28,934 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:30,948 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:32,966 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:34,984 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:36,996 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:39,042 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:41,077 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:43,116 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:45,128 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:47,139 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:49,176 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:51,363 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:53,544 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:55,556 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:57,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:07:59,618 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:01,635 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,887 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,913 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:07,966 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:10,755 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:12,964 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:14,971 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:18,295 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:20,407 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:23,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:08:25,575 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:35,271 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:37,378 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:41,392 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:43,404 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:45,855 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:09:03,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:09:05,051 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:09:07,301 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:09:10,185 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:09:12,195 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:09:13,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:09:16,122 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:09:18,130 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:09:20,143 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:09:22,159 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:09:23,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:09:25,446 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:09:34,277 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:09:36,285 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:09:38,550 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:09:40,822 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:09:51,532 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:09:53,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:09:55,191 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:09:58,091 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:10:00,110 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:10:02,544 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:10:04,557 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:10:07,805 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:10:09,819 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:10:12,009 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:10:14,192 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:10:16,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:10:18,216 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:10:20,276 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:10:22,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:10:24,938 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:10:26,955 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:10:39,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 04:10:41,361 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:10:43,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:11:20,906 INFO L124 PetriNetUnfolderBase]: 4460/11988 cut-off events. [2023-11-30 04:11:20,906 INFO L125 PetriNetUnfolderBase]: For 859602/863605 co-relation queries the response was YES. [2023-11-30 04:11:20,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176086 conditions, 11988 events. 4460/11988 cut-off events. For 859602/863605 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 97498 event pairs, 510 based on Foata normal form. 156/11821 useless extension candidates. Maximal degree in co-relation 161490. Up to 6954 conditions per place. [2023-11-30 04:11:21,293 INFO L140 encePairwiseOnDemand]: 248/294 looper letters, 1162 selfloop transitions, 350 changer transitions 16/1661 dead transitions. [2023-11-30 04:11:21,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 1661 transitions, 72624 flow [2023-11-30 04:11:21,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2023-11-30 04:11:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2023-11-30 04:11:21,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 13024 transitions. [2023-11-30 04:11:21,334 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5034013605442177 [2023-11-30 04:11:21,335 INFO L72 ComplementDD]: Start complementDD. Operand 88 states and 13024 transitions. [2023-11-30 04:11:21,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 13024 transitions. [2023-11-30 04:11:21,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:11:21,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 88 states and 13024 transitions. [2023-11-30 04:11:21,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 89 states, 88 states have (on average 148.0) internal successors, (13024), 88 states have internal predecessors, (13024), 0 states have call successors, (0), 0 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:11:21,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 89 states, 89 states have (on average 294.0) internal successors, (26166), 89 states have internal predecessors, (26166), 0 states have call successors, (0), 0 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:11:21,359 INFO L81 ComplementDD]: Finished complementDD. Result has 89 states, 89 states have (on average 294.0) internal successors, (26166), 89 states have internal predecessors, (26166), 0 states have call successors, (0), 0 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:11:21,359 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 348 predicate places. [2023-11-30 04:11:21,359 INFO L500 AbstractCegarLoop]: Abstraction has has 622 places, 1661 transitions, 72624 flow [2023-11-30 04:11:21,361 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 142.11428571428573) internal successors, (14922), 105 states have internal predecessors, (14922), 0 states have call successors, (0), 0 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:11:21,361 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:11:21,361 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, 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] [2023-11-30 04:11:21,382 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:11:21,566 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,SelfDestructingSolverStorable25 [2023-11-30 04:11:21,566 INFO L425 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-11-30 04:11:21,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:11:21,567 INFO L85 PathProgramCache]: Analyzing trace with hash -2053681690, now seen corresponding path program 1 times [2023-11-30 04:11:21,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:11:21,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997775708] [2023-11-30 04:11:21,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:11:21,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:11:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:11:21,663 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-11-30 04:11:21,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:11:21,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997775708] [2023-11-30 04:11:21,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997775708] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:11:21,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:11:21,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:11:21,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285635869] [2023-11-30 04:11:21,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:11:21,664 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:11:21,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:11:21,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:11:21,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:11:21,665 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 294 [2023-11-30 04:11:21,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 1661 transitions, 72624 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:11:21,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:11:21,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 294 [2023-11-30 04:11:21,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:11:24,411 INFO L124 PetriNetUnfolderBase]: 1684/6194 cut-off events. [2023-11-30 04:11:24,411 INFO L125 PetriNetUnfolderBase]: For 503709/505645 co-relation queries the response was YES. [2023-11-30 04:11:24,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81350 conditions, 6194 events. 1684/6194 cut-off events. For 503709/505645 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 48766 event pairs, 241 based on Foata normal form. 767/6779 useless extension candidates. Maximal degree in co-relation 66857. Up to 3236 conditions per place. [2023-11-30 04:11:24,488 INFO L140 encePairwiseOnDemand]: 290/294 looper letters, 250 selfloop transitions, 16 changer transitions 26/1220 dead transitions. [2023-11-30 04:11:24,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 1220 transitions, 49477 flow [2023-11-30 04:11:24,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:11:24,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:11:24,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2023-11-30 04:11:24,490 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9387755102040817 [2023-11-30 04:11:24,490 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 828 transitions. [2023-11-30 04:11:24,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 828 transitions. [2023-11-30 04:11:24,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:11:24,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 828 transitions. [2023-11-30 04:11:24,491 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:11:24,491 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:11:24,491 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:11:24,492 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 350 predicate places. [2023-11-30 04:11:24,492 INFO L500 AbstractCegarLoop]: Abstraction has has 624 places, 1220 transitions, 49477 flow [2023-11-30 04:11:24,492 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:11:24,492 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:11:24,492 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:11:24,492 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-30 04:11:24,492 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:11:24,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:11:24,492 INFO L85 PathProgramCache]: Analyzing trace with hash -213024561, now seen corresponding path program 3 times [2023-11-30 04:11:24,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:11:24,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194092084] [2023-11-30 04:11:24,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:11:24,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:11:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:11:31,741 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:11:31,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:11:31,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194092084] [2023-11-30 04:11:31,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194092084] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 04:11:31,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608793842] [2023-11-30 04:11:31,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-30 04:11:31,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 04:11:31,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:11:31,743 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:11:31,743 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:11:32,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-30 04:11:32,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 04:11:32,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-30 04:11:32,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 04:11:32,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 04:11:32,821 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:11:33,100 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-30 04:11:33,100 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:11:38,345 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:11:38,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 04:11:38,976 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:11:41,079 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-30 04:11:41,079 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 26 treesize of output 24 [2023-11-30 04:11:41,785 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2023-11-30 04:11:41,785 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 31 [2023-11-30 04:11:44,418 INFO L349 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2023-11-30 04:11:44,418 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 2 case distinctions, treesize of input 55 treesize of output 37 [2023-11-30 04:11:45,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 04:11:45,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 48 treesize of output 35 [2023-11-30 04:11:47,624 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-11-30 04:11:47,624 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:11:48,364 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:11:48,810 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:11:50,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:11:51,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 04:11:51,006 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:11:52,815 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:11:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 61 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:11:53,237 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 04:11:55,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:11:55,407 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 1 case distinctions, treesize of input 31 treesize of output 32 [2023-11-30 04:11:55,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:11:55,442 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 52 treesize of output 51 [2023-11-30 04:11:55,456 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 14 treesize of output 10 [2023-11-30 04:11:55,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:11:55,509 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 1 case distinctions, treesize of input 28 treesize of output 29 [2023-11-30 04:11:55,514 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 04:11:55,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 04:11:55,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-30 04:12:32,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:12:32,282 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 1741 treesize of output 829 [2023-11-30 04:12:32,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:12:32,321 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 993 treesize of output 943 [2023-11-30 04:12:32,337 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 512 treesize of output 492 [2023-11-30 04:12:32,349 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 502 treesize of output 490 [2023-11-30 04:12:32,362 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 500 treesize of output 484 [2023-11-30 04:12:32,374 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 484 treesize of output 476 [2023-11-30 04:12:32,387 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 485 treesize of output 473 [2023-11-30 04:12:32,401 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 478 treesize of output 466 [2023-11-30 04:12:32,730 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:12:32,737 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-30 04:12:32,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 04:12:32,768 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 449 treesize of output 341 [2023-11-30 04:12:41,298 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 187 treesize of output 179 [2023-11-30 04:12:41,414 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-11-30 04:12:41,415 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 104 treesize of output 117 [2023-11-30 04:12:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 140 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:12:41,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608793842] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 04:12:41,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 04:12:41,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 40, 41] total 115 [2023-11-30 04:12:41,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90784966] [2023-11-30 04:12:41,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 04:12:41,857 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2023-11-30 04:12:41,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:12:41,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2023-11-30 04:12:41,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1135, Invalid=12119, Unknown=86, NotChecked=0, Total=13340 [2023-11-30 04:12:41,865 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 294 [2023-11-30 04:12:41,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 1220 transitions, 49477 flow. Second operand has 116 states, 116 states have (on average 140.63793103448276) internal successors, (16314), 116 states have internal predecessors, (16314), 0 states have call successors, (0), 0 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:41,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:12:41,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 294 [2023-11-30 04:12:41,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-11-30 04:14:57,294 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-30 04:14:57,294 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:57,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2023-11-30 04:14:57,395 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 100 remaining) [2023-11-30 04:14:57,424 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:14:57,604 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-30 04:14:57,605 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). [2023-11-30 04:14:57,606 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 100 remaining) [2023-11-30 04:14:57,606 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 100 remaining) [2023-11-30 04:14:57,606 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 100 remaining) [2023-11-30 04:14:57,606 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 100 remaining) [2023-11-30 04:14:57,607 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 100 remaining) [2023-11-30 04:14:57,607 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 100 remaining) [2023-11-30 04:14:57,607 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 100 remaining) [2023-11-30 04:14:57,607 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 100 remaining) [2023-11-30 04:14:57,607 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 100 remaining) [2023-11-30 04:14:57,607 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 100 remaining) [2023-11-30 04:14:57,607 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 100 remaining) [2023-11-30 04:14:57,607 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 100 remaining) [2023-11-30 04:14:57,607 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 100 remaining) [2023-11-30 04:14:57,607 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 100 remaining) [2023-11-30 04:14:57,608 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 100 remaining) [2023-11-30 04:14:57,608 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 100 remaining) [2023-11-30 04:14:57,608 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 100 remaining) [2023-11-30 04:14:57,608 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 100 remaining) [2023-11-30 04:14:57,608 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (80 of 100 remaining) [2023-11-30 04:14:57,608 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (79 of 100 remaining) [2023-11-30 04:14:57,608 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 100 remaining) [2023-11-30 04:14:57,608 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 100 remaining) [2023-11-30 04:14:57,608 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 100 remaining) [2023-11-30 04:14:57,608 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 100 remaining) [2023-11-30 04:14:57,608 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 100 remaining) [2023-11-30 04:14:57,608 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 100 remaining) [2023-11-30 04:14:57,608 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 100 remaining) [2023-11-30 04:14:57,608 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 100 remaining) [2023-11-30 04:14:57,608 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 100 remaining) [2023-11-30 04:14:57,608 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 100 remaining) [2023-11-30 04:14:57,608 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 100 remaining) [2023-11-30 04:14:57,609 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 100 remaining) [2023-11-30 04:14:57,609 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 100 remaining) [2023-11-30 04:14:57,609 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 100 remaining) [2023-11-30 04:14:57,609 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 100 remaining) [2023-11-30 04:14:57,609 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 100 remaining) [2023-11-30 04:14:57,609 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 100 remaining) [2023-11-30 04:14:57,609 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 100 remaining) [2023-11-30 04:14:57,609 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 100 remaining) [2023-11-30 04:14:57,609 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 100 remaining) [2023-11-30 04:14:57,609 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 100 remaining) [2023-11-30 04:14:57,609 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 100 remaining) [2023-11-30 04:14:57,609 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 100 remaining) [2023-11-30 04:14:57,609 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 100 remaining) [2023-11-30 04:14:57,609 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 100 remaining) [2023-11-30 04:14:57,609 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 100 remaining) [2023-11-30 04:14:57,609 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 100 remaining) [2023-11-30 04:14:57,609 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 100 remaining) [2023-11-30 04:14:57,609 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 100 remaining) [2023-11-30 04:14:57,609 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 100 remaining) [2023-11-30 04:14:57,609 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 100 remaining) [2023-11-30 04:14:57,609 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 100 remaining) [2023-11-30 04:14:57,610 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 100 remaining) [2023-11-30 04:14:57,610 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 100 remaining) [2023-11-30 04:14:57,610 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 100 remaining) [2023-11-30 04:14:57,610 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 100 remaining) [2023-11-30 04:14:57,610 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 100 remaining) [2023-11-30 04:14:57,610 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 100 remaining) [2023-11-30 04:14:57,610 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 100 remaining) [2023-11-30 04:14:57,610 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 100 remaining) [2023-11-30 04:14:57,610 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 100 remaining) [2023-11-30 04:14:57,610 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 100 remaining) [2023-11-30 04:14:57,610 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 100 remaining) [2023-11-30 04:14:57,610 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 100 remaining) [2023-11-30 04:14:57,610 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 100 remaining) [2023-11-30 04:14:57,610 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 100 remaining) [2023-11-30 04:14:57,610 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 100 remaining) [2023-11-30 04:14:57,610 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 100 remaining) [2023-11-30 04:14:57,610 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 100 remaining) [2023-11-30 04:14:57,610 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 100 remaining) [2023-11-30 04:14:57,610 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 100 remaining) [2023-11-30 04:14:57,610 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 100 remaining) [2023-11-30 04:14:57,610 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 100 remaining) [2023-11-30 04:14:57,611 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 100 remaining) [2023-11-30 04:14:57,611 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 100 remaining) [2023-11-30 04:14:57,611 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 100 remaining) [2023-11-30 04:14:57,611 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 100 remaining) [2023-11-30 04:14:57,611 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 100 remaining) [2023-11-30 04:14:57,611 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 100 remaining) [2023-11-30 04:14:57,611 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 100 remaining) [2023-11-30 04:14:57,611 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 100 remaining) [2023-11-30 04:14:57,611 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 100 remaining) [2023-11-30 04:14:57,611 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 100 remaining) [2023-11-30 04:14:57,611 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 100 remaining) [2023-11-30 04:14:57,611 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 100 remaining) [2023-11-30 04:14:57,611 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 100 remaining) [2023-11-30 04:14:57,611 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 100 remaining) [2023-11-30 04:14:57,611 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 100 remaining) [2023-11-30 04:14:57,611 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 100 remaining) [2023-11-30 04:14:57,611 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 100 remaining) [2023-11-30 04:14:57,611 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 100 remaining) [2023-11-30 04:14:57,611 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 100 remaining) [2023-11-30 04:14:57,611 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 100 remaining) [2023-11-30 04:14:57,611 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 100 remaining) [2023-11-30 04:14:57,611 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 100 remaining) [2023-11-30 04:14:57,612 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 100 remaining) [2023-11-30 04:14:57,612 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 100 remaining) [2023-11-30 04:14:57,612 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 100 remaining) [2023-11-30 04:14:57,612 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 100 remaining) [2023-11-30 04:14:57,612 INFO L457 BasicCegarLoop]: Path program histogram: [3, 3, 2, 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:57,617 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:14:57,617 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:14:57,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:14:57 BasicIcfg [2023-11-30 04:14:57,620 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:14:57,620 INFO L158 Benchmark]: Toolchain (without parser) took 848336.12ms. Allocated memory was 610.3MB in the beginning and 11.0GB in the end (delta: 10.4GB). Free memory was 555.3MB in the beginning and 6.9GB in the end (delta: -6.3GB). Peak memory consumption was 4.1GB. Max. memory is 16.0GB. [2023-11-30 04:14:57,620 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 373.3MB. Free memory is still 320.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:14:57,621 INFO L158 Benchmark]: CACSL2BoogieTranslator took 532.79ms. Allocated memory is still 610.3MB. Free memory was 555.0MB in the beginning and 524.8MB in the end (delta: 30.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-11-30 04:14:57,621 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.80ms. Allocated memory is still 610.3MB. Free memory was 524.8MB in the beginning and 521.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:14:57,621 INFO L158 Benchmark]: Boogie Preprocessor took 29.27ms. Allocated memory is still 610.3MB. Free memory was 521.8MB in the beginning and 519.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:14:57,622 INFO L158 Benchmark]: RCFGBuilder took 637.28ms. Allocated memory is still 610.3MB. Free memory was 519.5MB in the beginning and 548.3MB in the end (delta: -28.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-11-30 04:14:57,622 INFO L158 Benchmark]: TraceAbstraction took 847080.51ms. Allocated memory was 610.3MB in the beginning and 11.0GB in the end (delta: 10.4GB). Free memory was 547.5MB in the beginning and 6.9GB in the end (delta: -6.3GB). Peak memory consumption was 4.1GB. Max. memory is 16.0GB. [2023-11-30 04:14:57,625 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 373.3MB. Free memory is still 320.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 532.79ms. Allocated memory is still 610.3MB. Free memory was 555.0MB in the beginning and 524.8MB in the end (delta: 30.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 51.80ms. Allocated memory is still 610.3MB. Free memory was 524.8MB in the beginning and 521.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.27ms. Allocated memory is still 610.3MB. Free memory was 521.8MB in the beginning and 519.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 637.28ms. Allocated memory is still 610.3MB. Free memory was 519.5MB in the beginning and 548.3MB in the end (delta: -28.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * TraceAbstraction took 847080.51ms. Allocated memory was 610.3MB in the beginning and 11.0GB in the end (delta: 10.4GB). Free memory was 547.5MB in the beginning and 6.9GB in the end (delta: -6.3GB). Peak memory consumption was 4.1GB. 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 enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (116states, 138/294 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 179532 conditions, 14094 events (3610/14093 cut-off events. For 923910/927781 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 153691 event pairs, 498 based on Foata normal form. 83/13928 useless extension candidates. Maximal degree in co-relation 142029. Up to 6933 conditions per place.). - 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: 847.0s, OverallIterations: 28, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 691.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 139 mSolverCounterUnknown, 15781 SdHoareTripleChecker+Valid, 359.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15781 mSDsluCounter, 6496 SdHoareTripleChecker+Invalid, 350.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8303 IncrementalHoareTripleChecker+Unchecked, 5888 mSDsCounter, 1248 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40102 IncrementalHoareTripleChecker+Invalid, 49792 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1248 mSolverCounterUnsat, 608 mSDtfsCounter, 40102 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2578 GetRequests, 1498 SyntacticMatches, 45 SemanticMatches, 1035 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 38773 ImplicationChecksByTransitivity, 385.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72624occurred in iteration=26, InterpolantAutomatonStates: 425, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 152.5s InterpolantComputationTime, 3382 NumberOfCodeBlocks, 3382 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 4163 ConstructedInterpolants, 524 QuantifiedInterpolants, 204616 SizeOfPredicates, 151 NumberOfNonLiveVariables, 2429 ConjunctsInSsa, 383 ConjunctsInUnsatCore, 40 InterpolantComputations, 22 PerfectInterpolantSequences, 196/903 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