/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m [2023-11-10 12:44:20,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-10 12:44:20,687 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-10 12:44:20,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-10 12:44:20,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-10 12:44:20,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-10 12:44:20,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-10 12:44:20,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-10 12:44:20,726 INFO L153 SettingsManager]: * Use SBE=true [2023-11-10 12:44:20,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-10 12:44:20,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-10 12:44:20,731 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-10 12:44:20,731 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-10 12:44:20,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-10 12:44:20,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-10 12:44:20,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-10 12:44:20,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-10 12:44:20,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-10 12:44:20,733 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-10 12:44:20,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-10 12:44:20,733 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-10 12:44:20,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-10 12:44:20,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-10 12:44:20,734 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-10 12:44:20,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-10 12:44:20,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 12:44:20,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-10 12:44:20,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-10 12:44:20,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-10 12:44:20,736 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-10 12:44:20,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-10 12:44:20,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-10 12:44:20,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-10 12:44:20,737 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 [2023-11-10 12:44:20,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-10 12:44:20,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-10 12:44:20,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-10 12:44:20,973 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-10 12:44:20,974 INFO L274 PluginConnector]: CDTParser initialized [2023-11-10 12:44:20,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-11-10 12:44:22,115 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-10 12:44:22,267 INFO L384 CDTParser]: Found 1 translation units. [2023-11-10 12:44:22,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-11-10 12:44:22,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef58d5620/8399c6aaa130448a8c16a43412e0bc4d/FLAG731db1876 [2023-11-10 12:44:22,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef58d5620/8399c6aaa130448a8c16a43412e0bc4d [2023-11-10 12:44:22,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-10 12:44:22,291 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-10 12:44:22,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-10 12:44:22,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-10 12:44:22,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-10 12:44:22,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:44:22" (1/1) ... [2023-11-10 12:44:22,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f1bb365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:22, skipping insertion in model container [2023-11-10 12:44:22,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:44:22" (1/1) ... [2023-11-10 12:44:22,318 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-10 12:44:22,457 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[2987,3000] [2023-11-10 12:44:22,465 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 12:44:22,472 INFO L202 MainTranslator]: Completed pre-run [2023-11-10 12:44:22,491 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[2987,3000] [2023-11-10 12:44:22,493 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 12:44:22,501 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 12:44:22,501 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 12:44:22,507 INFO L206 MainTranslator]: Completed translation [2023-11-10 12:44:22,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:22 WrapperNode [2023-11-10 12:44:22,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-10 12:44:22,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-10 12:44:22,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-10 12:44:22,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-10 12:44:22,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:22" (1/1) ... [2023-11-10 12:44:22,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:22" (1/1) ... [2023-11-10 12:44:22,540 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 208 [2023-11-10 12:44:22,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-10 12:44:22,541 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-10 12:44:22,541 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-10 12:44:22,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-10 12:44:22,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:22" (1/1) ... [2023-11-10 12:44:22,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:22" (1/1) ... [2023-11-10 12:44:22,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:22" (1/1) ... [2023-11-10 12:44:22,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:22" (1/1) ... [2023-11-10 12:44:22,557 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:22" (1/1) ... [2023-11-10 12:44:22,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:22" (1/1) ... [2023-11-10 12:44:22,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:22" (1/1) ... [2023-11-10 12:44:22,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:22" (1/1) ... [2023-11-10 12:44:22,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-10 12:44:22,565 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-10 12:44:22,565 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-10 12:44:22,566 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-10 12:44:22,566 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:22" (1/1) ... [2023-11-10 12:44:22,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 12:44:22,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:44:22,630 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-10 12:44:22,648 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-10 12:44:22,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-10 12:44:22,666 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-10 12:44:22,666 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-10 12:44:22,666 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-10 12:44:22,667 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-10 12:44:22,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-10 12:44:22,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-10 12:44:22,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-10 12:44:22,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-10 12:44:22,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-10 12:44:22,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-10 12:44:22,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-10 12:44:22,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-10 12:44:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-10 12:44:22,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-10 12:44:22,669 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-10 12:44:22,734 INFO L236 CfgBuilder]: Building ICFG [2023-11-10 12:44:22,735 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-10 12:44:22,979 INFO L277 CfgBuilder]: Performing block encoding [2023-11-10 12:44:23,076 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-10 12:44:23,076 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-10 12:44:23,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:44:23 BoogieIcfgContainer [2023-11-10 12:44:23,090 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-10 12:44:23,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-10 12:44:23,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-10 12:44:23,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-10 12:44:23,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:44:22" (1/3) ... [2023-11-10 12:44:23,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c3b5e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:44:23, skipping insertion in model container [2023-11-10 12:44:23,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:22" (2/3) ... [2023-11-10 12:44:23,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c3b5e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:44:23, skipping insertion in model container [2023-11-10 12:44:23,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:44:23" (3/3) ... [2023-11-10 12:44:23,106 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2023-11-10 12:44:23,118 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-10 12:44:23,119 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-10 12:44:23,119 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-10 12:44:23,172 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-10 12:44:23,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 183 transitions, 380 flow [2023-11-10 12:44:23,252 INFO L124 PetriNetUnfolderBase]: 13/181 cut-off events. [2023-11-10 12:44:23,254 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-10 12:44:23,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 181 events. 13/181 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 146. Up to 2 conditions per place. [2023-11-10 12:44:23,258 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 183 transitions, 380 flow [2023-11-10 12:44:23,264 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 172 transitions, 356 flow [2023-11-10 12:44:23,275 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 12:44:23,284 INFO L357 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=false, 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;@52b49676, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 12:44:23,285 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-10 12:44:23,321 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 12:44:23,322 INFO L124 PetriNetUnfolderBase]: 13/171 cut-off events. [2023-11-10 12:44:23,322 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-10 12:44:23,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:44:23,322 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:44:23,323 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:44:23,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:44:23,327 INFO L85 PathProgramCache]: Analyzing trace with hash -226624080, now seen corresponding path program 1 times [2023-11-10 12:44:23,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:44:23,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651859837] [2023-11-10 12:44:23,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:44:23,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:44:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:44:24,002 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-10 12:44:24,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:44:24,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651859837] [2023-11-10 12:44:24,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651859837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:44:24,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:44:24,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 12:44:24,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077441666] [2023-11-10 12:44:24,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:44:24,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 12:44:24,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:44:24,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 12:44:24,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-10 12:44:24,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 183 [2023-11-10 12:44:24,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 172 transitions, 356 flow. Second operand has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:24,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:44:24,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 183 [2023-11-10 12:44:24,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:44:24,290 INFO L124 PetriNetUnfolderBase]: 112/431 cut-off events. [2023-11-10 12:44:24,290 INFO L125 PetriNetUnfolderBase]: For 71/82 co-relation queries the response was YES. [2023-11-10 12:44:24,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 740 conditions, 431 events. 112/431 cut-off events. For 71/82 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1560 event pairs, 56 based on Foata normal form. 9/386 useless extension candidates. Maximal degree in co-relation 435. Up to 122 conditions per place. [2023-11-10 12:44:24,296 INFO L140 encePairwiseOnDemand]: 162/183 looper letters, 71 selfloop transitions, 5 changer transitions 11/197 dead transitions. [2023-11-10 12:44:24,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 197 transitions, 595 flow [2023-11-10 12:44:24,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 12:44:24,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 12:44:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1183 transitions. [2023-11-10 12:44:24,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7182756527018822 [2023-11-10 12:44:24,313 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1183 transitions. [2023-11-10 12:44:24,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1183 transitions. [2023-11-10 12:44:24,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:44:24,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1183 transitions. [2023-11-10 12:44:24,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 131.44444444444446) internal successors, (1183), 9 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:24,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:24,330 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:24,331 INFO L175 Difference]: Start difference. First operand has 166 places, 172 transitions, 356 flow. Second operand 9 states and 1183 transitions. [2023-11-10 12:44:24,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 197 transitions, 595 flow [2023-11-10 12:44:24,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 197 transitions, 577 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-10 12:44:24,341 INFO L231 Difference]: Finished difference. Result has 173 places, 161 transitions, 349 flow [2023-11-10 12:44:24,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=349, PETRI_PLACES=173, PETRI_TRANSITIONS=161} [2023-11-10 12:44:24,346 INFO L281 CegarLoopForPetriNet]: 166 programPoint places, 7 predicate places. [2023-11-10 12:44:24,347 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 161 transitions, 349 flow [2023-11-10 12:44:24,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:24,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:44:24,348 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:44:24,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-10 12:44:24,348 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:44:24,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:44:24,349 INFO L85 PathProgramCache]: Analyzing trace with hash -439837744, now seen corresponding path program 1 times [2023-11-10 12:44:24,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:44:24,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137605547] [2023-11-10 12:44:24,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:44:24,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:44:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:44:24,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:44:24,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:44:24,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137605547] [2023-11-10 12:44:24,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137605547] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:44:24,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:44:24,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 12:44:24,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209635966] [2023-11-10 12:44:24,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:44:24,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 12:44:24,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:44:24,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 12:44:24,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 12:44:24,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 183 [2023-11-10 12:44:24,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 161 transitions, 349 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:24,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:44:24,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 183 [2023-11-10 12:44:24,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:44:24,537 INFO L124 PetriNetUnfolderBase]: 21/236 cut-off events. [2023-11-10 12:44:24,538 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2023-11-10 12:44:24,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 236 events. 21/236 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 388 event pairs, 3 based on Foata normal form. 2/227 useless extension candidates. Maximal degree in co-relation 301. Up to 39 conditions per place. [2023-11-10 12:44:24,540 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 16 selfloop transitions, 2 changer transitions 1/165 dead transitions. [2023-11-10 12:44:24,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 165 transitions, 397 flow [2023-11-10 12:44:24,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 12:44:24,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 12:44:24,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2023-11-10 12:44:24,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9107468123861566 [2023-11-10 12:44:24,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2023-11-10 12:44:24,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2023-11-10 12:44:24,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:44:24,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2023-11-10 12:44:24,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:24,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:24,545 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:24,545 INFO L175 Difference]: Start difference. First operand has 173 places, 161 transitions, 349 flow. Second operand 3 states and 500 transitions. [2023-11-10 12:44:24,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 165 transitions, 397 flow [2023-11-10 12:44:24,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 165 transitions, 393 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-10 12:44:24,550 INFO L231 Difference]: Finished difference. Result has 164 places, 162 transitions, 357 flow [2023-11-10 12:44:24,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=357, PETRI_PLACES=164, PETRI_TRANSITIONS=162} [2023-11-10 12:44:24,551 INFO L281 CegarLoopForPetriNet]: 166 programPoint places, -2 predicate places. [2023-11-10 12:44:24,551 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 162 transitions, 357 flow [2023-11-10 12:44:24,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:24,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:44:24,552 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:44:24,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-10 12:44:24,552 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:44:24,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:44:24,552 INFO L85 PathProgramCache]: Analyzing trace with hash 229490674, now seen corresponding path program 1 times [2023-11-10 12:44:24,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:44:24,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964566646] [2023-11-10 12:44:24,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:44:24,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:44:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:44:24,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:44:24,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:44:24,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964566646] [2023-11-10 12:44:24,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964566646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:44:24,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:44:24,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 12:44:24,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949497557] [2023-11-10 12:44:24,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:44:24,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 12:44:24,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:44:24,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 12:44:24,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 12:44:24,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 183 [2023-11-10 12:44:24,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 162 transitions, 357 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:24,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:44:24,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 183 [2023-11-10 12:44:24,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:44:24,695 INFO L124 PetriNetUnfolderBase]: 15/220 cut-off events. [2023-11-10 12:44:24,695 INFO L125 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2023-11-10 12:44:24,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 220 events. 15/220 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 302 event pairs, 3 based on Foata normal form. 2/209 useless extension candidates. Maximal degree in co-relation 166. Up to 28 conditions per place. [2023-11-10 12:44:24,696 INFO L140 encePairwiseOnDemand]: 180/183 looper letters, 17 selfloop transitions, 2 changer transitions 2/167 dead transitions. [2023-11-10 12:44:24,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 167 transitions, 415 flow [2023-11-10 12:44:24,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 12:44:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 12:44:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2023-11-10 12:44:24,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.912568306010929 [2023-11-10 12:44:24,697 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 501 transitions. [2023-11-10 12:44:24,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 501 transitions. [2023-11-10 12:44:24,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:44:24,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 501 transitions. [2023-11-10 12:44:24,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:24,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:24,700 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:24,700 INFO L175 Difference]: Start difference. First operand has 164 places, 162 transitions, 357 flow. Second operand 3 states and 501 transitions. [2023-11-10 12:44:24,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 167 transitions, 415 flow [2023-11-10 12:44:24,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 167 transitions, 412 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-10 12:44:24,706 INFO L231 Difference]: Finished difference. Result has 166 places, 163 transitions, 367 flow [2023-11-10 12:44:24,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=367, PETRI_PLACES=166, PETRI_TRANSITIONS=163} [2023-11-10 12:44:24,707 INFO L281 CegarLoopForPetriNet]: 166 programPoint places, 0 predicate places. [2023-11-10 12:44:24,707 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 163 transitions, 367 flow [2023-11-10 12:44:24,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:24,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:44:24,708 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:44:24,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-10 12:44:24,708 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:44:24,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:44:24,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1752319610, now seen corresponding path program 1 times [2023-11-10 12:44:24,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:44:24,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829924884] [2023-11-10 12:44:24,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:44:24,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:44:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:44:24,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:44:24,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:44:24,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829924884] [2023-11-10 12:44:24,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829924884] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:44:24,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:44:24,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 12:44:24,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346183771] [2023-11-10 12:44:24,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:44:24,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 12:44:24,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:44:24,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 12:44:24,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-10 12:44:24,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183 [2023-11-10 12:44:24,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 163 transitions, 367 flow. Second operand has 6 states, 6 states have (on average 138.33333333333334) internal successors, (830), 6 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:24,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:44:24,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183 [2023-11-10 12:44:24,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:44:24,994 INFO L124 PetriNetUnfolderBase]: 17/293 cut-off events. [2023-11-10 12:44:24,995 INFO L125 PetriNetUnfolderBase]: For 32/35 co-relation queries the response was YES. [2023-11-10 12:44:24,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 293 events. 17/293 cut-off events. For 32/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 514 event pairs, 6 based on Foata normal form. 3/278 useless extension candidates. Maximal degree in co-relation 310. Up to 49 conditions per place. [2023-11-10 12:44:24,996 INFO L140 encePairwiseOnDemand]: 172/183 looper letters, 41 selfloop transitions, 8 changer transitions 24/191 dead transitions. [2023-11-10 12:44:24,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 191 transitions, 576 flow [2023-11-10 12:44:24,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 12:44:24,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 12:44:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1266 transitions. [2023-11-10 12:44:24,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7686703096539163 [2023-11-10 12:44:24,998 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1266 transitions. [2023-11-10 12:44:24,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1266 transitions. [2023-11-10 12:44:24,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:44:24,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1266 transitions. [2023-11-10 12:44:25,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 140.66666666666666) internal successors, (1266), 9 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:25,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:25,005 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:25,005 INFO L175 Difference]: Start difference. First operand has 166 places, 163 transitions, 367 flow. Second operand 9 states and 1266 transitions. [2023-11-10 12:44:25,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 191 transitions, 576 flow [2023-11-10 12:44:25,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 191 transitions, 573 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-10 12:44:25,009 INFO L231 Difference]: Finished difference. Result has 176 places, 164 transitions, 395 flow [2023-11-10 12:44:25,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=395, PETRI_PLACES=176, PETRI_TRANSITIONS=164} [2023-11-10 12:44:25,010 INFO L281 CegarLoopForPetriNet]: 166 programPoint places, 10 predicate places. [2023-11-10 12:44:25,010 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 164 transitions, 395 flow [2023-11-10 12:44:25,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 138.33333333333334) internal successors, (830), 6 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:25,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:44:25,011 INFO L208 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, 1, 1, 1, 1, 1, 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-10 12:44:25,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-10 12:44:25,011 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:44:25,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:44:25,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1618615662, now seen corresponding path program 1 times [2023-11-10 12:44:25,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:44:25,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408759765] [2023-11-10 12:44:25,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:44:25,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:44:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:44:25,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:44:25,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:44:25,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408759765] [2023-11-10 12:44:25,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408759765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:44:25,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:44:25,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 12:44:25,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598614747] [2023-11-10 12:44:25,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:44:25,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 12:44:25,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:44:25,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 12:44:25,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-10 12:44:25,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183 [2023-11-10 12:44:25,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 164 transitions, 395 flow. Second operand has 6 states, 6 states have (on average 139.0) internal successors, (834), 6 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:25,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:44:25,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183 [2023-11-10 12:44:25,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:44:25,262 INFO L124 PetriNetUnfolderBase]: 16/264 cut-off events. [2023-11-10 12:44:25,263 INFO L125 PetriNetUnfolderBase]: For 49/52 co-relation queries the response was YES. [2023-11-10 12:44:25,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 264 events. 16/264 cut-off events. For 49/52 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 426 event pairs, 6 based on Foata normal form. 3/251 useless extension candidates. Maximal degree in co-relation 291. Up to 53 conditions per place. [2023-11-10 12:44:25,264 INFO L140 encePairwiseOnDemand]: 172/183 looper letters, 42 selfloop transitions, 8 changer transitions 9/177 dead transitions. [2023-11-10 12:44:25,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 177 transitions, 547 flow [2023-11-10 12:44:25,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 12:44:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 12:44:25,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1251 transitions. [2023-11-10 12:44:25,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7595628415300546 [2023-11-10 12:44:25,268 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1251 transitions. [2023-11-10 12:44:25,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1251 transitions. [2023-11-10 12:44:25,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:44:25,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1251 transitions. [2023-11-10 12:44:25,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 139.0) internal successors, (1251), 9 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:25,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:25,273 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:25,273 INFO L175 Difference]: Start difference. First operand has 176 places, 164 transitions, 395 flow. Second operand 9 states and 1251 transitions. [2023-11-10 12:44:25,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 177 transitions, 547 flow [2023-11-10 12:44:25,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 177 transitions, 525 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-11-10 12:44:25,277 INFO L231 Difference]: Finished difference. Result has 178 places, 165 transitions, 405 flow [2023-11-10 12:44:25,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=405, PETRI_PLACES=178, PETRI_TRANSITIONS=165} [2023-11-10 12:44:25,277 INFO L281 CegarLoopForPetriNet]: 166 programPoint places, 12 predicate places. [2023-11-10 12:44:25,278 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 165 transitions, 405 flow [2023-11-10 12:44:25,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 139.0) internal successors, (834), 6 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:25,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:44:25,278 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 12:44:25,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-10 12:44:25,278 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:44:25,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:44:25,279 INFO L85 PathProgramCache]: Analyzing trace with hash -930336552, now seen corresponding path program 1 times [2023-11-10 12:44:25,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:44:25,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441853179] [2023-11-10 12:44:25,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:44:25,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:44:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:44:28,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:44:28,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:44:28,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441853179] [2023-11-10 12:44:28,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441853179] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:44:28,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417177735] [2023-11-10 12:44:28,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:44:28,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:44:28,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:44:28,154 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-10 12:44:28,154 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-10 12:44:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:44:28,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-10 12:44:28,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:44:30,678 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-10 12:44:30,678 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 20 [2023-11-10 12:44:30,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:44:30,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:44:31,824 INFO L322 Elim1Store]: treesize reduction 22, result has 89.8 percent of original size [2023-11-10 12:44:31,824 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 224 [2023-11-10 12:44:38,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:44:38,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417177735] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:44:38,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:44:38,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 36, 31] total 98 [2023-11-10 12:44:38,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567920942] [2023-11-10 12:44:38,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:44:38,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2023-11-10 12:44:38,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:44:38,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2023-11-10 12:44:38,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1017, Invalid=8489, Unknown=0, NotChecked=0, Total=9506 [2023-11-10 12:44:38,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 183 [2023-11-10 12:44:38,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 165 transitions, 405 flow. Second operand has 98 states, 98 states have (on average 55.214285714285715) internal successors, (5411), 98 states have internal predecessors, (5411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:44:38,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:44:38,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 183 [2023-11-10 12:44:38,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:45:05,241 INFO L124 PetriNetUnfolderBase]: 2215/4790 cut-off events. [2023-11-10 12:45:05,241 INFO L125 PetriNetUnfolderBase]: For 699/699 co-relation queries the response was YES. [2023-11-10 12:45:05,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10082 conditions, 4790 events. 2215/4790 cut-off events. For 699/699 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 36977 event pairs, 82 based on Foata normal form. 6/4394 useless extension candidates. Maximal degree in co-relation 9229. Up to 721 conditions per place. [2023-11-10 12:45:05,263 INFO L140 encePairwiseOnDemand]: 119/183 looper letters, 672 selfloop transitions, 533 changer transitions 105/1353 dead transitions. [2023-11-10 12:45:05,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 1353 transitions, 6117 flow [2023-11-10 12:45:05,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 262 states. [2023-11-10 12:45:05,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2023-11-10 12:45:05,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 14943 transitions. [2023-11-10 12:45:05,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3116631210111375 [2023-11-10 12:45:05,295 INFO L72 ComplementDD]: Start complementDD. Operand 262 states and 14943 transitions. [2023-11-10 12:45:05,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 262 states and 14943 transitions. [2023-11-10 12:45:05,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:45:05,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 262 states and 14943 transitions. [2023-11-10 12:45:05,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 263 states, 262 states have (on average 57.034351145038165) internal successors, (14943), 262 states have internal predecessors, (14943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:45:05,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 263 states, 263 states have (on average 183.0) internal successors, (48129), 263 states have internal predecessors, (48129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:45:05,419 INFO L81 ComplementDD]: Finished complementDD. Result has 263 states, 263 states have (on average 183.0) internal successors, (48129), 263 states have internal predecessors, (48129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:45:05,420 INFO L175 Difference]: Start difference. First operand has 178 places, 165 transitions, 405 flow. Second operand 262 states and 14943 transitions. [2023-11-10 12:45:05,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 1353 transitions, 6117 flow [2023-11-10 12:45:05,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 1353 transitions, 6063 flow, removed 12 selfloop flow, removed 6 redundant places. [2023-11-10 12:45:05,442 INFO L231 Difference]: Finished difference. Result has 540 places, 760 transitions, 4045 flow [2023-11-10 12:45:05,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=262, PETRI_FLOW=4045, PETRI_PLACES=540, PETRI_TRANSITIONS=760} [2023-11-10 12:45:05,443 INFO L281 CegarLoopForPetriNet]: 166 programPoint places, 374 predicate places. [2023-11-10 12:45:05,443 INFO L495 AbstractCegarLoop]: Abstraction has has 540 places, 760 transitions, 4045 flow [2023-11-10 12:45:05,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 55.214285714285715) internal successors, (5411), 98 states have internal predecessors, (5411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:45:05,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:45:05,445 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 12:45:05,450 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-10 12:45:05,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-10 12:45:05,651 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:45:05,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:45:05,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1800933628, now seen corresponding path program 2 times [2023-11-10 12:45:05,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:45:05,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590695507] [2023-11-10 12:45:05,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:45:05,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:45:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:45:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:45:08,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:45:08,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590695507] [2023-11-10 12:45:08,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590695507] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:45:08,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461929762] [2023-11-10 12:45:08,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-10 12:45:08,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:45:08,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:45:08,084 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-10 12:45:08,085 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-10 12:45:08,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-10 12:45:08,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:45:08,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 80 conjunts are in the unsatisfiable core [2023-11-10 12:45:08,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:45:08,752 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-10 12:45:09,022 INFO L351 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 23 treesize of output 1 [2023-11-10 12:45:09,991 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-10 12:45:09,992 INFO L351 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-10 12:45:10,338 INFO L351 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-10 12:45:10,985 INFO L351 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 8 treesize of output 1 [2023-11-10 12:45:11,156 INFO L351 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 8 treesize of output 1 [2023-11-10 12:45:11,647 INFO L351 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2023-11-10 12:45:11,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:45:11,962 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:45:22,582 INFO L322 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-11-10 12:45:22,582 INFO L351 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 217 treesize of output 115 [2023-11-10 12:45:22,655 INFO L322 Elim1Store]: treesize reduction 65, result has 55.8 percent of original size [2023-11-10 12:45:22,655 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 645 treesize of output 654 [2023-11-10 12:45:22,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:45:22,730 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:45:22,730 INFO L351 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 187 treesize of output 203 [2023-11-10 12:45:22,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:45:22,763 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:45:22,764 INFO L351 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 185 treesize of output 177 [2023-11-10 12:45:26,483 INFO L322 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-11-10 12:45:26,483 INFO L351 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 217 treesize of output 115 [2023-11-10 12:45:26,574 INFO L322 Elim1Store]: treesize reduction 66, result has 55.1 percent of original size [2023-11-10 12:45:26,574 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 477 treesize of output 501 [2023-11-10 12:45:26,608 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-10 12:45:26,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:45:26,623 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:45:26,623 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 192 treesize of output 200 [2023-11-10 12:45:26,636 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-10 12:45:26,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:45:26,651 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:45:26,652 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 206 treesize of output 190 [2023-11-10 12:45:28,651 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:45:28,651 INFO L351 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 74 treesize of output 93 [2023-11-10 12:45:29,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:45:29,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461929762] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:45:29,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:45:29,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 45, 44] total 120 [2023-11-10 12:45:29,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428581441] [2023-11-10 12:45:29,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:45:29,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 120 states [2023-11-10 12:45:29,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:45:29,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2023-11-10 12:45:29,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1501, Invalid=12722, Unknown=57, NotChecked=0, Total=14280 [2023-11-10 12:45:29,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 183 [2023-11-10 12:45:29,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 760 transitions, 4045 flow. Second operand has 120 states, 120 states have (on average 44.71666666666667) internal successors, (5366), 120 states have internal predecessors, (5366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:45:29,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:45:29,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 183 [2023-11-10 12:45:29,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:45:42,542 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-10 12:46:31,701 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-10 12:46:47,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:47:02,265 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-10 12:48:20,491 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-10 12:48:34,510 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-10 12:48:36,797 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-10 12:48:39,644 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-10 12:50:04,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:50:24,880 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-10 12:51:34,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-10 12:52:07,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:52:09,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:52:12,244 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-10 12:52:38,567 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-10 12:52:44,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:52:46,346 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-10 12:52:50,240 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-10 12:52:52,757 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-10 12:52:54,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:53:07,420 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-10 12:53:09,808 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-10 12:53:11,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-10 12:53:13,923 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-10 12:53:33,299 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] Received shutdown request... [2023-11-10 12:53:38,539 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-10 12:53:38,539 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-10 12:53:39,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2023-11-10 12:53:39,183 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-10 12:53:39,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-10 12:53:39,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-10 12:53:39,387 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 306 known predicates. [2023-11-10 12:53:39,388 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-11-10 12:53:39,388 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-11-10 12:53:39,389 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-11-10 12:53:39,391 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-10 12:53:39,391 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-10 12:53:39,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:53:39 BasicIcfg [2023-11-10 12:53:39,393 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-10 12:53:39,393 INFO L158 Benchmark]: Toolchain (without parser) took 557102.59ms. Allocated memory was 245.4MB in the beginning and 1.1GB in the end (delta: 817.9MB). Free memory was 194.7MB in the beginning and 804.8MB in the end (delta: -610.2MB). Peak memory consumption was 209.3MB. Max. memory is 8.0GB. [2023-11-10 12:53:39,394 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-10 12:53:39,394 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.81ms. Allocated memory is still 245.4MB. Free memory was 194.7MB in the beginning and 182.7MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-11-10 12:53:39,394 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.33ms. Allocated memory is still 245.4MB. Free memory was 182.7MB in the beginning and 180.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-10 12:53:39,394 INFO L158 Benchmark]: Boogie Preprocessor took 23.71ms. Allocated memory is still 245.4MB. Free memory was 180.3MB in the beginning and 178.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-10 12:53:39,394 INFO L158 Benchmark]: RCFGBuilder took 525.01ms. Allocated memory is still 245.4MB. Free memory was 178.6MB in the beginning and 147.8MB in the end (delta: 30.7MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2023-11-10 12:53:39,394 INFO L158 Benchmark]: TraceAbstraction took 556293.02ms. Allocated memory was 245.4MB in the beginning and 1.1GB in the end (delta: 817.9MB). Free memory was 213.9MB in the beginning and 804.8MB in the end (delta: -590.9MB). Peak memory consumption was 226.5MB. Max. memory is 8.0GB. [2023-11-10 12:53:39,395 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.16ms. Allocated memory is still 167.8MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.81ms. Allocated memory is still 245.4MB. Free memory was 194.7MB in the beginning and 182.7MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.33ms. Allocated memory is still 245.4MB. Free memory was 182.7MB in the beginning and 180.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.71ms. Allocated memory is still 245.4MB. Free memory was 180.3MB in the beginning and 178.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 525.01ms. Allocated memory is still 245.4MB. Free memory was 178.6MB in the beginning and 147.8MB in the end (delta: 30.7MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 556293.02ms. Allocated memory was 245.4MB in the beginning and 1.1GB in the end (delta: 817.9MB). Free memory was 213.9MB in the beginning and 804.8MB in the end (delta: -590.9MB). Peak memory consumption was 226.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 306 known predicates. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 306 known predicates. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 306 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 191 locations, 3 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: 556.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 517.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 398 mSolverCounterUnknown, 6323 SdHoareTripleChecker+Valid, 97.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6323 mSDsluCounter, 7252 SdHoareTripleChecker+Invalid, 94.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6984 mSDsCounter, 1164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19896 IncrementalHoareTripleChecker+Invalid, 21458 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1164 mSolverCounterUnsat, 268 mSDtfsCounter, 19896 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1188 GetRequests, 506 SyntacticMatches, 2 SemanticMatches, 679 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80538 ImplicationChecksByTransitivity, 424.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4045occurred in iteration=6, InterpolantAutomatonStates: 295, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 38.0s InterpolantComputationTime, 1326 NumberOfCodeBlocks, 1326 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1631 ConstructedInterpolants, 80 QuantifiedInterpolants, 39963 SizeOfPredicates, 105 NumberOfNonLiveVariables, 688 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 7/31 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