/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-29 21:58:13,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 21:58:13,487 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-29 21:58:13,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 21:58:13,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 21:58:13,510 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 21:58:13,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 21:58:13,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 21:58:13,511 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 21:58:13,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 21:58:13,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 21:58:13,515 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 21:58:13,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 21:58:13,516 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 21:58:13,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 21:58:13,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 21:58:13,517 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 21:58:13,517 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 21:58:13,517 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 21:58:13,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 21:58:13,517 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 21:58:13,518 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 21:58:13,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 21:58:13,518 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-29 21:58:13,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 21:58:13,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 21:58:13,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 21:58:13,520 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 21:58:13,520 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 21:58:13,520 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 21:58:13,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 21:58:13,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 21:58:13,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 21:58:13,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-11-29 21:58:13,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 21:58:13,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 21:58:13,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 21:58:13,709 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 21:58:13,709 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 21:58:13,710 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c [2023-11-29 21:58:14,627 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 21:58:14,803 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 21:58:14,804 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c [2023-11-29 21:58:14,812 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2472dbc4/a708a3cee5d0438da30b00e66e0da084/FLAG8d7e75ef8 [2023-11-29 21:58:14,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2472dbc4/a708a3cee5d0438da30b00e66e0da084 [2023-11-29 21:58:14,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 21:58:14,826 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-29 21:58:14,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 21:58:14,828 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 21:58:14,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 21:58:14,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 09:58:14" (1/1) ... [2023-11-29 21:58:14,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c06a71d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:58:14, skipping insertion in model container [2023-11-29 21:58:14,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 09:58:14" (1/1) ... [2023-11-29 21:58:14,861 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 21:58:15,010 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-bad-ring-nondet.wvr.c[4124,4137] [2023-11-29 21:58:15,015 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 21:58:15,021 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 21:58:15,046 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-bad-ring-nondet.wvr.c[4124,4137] [2023-11-29 21:58:15,048 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 21:58:15,053 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 21:58:15,053 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 21:58:15,057 INFO L206 MainTranslator]: Completed translation [2023-11-29 21:58:15,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:58:15 WrapperNode [2023-11-29 21:58:15,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 21:58:15,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 21:58:15,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 21:58:15,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 21:58:15,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:58:15" (1/1) ... [2023-11-29 21:58:15,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:58:15" (1/1) ... [2023-11-29 21:58:15,090 INFO L138 Inliner]: procedures = 25, calls = 63, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 333 [2023-11-29 21:58:15,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 21:58:15,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 21:58:15,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 21:58:15,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 21:58:15,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:58:15" (1/1) ... [2023-11-29 21:58:15,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:58:15" (1/1) ... [2023-11-29 21:58:15,100 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:58:15" (1/1) ... [2023-11-29 21:58:15,100 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:58:15" (1/1) ... [2023-11-29 21:58:15,107 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:58:15" (1/1) ... [2023-11-29 21:58:15,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:58:15" (1/1) ... [2023-11-29 21:58:15,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:58:15" (1/1) ... [2023-11-29 21:58:15,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:58:15" (1/1) ... [2023-11-29 21:58:15,114 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 21:58:15,115 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 21:58:15,115 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 21:58:15,115 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 21:58:15,115 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:58:15" (1/1) ... [2023-11-29 21:58:15,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 21:58:15,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:58:15,136 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-29 21:58:15,154 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-29 21:58:15,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 21:58:15,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 21:58:15,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 21:58:15,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 21:58:15,160 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 21:58:15,160 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 21:58:15,160 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 21:58:15,160 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 21:58:15,160 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 21:58:15,160 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 21:58:15,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 21:58:15,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 21:58:15,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 21:58:15,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 21:58:15,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 21:58:15,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 21:58:15,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 21:58:15,161 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 21:58:15,249 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 21:58:15,250 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 21:58:15,605 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 21:58:15,703 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 21:58:15,703 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-29 21:58:15,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 09:58:15 BoogieIcfgContainer [2023-11-29 21:58:15,705 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 21:58:15,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 21:58:15,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 21:58:15,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 21:58:15,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 09:58:14" (1/3) ... [2023-11-29 21:58:15,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755224fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 09:58:15, skipping insertion in model container [2023-11-29 21:58:15,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:58:15" (2/3) ... [2023-11-29 21:58:15,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755224fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 09:58:15, skipping insertion in model container [2023-11-29 21:58:15,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 09:58:15" (3/3) ... [2023-11-29 21:58:15,710 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring-nondet.wvr.c [2023-11-29 21:58:15,721 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 21:58:15,721 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 21:58:15,721 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 21:58:15,790 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 21:58:15,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 277 places, 292 transitions, 605 flow [2023-11-29 21:58:15,953 INFO L124 PetriNetUnfolderBase]: 25/289 cut-off events. [2023-11-29 21:58:15,953 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 21:58:15,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 289 events. 25/289 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 231 event pairs, 0 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 248. Up to 3 conditions per place. [2023-11-29 21:58:15,959 INFO L82 GeneralOperation]: Start removeDead. Operand has 277 places, 292 transitions, 605 flow [2023-11-29 21:58:15,966 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 278 transitions, 574 flow [2023-11-29 21:58:15,977 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 21:58:15,981 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4c20659f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 21:58:15,982 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-29 21:58:16,026 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 21:58:16,026 INFO L124 PetriNetUnfolderBase]: 25/277 cut-off events. [2023-11-29 21:58:16,027 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 21:58:16,027 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:58:16,028 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 21:58:16,028 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:58:16,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:58:16,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1602609321, now seen corresponding path program 1 times [2023-11-29 21:58:16,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:58:16,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114660054] [2023-11-29 21:58:16,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:58:16,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:58:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:58:16,340 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-29 21:58:16,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:58:16,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114660054] [2023-11-29 21:58:16,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114660054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:58:16,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:58:16,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 21:58:16,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766348670] [2023-11-29 21:58:16,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:58:16,350 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 21:58:16,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:58:16,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 21:58:16,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 21:58:16,377 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 292 [2023-11-29 21:58:16,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 278 transitions, 574 flow. Second operand has 2 states, 2 states have (on average 265.5) internal successors, (531), 2 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:16,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:58:16,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 292 [2023-11-29 21:58:16,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:58:16,487 INFO L124 PetriNetUnfolderBase]: 102/551 cut-off events. [2023-11-29 21:58:16,487 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-11-29 21:58:16,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 740 conditions, 551 events. 102/551 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2000 event pairs, 56 based on Foata normal form. 84/580 useless extension candidates. Maximal degree in co-relation 417. Up to 146 conditions per place. [2023-11-29 21:58:16,494 INFO L140 encePairwiseOnDemand]: 275/292 looper letters, 13 selfloop transitions, 0 changer transitions 8/261 dead transitions. [2023-11-29 21:58:16,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 261 transitions, 566 flow [2023-11-29 21:58:16,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 21:58:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 21:58:16,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 552 transitions. [2023-11-29 21:58:16,507 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9452054794520548 [2023-11-29 21:58:16,508 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 552 transitions. [2023-11-29 21:58:16,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 552 transitions. [2023-11-29 21:58:16,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:58:16,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 552 transitions. [2023-11-29 21:58:16,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 276.0) internal successors, (552), 2 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:16,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 292.0) internal successors, (876), 3 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:16,521 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 292.0) internal successors, (876), 3 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:16,524 INFO L307 CegarLoopForPetriNet]: 263 programPoint places, 1 predicate places. [2023-11-29 21:58:16,524 INFO L500 AbstractCegarLoop]: Abstraction has has 264 places, 261 transitions, 566 flow [2023-11-29 21:58:16,524 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 265.5) internal successors, (531), 2 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:16,525 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:58:16,525 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 21:58:16,525 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 21:58:16,525 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:58:16,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:58:16,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1383835553, now seen corresponding path program 1 times [2023-11-29 21:58:16,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:58:16,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162928023] [2023-11-29 21:58:16,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:58:16,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:58:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:58:16,812 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-29 21:58:16,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:58:16,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162928023] [2023-11-29 21:58:16,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162928023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:58:16,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:58:16,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 21:58:16,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873170823] [2023-11-29 21:58:16,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:58:16,816 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 21:58:16,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:58:16,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 21:58:16,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 21:58:16,819 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 292 [2023-11-29 21:58:16,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 261 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:16,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:58:16,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 292 [2023-11-29 21:58:16,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:58:16,923 INFO L124 PetriNetUnfolderBase]: 121/596 cut-off events. [2023-11-29 21:58:16,923 INFO L125 PetriNetUnfolderBase]: For 125/197 co-relation queries the response was YES. [2023-11-29 21:58:16,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 596 events. 121/596 cut-off events. For 125/197 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2086 event pairs, 28 based on Foata normal form. 8/539 useless extension candidates. Maximal degree in co-relation 667. Up to 163 conditions per place. [2023-11-29 21:58:16,928 INFO L140 encePairwiseOnDemand]: 289/292 looper letters, 22 selfloop transitions, 2 changer transitions 8/268 dead transitions. [2023-11-29 21:58:16,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 268 transitions, 648 flow [2023-11-29 21:58:16,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 21:58:16,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 21:58:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 796 transitions. [2023-11-29 21:58:16,930 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.908675799086758 [2023-11-29 21:58:16,931 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 796 transitions. [2023-11-29 21:58:16,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 796 transitions. [2023-11-29 21:58:16,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:58:16,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 796 transitions. [2023-11-29 21:58:16,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:16,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:16,935 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:16,935 INFO L307 CegarLoopForPetriNet]: 263 programPoint places, 3 predicate places. [2023-11-29 21:58:16,936 INFO L500 AbstractCegarLoop]: Abstraction has has 266 places, 268 transitions, 648 flow [2023-11-29 21:58:16,936 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:16,936 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:58:16,936 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 21:58:16,937 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 21:58:16,937 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:58:16,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:58:16,937 INFO L85 PathProgramCache]: Analyzing trace with hash 778828119, now seen corresponding path program 2 times [2023-11-29 21:58:16,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:58:16,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288685846] [2023-11-29 21:58:16,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:58:16,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:58:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:58:17,184 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-29 21:58:17,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:58:17,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288685846] [2023-11-29 21:58:17,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288685846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:58:17,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:58:17,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 21:58:17,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173217600] [2023-11-29 21:58:17,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:58:17,185 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 21:58:17,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:58:17,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 21:58:17,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 21:58:17,187 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 292 [2023-11-29 21:58:17,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 268 transitions, 648 flow. Second operand has 6 states, 6 states have (on average 220.66666666666666) internal successors, (1324), 6 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:17,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:58:17,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 292 [2023-11-29 21:58:17,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:58:17,379 INFO L124 PetriNetUnfolderBase]: 157/822 cut-off events. [2023-11-29 21:58:17,379 INFO L125 PetriNetUnfolderBase]: For 319/387 co-relation queries the response was YES. [2023-11-29 21:58:17,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 822 events. 157/822 cut-off events. For 319/387 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3053 event pairs, 41 based on Foata normal form. 11/759 useless extension candidates. Maximal degree in co-relation 915. Up to 231 conditions per place. [2023-11-29 21:58:17,383 INFO L140 encePairwiseOnDemand]: 280/292 looper letters, 64 selfloop transitions, 8 changer transitions 48/312 dead transitions. [2023-11-29 21:58:17,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 312 transitions, 989 flow [2023-11-29 21:58:17,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 21:58:17,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 21:58:17,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2024 transitions. [2023-11-29 21:58:17,386 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7701674277016742 [2023-11-29 21:58:17,386 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2024 transitions. [2023-11-29 21:58:17,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2024 transitions. [2023-11-29 21:58:17,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:58:17,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2024 transitions. [2023-11-29 21:58:17,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 224.88888888888889) internal successors, (2024), 9 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:17,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 292.0) internal successors, (2920), 10 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:17,394 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 292.0) internal successors, (2920), 10 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:17,395 INFO L307 CegarLoopForPetriNet]: 263 programPoint places, 11 predicate places. [2023-11-29 21:58:17,395 INFO L500 AbstractCegarLoop]: Abstraction has has 274 places, 312 transitions, 989 flow [2023-11-29 21:58:17,395 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 220.66666666666666) internal successors, (1324), 6 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:17,396 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:58:17,396 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 21:58:17,396 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 21:58:17,396 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:58:17,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:58:17,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1783613858, now seen corresponding path program 1 times [2023-11-29 21:58:17,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:58:17,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188011890] [2023-11-29 21:58:17,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:58:17,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:58:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:58:17,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 21:58:17,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:58:17,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188011890] [2023-11-29 21:58:17,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188011890] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:58:17,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:58:17,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 21:58:17,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923243083] [2023-11-29 21:58:17,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:58:17,550 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 21:58:17,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:58:17,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 21:58:17,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 21:58:17,552 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 292 [2023-11-29 21:58:17,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 312 transitions, 989 flow. Second operand has 6 states, 6 states have (on average 222.33333333333334) internal successors, (1334), 6 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:17,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:58:17,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 292 [2023-11-29 21:58:17,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:58:17,823 INFO L124 PetriNetUnfolderBase]: 176/1180 cut-off events. [2023-11-29 21:58:17,823 INFO L125 PetriNetUnfolderBase]: For 785/845 co-relation queries the response was YES. [2023-11-29 21:58:17,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2520 conditions, 1180 events. 176/1180 cut-off events. For 785/845 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5712 event pairs, 62 based on Foata normal form. 9/1094 useless extension candidates. Maximal degree in co-relation 1413. Up to 282 conditions per place. [2023-11-29 21:58:17,827 INFO L140 encePairwiseOnDemand]: 281/292 looper letters, 67 selfloop transitions, 8 changer transitions 103/371 dead transitions. [2023-11-29 21:58:17,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 371 transitions, 1636 flow [2023-11-29 21:58:17,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 21:58:17,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 21:58:17,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2018 transitions. [2023-11-29 21:58:17,831 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7678843226788432 [2023-11-29 21:58:17,831 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2018 transitions. [2023-11-29 21:58:17,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2018 transitions. [2023-11-29 21:58:17,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:58:17,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2018 transitions. [2023-11-29 21:58:17,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 224.22222222222223) internal successors, (2018), 9 states have internal predecessors, (2018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:17,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 292.0) internal successors, (2920), 10 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:17,839 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 292.0) internal successors, (2920), 10 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:17,840 INFO L307 CegarLoopForPetriNet]: 263 programPoint places, 19 predicate places. [2023-11-29 21:58:17,840 INFO L500 AbstractCegarLoop]: Abstraction has has 282 places, 371 transitions, 1636 flow [2023-11-29 21:58:17,840 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 222.33333333333334) internal successors, (1334), 6 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:17,840 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:58:17,841 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 21:58:17,841 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 21:58:17,841 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:58:17,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:58:17,841 INFO L85 PathProgramCache]: Analyzing trace with hash 187390691, now seen corresponding path program 1 times [2023-11-29 21:58:17,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:58:17,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926205788] [2023-11-29 21:58:17,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:58:17,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:58:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:58:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 21:58:18,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:58:18,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926205788] [2023-11-29 21:58:18,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926205788] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:58:18,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:58:18,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 21:58:18,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820494881] [2023-11-29 21:58:18,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:58:18,055 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 21:58:18,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:58:18,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 21:58:18,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 21:58:18,057 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 292 [2023-11-29 21:58:18,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 371 transitions, 1636 flow. Second operand has 6 states, 6 states have (on average 223.0) internal successors, (1338), 6 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:18,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:58:18,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 292 [2023-11-29 21:58:18,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:58:18,413 INFO L124 PetriNetUnfolderBase]: 323/1931 cut-off events. [2023-11-29 21:58:18,413 INFO L125 PetriNetUnfolderBase]: For 2133/2321 co-relation queries the response was YES. [2023-11-29 21:58:18,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4756 conditions, 1931 events. 323/1931 cut-off events. For 2133/2321 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 12108 event pairs, 103 based on Foata normal form. 30/1816 useless extension candidates. Maximal degree in co-relation 2516. Up to 502 conditions per place. [2023-11-29 21:58:18,420 INFO L140 encePairwiseOnDemand]: 280/292 looper letters, 71 selfloop transitions, 8 changer transitions 162/434 dead transitions. [2023-11-29 21:58:18,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 434 transitions, 2653 flow [2023-11-29 21:58:18,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 21:58:18,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 21:58:18,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2006 transitions. [2023-11-29 21:58:18,424 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7633181126331812 [2023-11-29 21:58:18,424 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2006 transitions. [2023-11-29 21:58:18,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2006 transitions. [2023-11-29 21:58:18,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:58:18,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2006 transitions. [2023-11-29 21:58:18,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 222.88888888888889) internal successors, (2006), 9 states have internal predecessors, (2006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:18,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 292.0) internal successors, (2920), 10 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:18,432 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 292.0) internal successors, (2920), 10 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:18,434 INFO L307 CegarLoopForPetriNet]: 263 programPoint places, 27 predicate places. [2023-11-29 21:58:18,434 INFO L500 AbstractCegarLoop]: Abstraction has has 290 places, 434 transitions, 2653 flow [2023-11-29 21:58:18,434 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 223.0) internal successors, (1338), 6 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:18,434 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:58:18,435 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 21:58:18,435 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 21:58:18,435 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:58:18,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:58:18,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1843840450, now seen corresponding path program 1 times [2023-11-29 21:58:18,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:58:18,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753062704] [2023-11-29 21:58:18,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:58:18,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:58:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:58:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 21:58:18,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:58:18,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753062704] [2023-11-29 21:58:18,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753062704] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:58:18,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:58:18,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 21:58:18,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067323404] [2023-11-29 21:58:18,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:58:18,604 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 21:58:18,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:58:18,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 21:58:18,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 21:58:18,605 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 292 [2023-11-29 21:58:18,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 434 transitions, 2653 flow. Second operand has 5 states, 5 states have (on average 215.2) internal successors, (1076), 5 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:18,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:58:18,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 292 [2023-11-29 21:58:18,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:58:19,072 INFO L124 PetriNetUnfolderBase]: 523/2802 cut-off events. [2023-11-29 21:58:19,073 INFO L125 PetriNetUnfolderBase]: For 6190/6680 co-relation queries the response was YES. [2023-11-29 21:58:19,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7665 conditions, 2802 events. 523/2802 cut-off events. For 6190/6680 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 19541 event pairs, 135 based on Foata normal form. 0/2480 useless extension candidates. Maximal degree in co-relation 3631. Up to 700 conditions per place. [2023-11-29 21:58:19,086 INFO L140 encePairwiseOnDemand]: 279/292 looper letters, 80 selfloop transitions, 3 changer transitions 187/472 dead transitions. [2023-11-29 21:58:19,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 472 transitions, 3457 flow [2023-11-29 21:58:19,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 21:58:19,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 21:58:19,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1509 transitions. [2023-11-29 21:58:19,089 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7382583170254403 [2023-11-29 21:58:19,089 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1509 transitions. [2023-11-29 21:58:19,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1509 transitions. [2023-11-29 21:58:19,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:58:19,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1509 transitions. [2023-11-29 21:58:19,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 215.57142857142858) internal successors, (1509), 7 states have internal predecessors, (1509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:19,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:19,095 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:19,095 INFO L307 CegarLoopForPetriNet]: 263 programPoint places, 33 predicate places. [2023-11-29 21:58:19,096 INFO L500 AbstractCegarLoop]: Abstraction has has 296 places, 472 transitions, 3457 flow [2023-11-29 21:58:19,096 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 215.2) internal successors, (1076), 5 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:19,096 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:58:19,096 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 21:58:19,096 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 21:58:19,097 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:58:19,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:58:19,097 INFO L85 PathProgramCache]: Analyzing trace with hash 456476817, now seen corresponding path program 1 times [2023-11-29 21:58:19,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:58:19,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604795522] [2023-11-29 21:58:19,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:58:19,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:58:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:58:19,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 21:58:19,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:58:19,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604795522] [2023-11-29 21:58:19,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604795522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:58:19,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:58:19,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 21:58:19,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381386248] [2023-11-29 21:58:19,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:58:19,192 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 21:58:19,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:58:19,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 21:58:19,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 21:58:19,193 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 292 [2023-11-29 21:58:19,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 472 transitions, 3457 flow. Second operand has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:19,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:58:19,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 292 [2023-11-29 21:58:19,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:58:19,682 INFO L124 PetriNetUnfolderBase]: 659/3346 cut-off events. [2023-11-29 21:58:19,682 INFO L125 PetriNetUnfolderBase]: For 9786/9786 co-relation queries the response was YES. [2023-11-29 21:58:19,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10316 conditions, 3346 events. 659/3346 cut-off events. For 9786/9786 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 25384 event pairs, 152 based on Foata normal form. 40/2978 useless extension candidates. Maximal degree in co-relation 5140. Up to 807 conditions per place. [2023-11-29 21:58:19,766 INFO L140 encePairwiseOnDemand]: 288/292 looper letters, 46 selfloop transitions, 4 changer transitions 229/525 dead transitions. [2023-11-29 21:58:19,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 525 transitions, 4565 flow [2023-11-29 21:58:19,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 21:58:19,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 21:58:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2023-11-29 21:58:19,768 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9041095890410958 [2023-11-29 21:58:19,768 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 792 transitions. [2023-11-29 21:58:19,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 792 transitions. [2023-11-29 21:58:19,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:58:19,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 792 transitions. [2023-11-29 21:58:19,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:19,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:19,771 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:19,772 INFO L307 CegarLoopForPetriNet]: 263 programPoint places, 35 predicate places. [2023-11-29 21:58:19,772 INFO L500 AbstractCegarLoop]: Abstraction has has 298 places, 525 transitions, 4565 flow [2023-11-29 21:58:19,772 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:19,772 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:58:19,772 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 21:58:19,772 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 21:58:19,772 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:58:19,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:58:19,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1027601093, now seen corresponding path program 2 times [2023-11-29 21:58:19,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:58:19,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485149346] [2023-11-29 21:58:19,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:58:19,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:58:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:58:19,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 21:58:19,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:58:19,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485149346] [2023-11-29 21:58:19,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485149346] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:58:19,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:58:19,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 21:58:19,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317722768] [2023-11-29 21:58:19,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:58:19,834 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 21:58:19,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:58:19,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 21:58:19,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 21:58:19,835 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 292 [2023-11-29 21:58:19,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 525 transitions, 4565 flow. Second operand has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:19,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:58:19,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 292 [2023-11-29 21:58:19,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:58:20,408 INFO L124 PetriNetUnfolderBase]: 943/4142 cut-off events. [2023-11-29 21:58:20,409 INFO L125 PetriNetUnfolderBase]: For 19760/19816 co-relation queries the response was YES. [2023-11-29 21:58:20,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14593 conditions, 4142 events. 943/4142 cut-off events. For 19760/19816 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 33303 event pairs, 147 based on Foata normal form. 0/3626 useless extension candidates. Maximal degree in co-relation 6731. Up to 1039 conditions per place. [2023-11-29 21:58:20,433 INFO L140 encePairwiseOnDemand]: 289/292 looper letters, 61 selfloop transitions, 7 changer transitions 271/587 dead transitions. [2023-11-29 21:58:20,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 587 transitions, 6114 flow [2023-11-29 21:58:20,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 21:58:20,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 21:58:20,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2023-11-29 21:58:20,435 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9041095890410958 [2023-11-29 21:58:20,435 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 792 transitions. [2023-11-29 21:58:20,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 792 transitions. [2023-11-29 21:58:20,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:58:20,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 792 transitions. [2023-11-29 21:58:20,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:20,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:20,438 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:20,438 INFO L307 CegarLoopForPetriNet]: 263 programPoint places, 37 predicate places. [2023-11-29 21:58:20,439 INFO L500 AbstractCegarLoop]: Abstraction has has 300 places, 587 transitions, 6114 flow [2023-11-29 21:58:20,439 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:20,439 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:58:20,439 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 21:58:20,439 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 21:58:20,439 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:58:20,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:58:20,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1707504401, now seen corresponding path program 1 times [2023-11-29 21:58:20,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:58:20,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675019471] [2023-11-29 21:58:20,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:58:20,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:58:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:58:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 21:58:20,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:58:20,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675019471] [2023-11-29 21:58:20,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675019471] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:58:20,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521512841] [2023-11-29 21:58:20,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:58:20,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:58:20,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:58:20,636 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-29 21:58:20,673 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-29 21:58:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:58:20,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 21:58:20,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:58:20,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 8 [2023-11-29 21:58:20,924 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 21:58:20,924 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:58:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 21:58:20,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521512841] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 21:58:20,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 21:58:20,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2023-11-29 21:58:20,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244909806] [2023-11-29 21:58:20,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 21:58:20,966 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 21:58:20,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:58:20,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 21:58:20,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 21:58:20,967 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 292 [2023-11-29 21:58:20,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 587 transitions, 6114 flow. Second operand has 6 states, 6 states have (on average 246.33333333333334) internal successors, (1478), 6 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:20,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:58:20,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 292 [2023-11-29 21:58:20,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:58:23,590 INFO L124 PetriNetUnfolderBase]: 5513/16361 cut-off events. [2023-11-29 21:58:23,590 INFO L125 PetriNetUnfolderBase]: For 113555/114001 co-relation queries the response was YES. [2023-11-29 21:58:23,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62413 conditions, 16361 events. 5513/16361 cut-off events. For 113555/114001 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 163317 event pairs, 642 based on Foata normal form. 0/14829 useless extension candidates. Maximal degree in co-relation 25782. Up to 4128 conditions per place. [2023-11-29 21:58:23,657 INFO L140 encePairwiseOnDemand]: 285/292 looper letters, 174 selfloop transitions, 17 changer transitions 558/978 dead transitions. [2023-11-29 21:58:23,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 978 transitions, 14779 flow [2023-11-29 21:58:23,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 21:58:23,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 21:58:23,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1769 transitions. [2023-11-29 21:58:23,660 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8654598825831703 [2023-11-29 21:58:23,660 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1769 transitions. [2023-11-29 21:58:23,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1769 transitions. [2023-11-29 21:58:23,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:58:23,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1769 transitions. [2023-11-29 21:58:23,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 252.71428571428572) internal successors, (1769), 7 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:23,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:23,667 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:23,667 INFO L307 CegarLoopForPetriNet]: 263 programPoint places, 43 predicate places. [2023-11-29 21:58:23,667 INFO L500 AbstractCegarLoop]: Abstraction has has 306 places, 978 transitions, 14779 flow [2023-11-29 21:58:23,677 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.33333333333334) internal successors, (1478), 6 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:23,677 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:58:23,677 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 21:58:23,683 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-29 21:58:23,883 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:58:23,883 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:58:23,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:58:23,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1898368577, now seen corresponding path program 2 times [2023-11-29 21:58:23,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:58:23,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139383638] [2023-11-29 21:58:23,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:58:23,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:58:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:58:24,214 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 21:58:24,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:58:24,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139383638] [2023-11-29 21:58:24,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139383638] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:58:24,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592718324] [2023-11-29 21:58:24,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 21:58:24,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:58:24,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:58:24,215 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-29 21:58:24,244 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-29 21:58:24,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 21:58:24,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 21:58:24,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 21:58:24,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:58:24,590 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 21:58:24,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:58:24,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2023-11-29 21:58:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 21:58:24,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592718324] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 21:58:24,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 21:58:24,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2023-11-29 21:58:24,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564660963] [2023-11-29 21:58:24,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 21:58:24,865 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 21:58:24,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:58:24,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 21:58:24,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2023-11-29 21:58:24,869 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 292 [2023-11-29 21:58:24,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 978 transitions, 14779 flow. Second operand has 24 states, 24 states have (on average 173.70833333333334) internal successors, (4169), 24 states have internal predecessors, (4169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:24,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:58:24,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 292 [2023-11-29 21:58:24,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:58:33,241 INFO L124 PetriNetUnfolderBase]: 12669/35551 cut-off events. [2023-11-29 21:58:33,242 INFO L125 PetriNetUnfolderBase]: For 230359/233580 co-relation queries the response was YES. [2023-11-29 21:58:33,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160919 conditions, 35551 events. 12669/35551 cut-off events. For 230359/233580 co-relation queries the response was YES. Maximal size of possible extension queue 825. Compared 400089 event pairs, 1716 based on Foata normal form. 296/32761 useless extension candidates. Maximal degree in co-relation 53272. Up to 9800 conditions per place. [2023-11-29 21:58:33,450 INFO L140 encePairwiseOnDemand]: 246/292 looper letters, 307 selfloop transitions, 94 changer transitions 1547/2098 dead transitions. [2023-11-29 21:58:33,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 2098 transitions, 39198 flow [2023-11-29 21:58:33,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-11-29 21:58:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2023-11-29 21:58:33,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 11261 transitions. [2023-11-29 21:58:33,467 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5843192195931922 [2023-11-29 21:58:33,467 INFO L72 ComplementDD]: Start complementDD. Operand 66 states and 11261 transitions. [2023-11-29 21:58:33,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 11261 transitions. [2023-11-29 21:58:33,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:58:33,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 66 states and 11261 transitions. [2023-11-29 21:58:33,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 67 states, 66 states have (on average 170.62121212121212) internal successors, (11261), 66 states have internal predecessors, (11261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:33,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 67 states, 67 states have (on average 292.0) internal successors, (19564), 67 states have internal predecessors, (19564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:33,509 INFO L81 ComplementDD]: Finished complementDD. Result has 67 states, 67 states have (on average 292.0) internal successors, (19564), 67 states have internal predecessors, (19564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:33,510 INFO L307 CegarLoopForPetriNet]: 263 programPoint places, 108 predicate places. [2023-11-29 21:58:33,510 INFO L500 AbstractCegarLoop]: Abstraction has has 371 places, 2098 transitions, 39198 flow [2023-11-29 21:58:33,511 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 173.70833333333334) internal successors, (4169), 24 states have internal predecessors, (4169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:33,511 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:58:33,511 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 21:58:33,517 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-29 21:58:33,716 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 21:58:33,717 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:58:33,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:58:33,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1963487587, now seen corresponding path program 3 times [2023-11-29 21:58:33,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:58:33,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861370033] [2023-11-29 21:58:33,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:58:33,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:58:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:58:34,094 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 21:58:34,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:58:34,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861370033] [2023-11-29 21:58:34,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861370033] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:58:34,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241376983] [2023-11-29 21:58:34,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 21:58:34,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:58:34,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:58:34,095 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 21:58:34,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 21:58:34,241 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 21:58:34,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 21:58:34,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 21:58:34,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:58:34,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-29 21:58:34,608 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 21:58:34,608 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:58:34,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2023-11-29 21:58:35,123 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 21:58:35,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241376983] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 21:58:35,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 21:58:35,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2023-11-29 21:58:35,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251615519] [2023-11-29 21:58:35,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 21:58:35,124 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 21:58:35,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:58:35,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 21:58:35,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2023-11-29 21:58:35,130 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 292 [2023-11-29 21:58:35,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 2098 transitions, 39198 flow. Second operand has 25 states, 25 states have (on average 209.44) internal successors, (5236), 25 states have internal predecessors, (5236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:35,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:58:35,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 292 [2023-11-29 21:58:35,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:58:44,598 INFO L124 PetriNetUnfolderBase]: 11803/35760 cut-off events. [2023-11-29 21:58:44,599 INFO L125 PetriNetUnfolderBase]: For 324346/328688 co-relation queries the response was YES. [2023-11-29 21:58:44,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163241 conditions, 35760 events. 11803/35760 cut-off events. For 324346/328688 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 418082 event pairs, 1309 based on Foata normal form. 1194/33726 useless extension candidates. Maximal degree in co-relation 56562. Up to 9079 conditions per place. [2023-11-29 21:58:44,812 INFO L140 encePairwiseOnDemand]: 270/292 looper letters, 162 selfloop transitions, 21 changer transitions 1860/2244 dead transitions. [2023-11-29 21:58:44,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 2244 transitions, 46441 flow [2023-11-29 21:58:44,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 21:58:44,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-29 21:58:44,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 5320 transitions. [2023-11-29 21:58:44,816 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7287671232876712 [2023-11-29 21:58:44,817 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 5320 transitions. [2023-11-29 21:58:44,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 5320 transitions. [2023-11-29 21:58:44,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:58:44,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 5320 transitions. [2023-11-29 21:58:44,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 212.8) internal successors, (5320), 25 states have internal predecessors, (5320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:44,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 292.0) internal successors, (7592), 26 states have internal predecessors, (7592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:44,832 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 292.0) internal successors, (7592), 26 states have internal predecessors, (7592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:44,832 INFO L307 CegarLoopForPetriNet]: 263 programPoint places, 132 predicate places. [2023-11-29 21:58:44,832 INFO L500 AbstractCegarLoop]: Abstraction has has 395 places, 2244 transitions, 46441 flow [2023-11-29 21:58:44,833 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 209.44) internal successors, (5236), 25 states have internal predecessors, (5236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:44,833 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:58:44,834 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 21:58:44,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 21:58:45,039 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:58:45,040 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:58:45,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:58:45,040 INFO L85 PathProgramCache]: Analyzing trace with hash 2146109286, now seen corresponding path program 4 times [2023-11-29 21:58:45,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:58:45,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495432694] [2023-11-29 21:58:45,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:58:45,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:58:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:58:45,442 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 21:58:45,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:58:45,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495432694] [2023-11-29 21:58:45,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495432694] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:58:45,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104709320] [2023-11-29 21:58:45,443 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 21:58:45,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:58:45,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:58:45,444 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 21:58:45,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 21:58:45,586 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 21:58:45,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 21:58:45,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 21:58:45,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:58:45,599 INFO L378 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-29 21:58:45,616 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 21:58:45,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 21:58:45,865 INFO L349 Elim1Store]: treesize reduction 29, result has 44.2 percent of original size [2023-11-29 21:58:45,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2023-11-29 21:58:45,960 INFO L349 Elim1Store]: treesize reduction 29, result has 44.2 percent of original size [2023-11-29 21:58:45,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2023-11-29 21:58:46,055 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 21:58:46,055 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:58:46,448 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 21:58:46,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 463 treesize of output 423 [2023-11-29 21:58:46,691 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 21:58:46,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104709320] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 21:58:46,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 21:58:46,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 31 [2023-11-29 21:58:46,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177801638] [2023-11-29 21:58:46,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 21:58:46,694 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 21:58:46,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:58:46,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 21:58:46,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=809, Unknown=0, NotChecked=0, Total=930 [2023-11-29 21:58:46,698 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 292 [2023-11-29 21:58:46,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 2244 transitions, 46441 flow. Second operand has 31 states, 31 states have (on average 201.1290322580645) internal successors, (6235), 31 states have internal predecessors, (6235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:58:46,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:58:46,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 292 [2023-11-29 21:58:46,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:59:04,201 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([962] L105-->L109: Formula: (and (= (+ v_~q2_front~0_31 1) v_~q2_front~0_30) (not (= (ite (and (< v_~q2_front~0_31 v_~n2~0_20) (< v_~q2_front~0_31 v_~q2_back~0_38) (<= 0 v_~q2_front~0_31)) 1 0) 0)) (= (select (select |v_#memory_int_101| v_~q2~0.base_29) (+ (* 4 v_~q2_front~0_31) v_~q2~0.offset_29)) |v_thread3Thread1of1ForFork2_~k~0#1_3|)) InVars {~n2~0=v_~n2~0_20, ~q2~0.offset=v_~q2~0.offset_29, #memory_int=|v_#memory_int_101|, ~q2_front~0=v_~q2_front~0_31, ~q2~0.base=v_~q2~0.base_29, ~q2_back~0=v_~q2_back~0_38} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~n2~0=v_~n2~0_20, thread3Thread1of1ForFork2_#t~post15#1=|v_thread3Thread1of1ForFork2_#t~post15#1_1|, ~q2~0.offset=v_~q2~0.offset_29, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_101|, ~q2_front~0=v_~q2_front~0_30, ~q2~0.base=v_~q2~0.base_29, thread3Thread1of1ForFork2_#t~mem14#1=|v_thread3Thread1of1ForFork2_#t~mem14#1_1|, ~q2_back~0=v_~q2_back~0_38, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~post15#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~mem14#1, thread3Thread1of1ForFork2_~k~0#1][2625], [350#true, 6909#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 283#true, 304#true, 134#L109true, 321#true, 119#L150-4true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, 207#L82-2true, 280#true, 356#(< |thread1Thread1of1ForFork0_~i~0#1| ~N~0), 340#(= ~r~0 0), 222#L53true, 3615#true, 358#true, 287#true, 3559#(and (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1))]) [2023-11-29 21:59:04,201 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2023-11-29 21:59:04,201 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2023-11-29 21:59:04,201 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2023-11-29 21:59:04,201 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2023-11-29 21:59:05,151 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([962] L105-->L109: Formula: (and (= (+ v_~q2_front~0_31 1) v_~q2_front~0_30) (not (= (ite (and (< v_~q2_front~0_31 v_~n2~0_20) (< v_~q2_front~0_31 v_~q2_back~0_38) (<= 0 v_~q2_front~0_31)) 1 0) 0)) (= (select (select |v_#memory_int_101| v_~q2~0.base_29) (+ (* 4 v_~q2_front~0_31) v_~q2~0.offset_29)) |v_thread3Thread1of1ForFork2_~k~0#1_3|)) InVars {~n2~0=v_~n2~0_20, ~q2~0.offset=v_~q2~0.offset_29, #memory_int=|v_#memory_int_101|, ~q2_front~0=v_~q2_front~0_31, ~q2~0.base=v_~q2~0.base_29, ~q2_back~0=v_~q2_back~0_38} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~n2~0=v_~n2~0_20, thread3Thread1of1ForFork2_#t~post15#1=|v_thread3Thread1of1ForFork2_#t~post15#1_1|, ~q2~0.offset=v_~q2~0.offset_29, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_101|, ~q2_front~0=v_~q2_front~0_30, ~q2~0.base=v_~q2~0.base_29, thread3Thread1of1ForFork2_#t~mem14#1=|v_thread3Thread1of1ForFork2_#t~mem14#1_1|, ~q2_back~0=v_~q2_back~0_38, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~post15#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~q2_front~0, thread3Thread1of1ForFork2_#t~mem14#1, thread3Thread1of1ForFork2_~k~0#1][2625], [350#true, 6909#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 283#true, 304#true, 134#L109true, 321#true, 177#L151-1true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, 207#L82-2true, 356#(< |thread1Thread1of1ForFork0_~i~0#1| ~N~0), 280#true, 340#(= ~r~0 0), 3615#true, 222#L53true, 3559#(and (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 287#true, 358#true]) [2023-11-29 21:59:05,151 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2023-11-29 21:59:05,152 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2023-11-29 21:59:05,152 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2023-11-29 21:59:05,152 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2023-11-29 21:59:09,401 INFO L124 PetriNetUnfolderBase]: 30272/72638 cut-off events. [2023-11-29 21:59:09,401 INFO L125 PetriNetUnfolderBase]: For 666288/692162 co-relation queries the response was YES. [2023-11-29 21:59:10,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357878 conditions, 72638 events. 30272/72638 cut-off events. For 666288/692162 co-relation queries the response was YES. Maximal size of possible extension queue 1459. Compared 847440 event pairs, 3095 based on Foata normal form. 979/67825 useless extension candidates. Maximal degree in co-relation 109493. Up to 17590 conditions per place. [2023-11-29 21:59:10,105 INFO L140 encePairwiseOnDemand]: 259/292 looper letters, 0 selfloop transitions, 0 changer transitions 3354/3354 dead transitions. [2023-11-29 21:59:10,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 3354 transitions, 74279 flow [2023-11-29 21:59:10,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-29 21:59:10,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-11-29 21:59:10,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 7902 transitions. [2023-11-29 21:59:10,111 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6938883034773445 [2023-11-29 21:59:10,111 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 7902 transitions. [2023-11-29 21:59:10,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 7902 transitions. [2023-11-29 21:59:10,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:59:10,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 7902 transitions. [2023-11-29 21:59:10,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 202.6153846153846) internal successors, (7902), 39 states have internal predecessors, (7902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:59:10,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 292.0) internal successors, (11680), 40 states have internal predecessors, (11680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:59:10,130 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 292.0) internal successors, (11680), 40 states have internal predecessors, (11680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:59:10,131 INFO L307 CegarLoopForPetriNet]: 263 programPoint places, 165 predicate places. [2023-11-29 21:59:10,131 INFO L500 AbstractCegarLoop]: Abstraction has has 428 places, 3354 transitions, 74279 flow [2023-11-29 21:59:10,132 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 201.1290322580645) internal successors, (6235), 31 states have internal predecessors, (6235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:59:10,144 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/popl20-bad-ring-nondet.wvr.c_BEv2_AllErrorsAtOnce [2023-11-29 21:59:10,240 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-29 21:59:10,240 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-29 21:59:10,240 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-29 21:59:10,240 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-29 21:59:10,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-29 21:59:10,445 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:59:10,446 INFO L457 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1] [2023-11-29 21:59:10,449 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 21:59:10,449 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 21:59:10,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 09:59:10 BasicIcfg [2023-11-29 21:59:10,454 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 21:59:10,454 INFO L158 Benchmark]: Toolchain (without parser) took 55627.84ms. Allocated memory was 377.5MB in the beginning and 7.4GB in the end (delta: 7.0GB). Free memory was 329.8MB in the beginning and 5.5GB in the end (delta: -5.2GB). Peak memory consumption was 2.8GB. Max. memory is 16.0GB. [2023-11-29 21:59:10,455 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 377.5MB. Free memory is still 333.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-29 21:59:10,457 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.61ms. Allocated memory is still 377.5MB. Free memory was 329.8MB in the beginning and 316.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-29 21:59:10,457 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.05ms. Allocated memory is still 377.5MB. Free memory was 316.9MB in the beginning and 313.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 21:59:10,457 INFO L158 Benchmark]: Boogie Preprocessor took 23.19ms. Allocated memory is still 377.5MB. Free memory was 313.9MB in the beginning and 311.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 21:59:10,457 INFO L158 Benchmark]: RCFGBuilder took 589.98ms. Allocated memory was 377.5MB in the beginning and 471.9MB in the end (delta: 94.4MB). Free memory was 311.9MB in the beginning and 428.7MB in the end (delta: -116.8MB). Peak memory consumption was 41.3MB. Max. memory is 16.0GB. [2023-11-29 21:59:10,458 INFO L158 Benchmark]: TraceAbstraction took 54747.77ms. Allocated memory was 471.9MB in the beginning and 7.4GB in the end (delta: 6.9GB). Free memory was 427.7MB in the beginning and 5.5GB in the end (delta: -5.1GB). Peak memory consumption was 2.8GB. Max. memory is 16.0GB. [2023-11-29 21:59:10,459 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.10ms. Allocated memory is still 377.5MB. Free memory is still 333.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 229.61ms. Allocated memory is still 377.5MB. Free memory was 329.8MB in the beginning and 316.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 32.05ms. Allocated memory is still 377.5MB. Free memory was 316.9MB in the beginning and 313.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 23.19ms. Allocated memory is still 377.5MB. Free memory was 313.9MB in the beginning and 311.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 589.98ms. Allocated memory was 377.5MB in the beginning and 471.9MB in the end (delta: 94.4MB). Free memory was 311.9MB in the beginning and 428.7MB in the end (delta: -116.8MB). Peak memory consumption was 41.3MB. Max. memory is 16.0GB. * TraceAbstraction took 54747.77ms. Allocated memory was 471.9MB in the beginning and 7.4GB in the end (delta: 6.9GB). Free memory was 427.7MB in the beginning and 5.5GB in the end (delta: -5.1GB). Peak memory consumption was 2.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 156]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 318 locations, 4 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: 54.6s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 47.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1921 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1921 mSDsluCounter, 2408 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2049 mSDsCounter, 159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5062 IncrementalHoareTripleChecker+Invalid, 5221 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 159 mSolverCounterUnsat, 359 mSDtfsCounter, 5062 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2296 GetRequests, 2061 SyntacticMatches, 2 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3457 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74279occurred in iteration=12, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 3868 NumberOfCodeBlocks, 3820 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4892 ConstructedInterpolants, 13 QuantifiedInterpolants, 15340 SizeOfPredicates, 47 NumberOfNonLiveVariables, 2157 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 20 InterpolantComputations, 8 PerfectInterpolantSequences, 187/233 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-29 21:59:10,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...