/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/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-29 18:49:48,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 18:49:48,835 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 18:49:48,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 18:49:48,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 18:49:48,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 18:49:48,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 18:49:48,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 18:49:48,861 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 18:49:48,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 18:49:48,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 18:49:48,865 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 18:49:48,865 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 18:49:48,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 18:49:48,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 18:49:48,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 18:49:48,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 18:49:48,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 18:49:48,866 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 18:49:48,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 18:49:48,867 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 18:49:48,867 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 18:49:48,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 18:49:48,868 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-29 18:49:48,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 18:49:48,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 18:49:48,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 18:49:48,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 18:49:48,869 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 18:49:48,869 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 18:49:48,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 18:49:48,870 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 18:49:48,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 18:49:48,870 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 18:49:49,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 18:49:49,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 18:49:49,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 18:49:49,069 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 18:49:49,070 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 18:49:49,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2023-11-29 18:49:50,021 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 18:49:50,248 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 18:49:50,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2023-11-29 18:49:50,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcb125a86/a2cd11c481f642f59c25b598b9980f75/FLAG2e7573c40 [2023-11-29 18:49:50,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcb125a86/a2cd11c481f642f59c25b598b9980f75 [2023-11-29 18:49:50,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 18:49:50,274 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-29 18:49:50,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 18:49:50,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 18:49:50,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 18:49:50,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:49:50" (1/1) ... [2023-11-29 18:49:50,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c42aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:49:50, skipping insertion in model container [2023-11-29 18:49:50,281 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:49:50" (1/1) ... [2023-11-29 18:49:50,317 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 18:49:50,600 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2023-11-29 18:49:50,606 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2023-11-29 18:49:50,613 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 18:49:50,620 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 18:49:50,660 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2023-11-29 18:49:50,662 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2023-11-29 18:49:50,664 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 18:49:50,710 INFO L206 MainTranslator]: Completed translation [2023-11-29 18:49:50,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:49:50 WrapperNode [2023-11-29 18:49:50,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 18:49:50,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 18:49:50,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 18:49:50,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 18:49:50,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:49:50" (1/1) ... [2023-11-29 18:49:50,727 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:49:50" (1/1) ... [2023-11-29 18:49:50,746 INFO L138 Inliner]: procedures = 275, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 208 [2023-11-29 18:49:50,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 18:49:50,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 18:49:50,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 18:49:50,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 18:49:50,754 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:49:50" (1/1) ... [2023-11-29 18:49:50,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:49:50" (1/1) ... [2023-11-29 18:49:50,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:49:50" (1/1) ... [2023-11-29 18:49:50,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:49:50" (1/1) ... [2023-11-29 18:49:50,764 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:49:50" (1/1) ... [2023-11-29 18:49:50,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:49:50" (1/1) ... [2023-11-29 18:49:50,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:49:50" (1/1) ... [2023-11-29 18:49:50,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:49:50" (1/1) ... [2023-11-29 18:49:50,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 18:49:50,793 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 18:49:50,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 18:49:50,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 18:49:50,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:49:50" (1/1) ... [2023-11-29 18:49:50,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 18:49:50,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 18:49:50,832 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 18:49:50,854 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 18:49:50,870 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-29 18:49:50,870 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-29 18:49:50,870 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-29 18:49:50,870 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-29 18:49:50,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 18:49:50,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 18:49:50,871 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-29 18:49:50,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 18:49:50,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 18:49:50,871 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-29 18:49:50,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 18:49:50,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 18:49:50,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 18:49:50,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 18:49:50,873 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 18:49:51,015 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 18:49:51,017 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 18:49:51,316 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 18:49:51,330 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 18:49:51,330 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 18:49:51,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:49:51 BoogieIcfgContainer [2023-11-29 18:49:51,331 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 18:49:51,336 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 18:49:51,336 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 18:49:51,338 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 18:49:51,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:49:50" (1/3) ... [2023-11-29 18:49:51,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60078f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:49:51, skipping insertion in model container [2023-11-29 18:49:51,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:49:50" (2/3) ... [2023-11-29 18:49:51,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60078f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:49:51, skipping insertion in model container [2023-11-29 18:49:51,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:49:51" (3/3) ... [2023-11-29 18:49:51,341 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-11-29 18:49:51,352 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 18:49:51,352 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 18:49:51,352 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 18:49:51,424 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 18:49:51,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 228 transitions, 470 flow [2023-11-29 18:49:51,540 INFO L124 PetriNetUnfolderBase]: 13/226 cut-off events. [2023-11-29 18:49:51,541 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 18:49:51,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 226 events. 13/226 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 375 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 149. Up to 3 conditions per place. [2023-11-29 18:49:51,547 INFO L82 GeneralOperation]: Start removeDead. Operand has 222 places, 228 transitions, 470 flow [2023-11-29 18:49:51,557 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 216 transitions, 441 flow [2023-11-29 18:49:51,570 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 18:49:51,574 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;@6b10c95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 18:49:51,575 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-29 18:49:51,588 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 18:49:51,588 INFO L124 PetriNetUnfolderBase]: 1/58 cut-off events. [2023-11-29 18:49:51,588 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 18:49:51,588 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 18:49:51,589 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] [2023-11-29 18:49:51,589 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 2 more)] === [2023-11-29 18:49:51,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 18:49:51,592 INFO L85 PathProgramCache]: Analyzing trace with hash -484014062, now seen corresponding path program 1 times [2023-11-29 18:49:51,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 18:49:51,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606915723] [2023-11-29 18:49:51,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 18:49:51,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 18:49:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 18:49:51,809 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 18:49:51,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 18:49:51,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606915723] [2023-11-29 18:49:51,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606915723] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 18:49:51,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 18:49:51,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 18:49:51,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537183981] [2023-11-29 18:49:51,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 18:49:51,817 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 18:49:51,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 18:49:51,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 18:49:51,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 18:49:51,846 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 228 [2023-11-29 18:49:51,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 216 transitions, 441 flow. Second operand has 2 states, 2 states have (on average 213.5) internal successors, (427), 2 states have internal predecessors, (427), 0 states have call successors, (0), 0 states 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 18:49:51,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 18:49:51,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 228 [2023-11-29 18:49:51,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 18:49:51,939 INFO L124 PetriNetUnfolderBase]: 26/374 cut-off events. [2023-11-29 18:49:51,940 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-29 18:49:51,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 374 events. 26/374 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1274 event pairs, 8 based on Foata normal form. 10/364 useless extension candidates. Maximal degree in co-relation 325. Up to 24 conditions per place. [2023-11-29 18:49:51,944 INFO L140 encePairwiseOnDemand]: 224/228 looper letters, 7 selfloop transitions, 0 changer transitions 3/207 dead transitions. [2023-11-29 18:49:51,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 207 transitions, 437 flow [2023-11-29 18:49:51,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 18:49:51,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 18:49:51,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 437 transitions. [2023-11-29 18:49:51,953 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9583333333333334 [2023-11-29 18:49:51,953 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 437 transitions. [2023-11-29 18:49:51,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 437 transitions. [2023-11-29 18:49:51,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 18:49:51,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 437 transitions. [2023-11-29 18:49:51,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 218.5) internal successors, (437), 2 states have internal predecessors, (437), 0 states have call successors, (0), 0 states 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 18:49:51,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states 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 18:49:51,964 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states 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 18:49:51,966 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, -4 predicate places. [2023-11-29 18:49:51,966 INFO L500 AbstractCegarLoop]: Abstraction has has 206 places, 207 transitions, 437 flow [2023-11-29 18:49:51,967 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 213.5) internal successors, (427), 2 states have internal predecessors, (427), 0 states have call successors, (0), 0 states 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 18:49:51,967 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 18:49:51,967 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] [2023-11-29 18:49:51,967 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 18:49:51,967 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 18:49:51,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 18:49:51,968 INFO L85 PathProgramCache]: Analyzing trace with hash 559808428, now seen corresponding path program 1 times [2023-11-29 18:49:51,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 18:49:51,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158662857] [2023-11-29 18:49:51,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 18:49:51,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 18:49:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 18:49:52,793 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 18:49:52,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 18:49:52,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158662857] [2023-11-29 18:49:52,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158662857] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 18:49:52,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 18:49:52,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 18:49:52,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267323642] [2023-11-29 18:49:52,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 18:49:52,795 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 18:49:52,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 18:49:52,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 18:49:52,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-29 18:49:52,799 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 228 [2023-11-29 18:49:52,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 207 transitions, 437 flow. Second operand has 12 states, 12 states have (on average 158.66666666666666) internal successors, (1904), 12 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states 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 18:49:52,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 18:49:52,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 228 [2023-11-29 18:49:52,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 18:49:53,365 INFO L124 PetriNetUnfolderBase]: 841/3185 cut-off events. [2023-11-29 18:49:53,365 INFO L125 PetriNetUnfolderBase]: For 287/289 co-relation queries the response was YES. [2023-11-29 18:49:53,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4677 conditions, 3185 events. 841/3185 cut-off events. For 287/289 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 25285 event pairs, 621 based on Foata normal form. 0/2968 useless extension candidates. Maximal degree in co-relation 4301. Up to 1207 conditions per place. [2023-11-29 18:49:53,384 INFO L140 encePairwiseOnDemand]: 211/228 looper letters, 46 selfloop transitions, 16 changer transitions 0/203 dead transitions. [2023-11-29 18:49:53,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 203 transitions, 553 flow [2023-11-29 18:49:53,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 18:49:53,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 18:49:53,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1923 transitions. [2023-11-29 18:49:53,389 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7028508771929824 [2023-11-29 18:49:53,389 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1923 transitions. [2023-11-29 18:49:53,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1923 transitions. [2023-11-29 18:49:53,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 18:49:53,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1923 transitions. [2023-11-29 18:49:53,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 160.25) internal successors, (1923), 12 states have internal predecessors, (1923), 0 states have call successors, (0), 0 states 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 18:49:53,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 228.0) internal successors, (2964), 13 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states 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 18:49:53,399 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 228.0) internal successors, (2964), 13 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states 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 18:49:53,400 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, 4 predicate places. [2023-11-29 18:49:53,400 INFO L500 AbstractCegarLoop]: Abstraction has has 214 places, 203 transitions, 553 flow [2023-11-29 18:49:53,401 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 158.66666666666666) internal successors, (1904), 12 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states 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 18:49:53,401 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 18:49:53,401 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] [2023-11-29 18:49:53,402 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 18:49:53,402 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 18:49:53,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 18:49:53,403 INFO L85 PathProgramCache]: Analyzing trace with hash 348938573, now seen corresponding path program 1 times [2023-11-29 18:49:53,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 18:49:53,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328716188] [2023-11-29 18:49:53,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 18:49:53,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 18:49:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 18:49:53,539 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 18:49:53,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 18:49:53,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328716188] [2023-11-29 18:49:53,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328716188] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 18:49:53,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 18:49:53,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 18:49:53,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387884836] [2023-11-29 18:49:53,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 18:49:53,541 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 18:49:53,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 18:49:53,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 18:49:53,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 18:49:53,544 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 228 [2023-11-29 18:49:53,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 203 transitions, 553 flow. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states 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 18:49:53,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 18:49:53,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 228 [2023-11-29 18:49:53,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 18:49:53,708 INFO L124 PetriNetUnfolderBase]: 306/1259 cut-off events. [2023-11-29 18:49:53,708 INFO L125 PetriNetUnfolderBase]: For 747/783 co-relation queries the response was YES. [2023-11-29 18:49:53,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2268 conditions, 1259 events. 306/1259 cut-off events. For 747/783 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7494 event pairs, 222 based on Foata normal form. 0/1167 useless extension candidates. Maximal degree in co-relation 1781. Up to 485 conditions per place. [2023-11-29 18:49:53,714 INFO L140 encePairwiseOnDemand]: 224/228 looper letters, 12 selfloop transitions, 2 changer transitions 9/209 dead transitions. [2023-11-29 18:49:53,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 209 transitions, 629 flow [2023-11-29 18:49:53,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 18:49:53,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 18:49:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 641 transitions. [2023-11-29 18:49:53,716 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9371345029239766 [2023-11-29 18:49:53,716 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 641 transitions. [2023-11-29 18:49:53,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 641 transitions. [2023-11-29 18:49:53,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 18:49:53,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 641 transitions. [2023-11-29 18:49:53,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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 18:49:53,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states 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 18:49:53,719 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states 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 18:49:53,720 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, 6 predicate places. [2023-11-29 18:49:53,720 INFO L500 AbstractCegarLoop]: Abstraction has has 216 places, 209 transitions, 629 flow [2023-11-29 18:49:53,720 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states 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 18:49:53,720 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 18:49:53,720 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] [2023-11-29 18:49:53,721 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 18:49:53,721 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 18:49:53,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 18:49:53,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1606788658, now seen corresponding path program 1 times [2023-11-29 18:49:53,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 18:49:53,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585567730] [2023-11-29 18:49:53,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 18:49:53,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 18:49:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 18:49:53,789 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 18:49:53,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 18:49:53,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585567730] [2023-11-29 18:49:53,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585567730] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 18:49:53,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 18:49:53,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 18:49:53,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032154031] [2023-11-29 18:49:53,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 18:49:53,794 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 18:49:53,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 18:49:53,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 18:49:53,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 18:49:53,796 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 228 [2023-11-29 18:49:53,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 209 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states 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 18:49:53,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 18:49:53,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 228 [2023-11-29 18:49:53,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 18:49:54,007 INFO L124 PetriNetUnfolderBase]: 447/1756 cut-off events. [2023-11-29 18:49:54,008 INFO L125 PetriNetUnfolderBase]: For 2178/2255 co-relation queries the response was YES. [2023-11-29 18:49:54,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3594 conditions, 1756 events. 447/1756 cut-off events. For 2178/2255 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 10388 event pairs, 294 based on Foata normal form. 2/1669 useless extension candidates. Maximal degree in co-relation 3089. Up to 702 conditions per place. [2023-11-29 18:49:54,013 INFO L140 encePairwiseOnDemand]: 225/228 looper letters, 21 selfloop transitions, 2 changer transitions 6/216 dead transitions. [2023-11-29 18:49:54,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 216 transitions, 718 flow [2023-11-29 18:49:54,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 18:49:54,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 18:49:54,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 640 transitions. [2023-11-29 18:49:54,015 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.935672514619883 [2023-11-29 18:49:54,015 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 640 transitions. [2023-11-29 18:49:54,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 640 transitions. [2023-11-29 18:49:54,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 18:49:54,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 640 transitions. [2023-11-29 18:49:54,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states 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 18:49:54,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states 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 18:49:54,018 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states 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 18:49:54,020 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, 8 predicate places. [2023-11-29 18:49:54,020 INFO L500 AbstractCegarLoop]: Abstraction has has 218 places, 216 transitions, 718 flow [2023-11-29 18:49:54,020 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states 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 18:49:54,020 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 18:49:54,021 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] [2023-11-29 18:49:54,021 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 18:49:54,021 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 18:49:54,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 18:49:54,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1287457348, now seen corresponding path program 1 times [2023-11-29 18:49:54,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 18:49:54,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892530605] [2023-11-29 18:49:54,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 18:49:54,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 18:49:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 18:49:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 18:49:54,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 18:49:54,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892530605] [2023-11-29 18:49:54,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892530605] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 18:49:54,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038381492] [2023-11-29 18:49:54,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 18:49:54,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 18:49:54,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 18:49:54,142 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 18:49:54,199 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 18:49:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 18:49:54,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 18:49:54,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 18:49:54,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 18:49:54,386 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 18:49:54,387 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 18:49:54,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038381492] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 18:49:54,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 18:49:54,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-29 18:49:54,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779022630] [2023-11-29 18:49:54,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 18:49:54,387 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 18:49:54,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 18:49:54,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 18:49:54,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 18:49:54,389 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 228 [2023-11-29 18:49:54,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 216 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 18:49:54,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 18:49:54,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 228 [2023-11-29 18:49:54,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 18:49:54,488 INFO L124 PetriNetUnfolderBase]: 201/1116 cut-off events. [2023-11-29 18:49:54,488 INFO L125 PetriNetUnfolderBase]: For 1887/1912 co-relation queries the response was YES. [2023-11-29 18:49:54,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2124 conditions, 1116 events. 201/1116 cut-off events. For 1887/1912 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5780 event pairs, 111 based on Foata normal form. 62/1125 useless extension candidates. Maximal degree in co-relation 1578. Up to 383 conditions per place. [2023-11-29 18:49:54,493 INFO L140 encePairwiseOnDemand]: 224/228 looper letters, 15 selfloop transitions, 3 changer transitions 10/218 dead transitions. [2023-11-29 18:49:54,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 218 transitions, 798 flow [2023-11-29 18:49:54,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 18:49:54,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 18:49:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2023-11-29 18:49:54,494 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9298245614035088 [2023-11-29 18:49:54,494 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 636 transitions. [2023-11-29 18:49:54,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 636 transitions. [2023-11-29 18:49:54,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 18:49:54,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 636 transitions. [2023-11-29 18:49:54,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states 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 18:49:54,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states 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 18:49:54,497 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states 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 18:49:54,501 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, 10 predicate places. [2023-11-29 18:49:54,501 INFO L500 AbstractCegarLoop]: Abstraction has has 220 places, 218 transitions, 798 flow [2023-11-29 18:49:54,502 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 18:49:54,502 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 18:49:54,502 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] [2023-11-29 18:49:54,517 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 18:49:54,707 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 18:49:54,707 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 18:49:54,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 18:49:54,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1206536814, now seen corresponding path program 1 times [2023-11-29 18:49:54,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 18:49:54,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155285034] [2023-11-29 18:49:54,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 18:49:54,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 18:49:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 18:49:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 18:49:54,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 18:49:54,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155285034] [2023-11-29 18:49:54,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155285034] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 18:49:54,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636752739] [2023-11-29 18:49:54,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 18:49:54,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 18:49:54,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 18:49:54,827 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 18:49:54,857 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 18:49:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 18:49:54,966 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 18:49:54,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 18:49:55,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 18:49:55,015 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 18:49:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 18:49:55,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636752739] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 18:49:55,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 18:49:55,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-29 18:49:55,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493753842] [2023-11-29 18:49:55,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 18:49:55,062 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 18:49:55,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 18:49:55,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 18:49:55,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-29 18:49:55,064 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 228 [2023-11-29 18:49:55,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 218 transitions, 798 flow. Second operand has 10 states, 10 states have (on average 207.5) internal successors, (2075), 10 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states 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 18:49:55,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 18:49:55,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 228 [2023-11-29 18:49:55,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 18:49:55,274 INFO L124 PetriNetUnfolderBase]: 254/1403 cut-off events. [2023-11-29 18:49:55,274 INFO L125 PetriNetUnfolderBase]: For 2153/2196 co-relation queries the response was YES. [2023-11-29 18:49:55,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2877 conditions, 1403 events. 254/1403 cut-off events. For 2153/2196 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 6417 event pairs, 154 based on Foata normal form. 1/1344 useless extension candidates. Maximal degree in co-relation 2306. Up to 491 conditions per place. [2023-11-29 18:49:55,279 INFO L140 encePairwiseOnDemand]: 222/228 looper letters, 27 selfloop transitions, 9 changer transitions 10/231 dead transitions. [2023-11-29 18:49:55,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 231 transitions, 998 flow [2023-11-29 18:49:55,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 18:49:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 18:49:55,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1880 transitions. [2023-11-29 18:49:55,282 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9161793372319688 [2023-11-29 18:49:55,282 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1880 transitions. [2023-11-29 18:49:55,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1880 transitions. [2023-11-29 18:49:55,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 18:49:55,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1880 transitions. [2023-11-29 18:49:55,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 208.88888888888889) internal successors, (1880), 9 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states 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 18:49:55,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 228.0) internal successors, (2280), 10 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states 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 18:49:55,288 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 228.0) internal successors, (2280), 10 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states 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 18:49:55,288 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, 18 predicate places. [2023-11-29 18:49:55,288 INFO L500 AbstractCegarLoop]: Abstraction has has 228 places, 231 transitions, 998 flow [2023-11-29 18:49:55,289 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 207.5) internal successors, (2075), 10 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states 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 18:49:55,289 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 18:49:55,289 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:49:55,304 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 18:49:55,494 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,SelfDestructingSolverStorable5 [2023-11-29 18:49:55,494 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 18:49:55,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 18:49:55,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1536100156, now seen corresponding path program 2 times [2023-11-29 18:49:55,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 18:49:55,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263392120] [2023-11-29 18:49:55,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 18:49:55,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 18:49:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 18:49:55,688 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 18:49:55,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 18:49:55,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263392120] [2023-11-29 18:49:55,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263392120] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 18:49:55,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686412638] [2023-11-29 18:49:55,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 18:49:55,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 18:49:55,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 18:49:55,705 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 18:49:55,720 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 18:49:55,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 18:49:55,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 18:49:55,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 18:49:55,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 18:49:55,986 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 18:49:55,986 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 18:49:56,113 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 18:49:56,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686412638] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 18:49:56,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 18:49:56,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-11-29 18:49:56,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002151713] [2023-11-29 18:49:56,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 18:49:56,114 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 18:49:56,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 18:49:56,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 18:49:56,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-11-29 18:49:56,117 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 228 [2023-11-29 18:49:56,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 231 transitions, 998 flow. Second operand has 18 states, 18 states have (on average 207.5) internal successors, (3735), 18 states have internal predecessors, (3735), 0 states have call successors, (0), 0 states 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 18:49:56,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 18:49:56,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 228 [2023-11-29 18:49:56,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 18:49:56,531 INFO L124 PetriNetUnfolderBase]: 454/2521 cut-off events. [2023-11-29 18:49:56,532 INFO L125 PetriNetUnfolderBase]: For 4237/4297 co-relation queries the response was YES. [2023-11-29 18:49:56,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5426 conditions, 2521 events. 454/2521 cut-off events. For 4237/4297 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 11982 event pairs, 261 based on Foata normal form. 1/2439 useless extension candidates. Maximal degree in co-relation 4814. Up to 906 conditions per place. [2023-11-29 18:49:56,540 INFO L140 encePairwiseOnDemand]: 222/228 looper letters, 51 selfloop transitions, 21 changer transitions 10/267 dead transitions. [2023-11-29 18:49:56,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 267 transitions, 1546 flow [2023-11-29 18:49:56,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 18:49:56,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-29 18:49:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4374 transitions. [2023-11-29 18:49:56,546 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9135338345864662 [2023-11-29 18:49:56,546 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4374 transitions. [2023-11-29 18:49:56,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4374 transitions. [2023-11-29 18:49:56,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 18:49:56,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4374 transitions. [2023-11-29 18:49:56,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 208.28571428571428) internal successors, (4374), 21 states have internal predecessors, (4374), 0 states have call successors, (0), 0 states 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 18:49:56,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 228.0) internal successors, (5016), 22 states have internal predecessors, (5016), 0 states have call successors, (0), 0 states 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 18:49:56,560 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 228.0) internal successors, (5016), 22 states have internal predecessors, (5016), 0 states have call successors, (0), 0 states 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 18:49:56,561 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, 38 predicate places. [2023-11-29 18:49:56,561 INFO L500 AbstractCegarLoop]: Abstraction has has 248 places, 267 transitions, 1546 flow [2023-11-29 18:49:56,562 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 207.5) internal successors, (3735), 18 states have internal predecessors, (3735), 0 states have call successors, (0), 0 states 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 18:49:56,562 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 18:49:56,562 INFO L232 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:49:56,576 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 18:49:56,767 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 18:49:56,768 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 18:49:56,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 18:49:56,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1357434690, now seen corresponding path program 3 times [2023-11-29 18:49:56,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 18:49:56,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015419493] [2023-11-29 18:49:56,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 18:49:56,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 18:49:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 18:49:57,202 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 679 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 18:49:57,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 18:49:57,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015419493] [2023-11-29 18:49:57,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015419493] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 18:49:57,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804294893] [2023-11-29 18:49:57,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 18:49:57,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 18:49:57,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 18:49:57,203 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 18:49:57,231 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 18:49:57,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 18:49:57,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 18:49:57,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-29 18:49:57,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 18:49:58,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 18:49:58,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 18:49:58,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 18:49:58,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 18:49:58,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-29 18:49:58,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 18:49:58,845 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 329 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2023-11-29 18:49:58,846 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 18:49:58,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804294893] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 18:49:58,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 18:49:58,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 28 [2023-11-29 18:49:58,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074951851] [2023-11-29 18:49:58,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 18:49:58,847 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 18:49:58,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 18:49:58,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 18:49:58,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2023-11-29 18:49:58,849 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 228 [2023-11-29 18:49:58,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 267 transitions, 1546 flow. Second operand has 13 states, 13 states have (on average 161.53846153846155) internal successors, (2100), 13 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states 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 18:49:58,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 18:49:58,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 228 [2023-11-29 18:49:58,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 18:49:59,779 INFO L124 PetriNetUnfolderBase]: 1158/4647 cut-off events. [2023-11-29 18:49:59,779 INFO L125 PetriNetUnfolderBase]: For 12788/12931 co-relation queries the response was YES. [2023-11-29 18:49:59,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13497 conditions, 4647 events. 1158/4647 cut-off events. For 12788/12931 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 27423 event pairs, 96 based on Foata normal form. 1/4532 useless extension candidates. Maximal degree in co-relation 12432. Up to 1983 conditions per place. [2023-11-29 18:49:59,802 INFO L140 encePairwiseOnDemand]: 209/228 looper letters, 187 selfloop transitions, 26 changer transitions 13/386 dead transitions. [2023-11-29 18:49:59,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 386 transitions, 3592 flow [2023-11-29 18:49:59,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 18:49:59,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-29 18:49:59,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2131 transitions. [2023-11-29 18:49:59,806 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7189608636977058 [2023-11-29 18:49:59,806 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2131 transitions. [2023-11-29 18:49:59,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2131 transitions. [2023-11-29 18:49:59,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 18:49:59,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2131 transitions. [2023-11-29 18:49:59,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 163.92307692307693) internal successors, (2131), 13 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states 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 18:49:59,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 228.0) internal successors, (3192), 14 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states 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 18:49:59,825 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 228.0) internal successors, (3192), 14 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states 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 18:49:59,826 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, 50 predicate places. [2023-11-29 18:49:59,826 INFO L500 AbstractCegarLoop]: Abstraction has has 260 places, 386 transitions, 3592 flow [2023-11-29 18:49:59,826 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 161.53846153846155) internal successors, (2100), 13 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states 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 18:49:59,827 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 18:49:59,827 INFO L232 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:49:59,834 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 18:50:00,032 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 18:50:00,032 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 18:50:00,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 18:50:00,033 INFO L85 PathProgramCache]: Analyzing trace with hash 483837613, now seen corresponding path program 1 times [2023-11-29 18:50:00,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 18:50:00,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989967368] [2023-11-29 18:50:00,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 18:50:00,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 18:50:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 18:50:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 0 proven. 667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 18:50:00,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 18:50:00,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989967368] [2023-11-29 18:50:00,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989967368] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 18:50:00,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704327617] [2023-11-29 18:50:00,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 18:50:00,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 18:50:00,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 18:50:00,510 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 18:50:00,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 18:50:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 18:50:00,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 18:50:00,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 18:50:00,922 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 0 proven. 667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 18:50:00,922 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 18:50:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 0 proven. 667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 18:50:01,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704327617] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 18:50:01,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 18:50:01,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2023-11-29 18:50:01,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918134001] [2023-11-29 18:50:01,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 18:50:01,330 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-29 18:50:01,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 18:50:01,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-29 18:50:01,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 18:50:01,335 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 228 [2023-11-29 18:50:01,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 386 transitions, 3592 flow. Second operand has 34 states, 34 states have (on average 207.5) internal successors, (7055), 34 states have internal predecessors, (7055), 0 states have call successors, (0), 0 states 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 18:50:01,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 18:50:01,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 228 [2023-11-29 18:50:01,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 18:50:03,321 INFO L124 PetriNetUnfolderBase]: 2362/9179 cut-off events. [2023-11-29 18:50:03,322 INFO L125 PetriNetUnfolderBase]: For 30173/30369 co-relation queries the response was YES. [2023-11-29 18:50:03,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28434 conditions, 9179 events. 2362/9179 cut-off events. For 30173/30369 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 55043 event pairs, 136 based on Foata normal form. 2/9005 useless extension candidates. Maximal degree in co-relation 27316. Up to 4051 conditions per place. [2023-11-29 18:50:03,376 INFO L140 encePairwiseOnDemand]: 222/228 looper letters, 265 selfloop transitions, 45 changer transitions 13/546 dead transitions. [2023-11-29 18:50:03,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 546 transitions, 7014 flow [2023-11-29 18:50:03,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-29 18:50:03,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-11-29 18:50:03,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 9362 transitions. [2023-11-29 18:50:03,388 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9124756335282651 [2023-11-29 18:50:03,388 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 9362 transitions. [2023-11-29 18:50:03,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 9362 transitions. [2023-11-29 18:50:03,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 18:50:03,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 9362 transitions. [2023-11-29 18:50:03,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 208.04444444444445) internal successors, (9362), 45 states have internal predecessors, (9362), 0 states have call successors, (0), 0 states 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 18:50:03,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 228.0) internal successors, (10488), 46 states have internal predecessors, (10488), 0 states have call successors, (0), 0 states 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 18:50:03,414 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 228.0) internal successors, (10488), 46 states have internal predecessors, (10488), 0 states have call successors, (0), 0 states 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 18:50:03,416 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, 94 predicate places. [2023-11-29 18:50:03,416 INFO L500 AbstractCegarLoop]: Abstraction has has 304 places, 546 transitions, 7014 flow [2023-11-29 18:50:03,417 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 207.5) internal successors, (7055), 34 states have internal predecessors, (7055), 0 states have call successors, (0), 0 states 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 18:50:03,417 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 18:50:03,417 INFO L232 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:50:03,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-29 18:50:03,623 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 18:50:03,623 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 18:50:03,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 18:50:03,624 INFO L85 PathProgramCache]: Analyzing trace with hash -793582591, now seen corresponding path program 2 times [2023-11-29 18:50:03,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 18:50:03,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360839883] [2023-11-29 18:50:03,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 18:50:03,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 18:50:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 18:50:05,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3347 backedges. 0 proven. 3347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 18:50:05,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 18:50:05,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360839883] [2023-11-29 18:50:05,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360839883] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 18:50:05,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393347749] [2023-11-29 18:50:05,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 18:50:05,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 18:50:05,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 18:50:05,056 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 18:50:05,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 18:50:05,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 18:50:05,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 18:50:05,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 1318 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 18:50:05,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 18:50:05,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3347 backedges. 0 proven. 3347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 18:50:05,843 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 18:50:06,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3347 backedges. 0 proven. 3347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 18:50:06,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393347749] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 18:50:06,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 18:50:06,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 43 [2023-11-29 18:50:06,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471950237] [2023-11-29 18:50:06,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 18:50:06,797 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-29 18:50:06,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 18:50:06,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-29 18:50:06,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2023-11-29 18:50:06,803 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 228 [2023-11-29 18:50:06,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 546 transitions, 7014 flow. Second operand has 43 states, 43 states have (on average 207.5581395348837) internal successors, (8925), 43 states have internal predecessors, (8925), 0 states have call successors, (0), 0 states 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 18:50:06,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 18:50:06,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 228 [2023-11-29 18:50:06,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 18:50:09,933 INFO L124 PetriNetUnfolderBase]: 3114/11978 cut-off events. [2023-11-29 18:50:09,933 INFO L125 PetriNetUnfolderBase]: For 47511/47750 co-relation queries the response was YES. [2023-11-29 18:50:09,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39309 conditions, 11978 events. 3114/11978 cut-off events. For 47511/47750 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 71949 event pairs, 176 based on Foata normal form. 1/11763 useless extension candidates. Maximal degree in co-relation 38145. Up to 5346 conditions per place. [2023-11-29 18:50:09,985 INFO L140 encePairwiseOnDemand]: 222/228 looper letters, 349 selfloop transitions, 60 changer transitions 14/646 dead transitions. [2023-11-29 18:50:09,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 646 transitions, 9792 flow [2023-11-29 18:50:09,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-11-29 18:50:09,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2023-11-29 18:50:09,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 12474 transitions. [2023-11-29 18:50:09,996 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9118421052631579 [2023-11-29 18:50:09,996 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 12474 transitions. [2023-11-29 18:50:09,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 12474 transitions. [2023-11-29 18:50:10,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 18:50:10,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 12474 transitions. [2023-11-29 18:50:10,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 207.9) internal successors, (12474), 60 states have internal predecessors, (12474), 0 states have call successors, (0), 0 states 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 18:50:10,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 228.0) internal successors, (13908), 61 states have internal predecessors, (13908), 0 states have call successors, (0), 0 states 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 18:50:10,027 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 228.0) internal successors, (13908), 61 states have internal predecessors, (13908), 0 states have call successors, (0), 0 states 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 18:50:10,028 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, 153 predicate places. [2023-11-29 18:50:10,028 INFO L500 AbstractCegarLoop]: Abstraction has has 363 places, 646 transitions, 9792 flow [2023-11-29 18:50:10,029 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 207.5581395348837) internal successors, (8925), 43 states have internal predecessors, (8925), 0 states have call successors, (0), 0 states 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 18:50:10,029 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 18:50:10,030 INFO L232 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 11, 11, 11, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:50:10,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-29 18:50:10,235 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 18:50:10,236 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 18:50:10,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 18:50:10,237 INFO L85 PathProgramCache]: Analyzing trace with hash -289855929, now seen corresponding path program 3 times [2023-11-29 18:50:10,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 18:50:10,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143073642] [2023-11-29 18:50:10,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 18:50:10,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 18:50:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 18:50:12,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6046 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 5665 trivial. 0 not checked. [2023-11-29 18:50:12,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 18:50:12,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143073642] [2023-11-29 18:50:12,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143073642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 18:50:12,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 18:50:12,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-29 18:50:12,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098036957] [2023-11-29 18:50:12,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 18:50:12,377 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 18:50:12,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 18:50:12,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 18:50:12,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-11-29 18:50:12,378 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 228 [2023-11-29 18:50:12,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 646 transitions, 9792 flow. Second operand has 16 states, 16 states have (on average 144.0625) internal successors, (2305), 16 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states 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 18:50:12,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 18:50:12,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 228 [2023-11-29 18:50:12,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 18:50:15,792 INFO L124 PetriNetUnfolderBase]: 3087/11823 cut-off events. [2023-11-29 18:50:15,792 INFO L125 PetriNetUnfolderBase]: For 53099/53452 co-relation queries the response was YES. [2023-11-29 18:50:15,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46027 conditions, 11823 events. 3087/11823 cut-off events. For 53099/53452 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 70367 event pairs, 150 based on Foata normal form. 1/11608 useless extension candidates. Maximal degree in co-relation 44680. Up to 7175 conditions per place. [2023-11-29 18:50:15,852 INFO L140 encePairwiseOnDemand]: 207/228 looper letters, 430 selfloop transitions, 25 changer transitions 16/670 dead transitions. [2023-11-29 18:50:15,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 670 transitions, 10905 flow [2023-11-29 18:50:15,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 18:50:15,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-29 18:50:15,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2327 transitions. [2023-11-29 18:50:15,855 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6378837719298246 [2023-11-29 18:50:15,855 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2327 transitions. [2023-11-29 18:50:15,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2327 transitions. [2023-11-29 18:50:15,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 18:50:15,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2327 transitions. [2023-11-29 18:50:15,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 145.4375) internal successors, (2327), 16 states have internal predecessors, (2327), 0 states have call successors, (0), 0 states 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 18:50:15,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 228.0) internal successors, (3876), 17 states have internal predecessors, (3876), 0 states have call successors, (0), 0 states 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 18:50:15,861 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 228.0) internal successors, (3876), 17 states have internal predecessors, (3876), 0 states have call successors, (0), 0 states 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 18:50:15,861 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, 168 predicate places. [2023-11-29 18:50:15,861 INFO L500 AbstractCegarLoop]: Abstraction has has 378 places, 670 transitions, 10905 flow [2023-11-29 18:50:15,862 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 144.0625) internal successors, (2305), 16 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states 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 18:50:15,862 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 18:50:15,862 INFO L232 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:50:15,862 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 18:50:15,863 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 18:50:15,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 18:50:15,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1051764564, now seen corresponding path program 4 times [2023-11-29 18:50:15,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 18:50:15,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141695111] [2023-11-29 18:50:15,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 18:50:15,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 18:50:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 18:50:18,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6080 backedges. 3321 proven. 229 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2023-11-29 18:50:18,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 18:50:18,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141695111] [2023-11-29 18:50:18,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141695111] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 18:50:18,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930768571] [2023-11-29 18:50:18,903 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 18:50:18,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 18:50:18,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 18:50:18,912 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 18:50:18,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 18:50:25,913 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 18:50:25,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 18:50:25,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 1658 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 18:50:25,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 18:50:27,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 18:50:27,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 18:50:27,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 18:50:27,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 18:50:27,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-29 18:50:27,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 18:50:27,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 18:50:27,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 18:50:27,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 18:50:28,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 18:50:28,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-29 18:50:28,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 18:50:28,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6080 backedges. 3411 proven. 351 refuted. 0 times theorem prover too weak. 2318 trivial. 0 not checked. [2023-11-29 18:50:28,176 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 18:50:28,524 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| Int) (v_ArrVal_1540 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1) 20))))) is different from false [2023-11-29 18:50:28,582 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| Int) (v_ArrVal_1540 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143|)))) is different from false [2023-11-29 18:50:28,590 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| Int) (v_ArrVal_1540 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143|) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1)))))) is different from false [2023-11-29 18:50:28,603 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| Int) (v_ArrVal_1540 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143|)))) is different from false [2023-11-29 18:50:28,662 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| Int) (v_ArrVal_1540 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1) 20))))) is different from false [2023-11-29 18:50:28,691 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| Int) (v_ArrVal_1540 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_111| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_111|) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143|)))) is different from false [2023-11-29 18:50:28,706 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| Int) (v_ArrVal_1540 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_111| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_111|) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143|)))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147|)))) is different from false [2023-11-29 18:50:28,729 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| Int) (v_ArrVal_1540 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_111| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147|) (not (= 20 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_111|) .cse3))) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143|))))) is different from false [2023-11-29 18:50:28,895 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| Int) (v_ArrVal_1536 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| Int) (v_ArrVal_1540 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_111| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1536) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse3 (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_111|) .cse1) 20)) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147|) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143|))))) is different from false [2023-11-29 18:50:28,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 18:50:28,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 145 [2023-11-29 18:50:28,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 18:50:28,972 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 229 treesize of output 227 [2023-11-29 18:50:28,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 85 [2023-11-29 18:50:28,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 18:50:29,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-29 18:50:29,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 18:50:29,057 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 85 treesize of output 77 [2023-11-29 18:50:29,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6080 backedges. 3047 proven. 282 refuted. 0 times theorem prover too weak. 2372 trivial. 379 not checked. [2023-11-29 18:50:29,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930768571] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 18:50:29,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 18:50:29,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 22] total 58 [2023-11-29 18:50:29,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535529752] [2023-11-29 18:50:29,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 18:50:29,630 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-11-29 18:50:29,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 18:50:29,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-11-29 18:50:29,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=2018, Unknown=9, NotChecked=918, Total=3306 [2023-11-29 18:50:29,635 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 228 [2023-11-29 18:50:29,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 670 transitions, 10905 flow. Second operand has 58 states, 58 states have (on average 160.5) internal successors, (9309), 58 states have internal predecessors, (9309), 0 states have call successors, (0), 0 states 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 18:50:29,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 18:50:29,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 228 [2023-11-29 18:50:29,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 18:50:39,151 INFO L124 PetriNetUnfolderBase]: 6902/25045 cut-off events. [2023-11-29 18:50:39,151 INFO L125 PetriNetUnfolderBase]: For 141676/142171 co-relation queries the response was YES. [2023-11-29 18:50:39,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113907 conditions, 25045 events. 6902/25045 cut-off events. For 141676/142171 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 180395 event pairs, 133 based on Foata normal form. 0/24790 useless extension candidates. Maximal degree in co-relation 111384. Up to 14692 conditions per place. [2023-11-29 18:50:39,290 INFO L140 encePairwiseOnDemand]: 204/228 looper letters, 974 selfloop transitions, 118 changer transitions 22/1325 dead transitions. [2023-11-29 18:50:39,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 1325 transitions, 28300 flow [2023-11-29 18:50:39,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-29 18:50:39,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-11-29 18:50:39,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 5370 transitions. [2023-11-29 18:50:39,294 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7137161084529505 [2023-11-29 18:50:39,294 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 5370 transitions. [2023-11-29 18:50:39,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 5370 transitions. [2023-11-29 18:50:39,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 18:50:39,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 5370 transitions. [2023-11-29 18:50:39,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 162.72727272727272) internal successors, (5370), 33 states have internal predecessors, (5370), 0 states have call successors, (0), 0 states 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 18:50:39,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 228.0) internal successors, (7752), 34 states have internal predecessors, (7752), 0 states have call successors, (0), 0 states 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 18:50:39,533 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 228.0) internal successors, (7752), 34 states have internal predecessors, (7752), 0 states have call successors, (0), 0 states 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 18:50:39,534 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, 200 predicate places. [2023-11-29 18:50:39,534 INFO L500 AbstractCegarLoop]: Abstraction has has 410 places, 1325 transitions, 28300 flow [2023-11-29 18:50:39,536 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 160.5) internal successors, (9309), 58 states have internal predecessors, (9309), 0 states have call successors, (0), 0 states 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 18:50:39,536 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 18:50:39,545 INFO L232 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 14, 14, 14, 14, 14, 14, 14, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 18:50:39,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 18:50:39,752 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 18:50:39,753 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 18:50:39,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 18:50:39,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1885775990, now seen corresponding path program 5 times [2023-11-29 18:50:39,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 18:50:39,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633266378] [2023-11-29 18:50:39,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 18:50:39,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 18:50:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 18:50:45,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6296 backedges. 2151 proven. 765 refuted. 0 times theorem prover too weak. 3380 trivial. 0 not checked. [2023-11-29 18:50:45,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 18:50:45,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633266378] [2023-11-29 18:50:45,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633266378] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 18:50:45,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564549850] [2023-11-29 18:50:45,276 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 18:50:45,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 18:50:45,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 18:50:45,277 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 18:50:45,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 18:51:01,951 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2023-11-29 18:51:01,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 18:51:01,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 256 conjunts are in the unsatisfiable core [2023-11-29 18:51:01,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 18:51:02,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2023-11-29 18:51:02,170 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2023-11-29 18:51:02,171 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 34 treesize of output 28 [2023-11-29 18:51:02,401 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 18:51:02,408 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-11-29 18:51:02,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 56 [2023-11-29 18:51:02,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 18:51:02,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2023-11-29 18:51:02,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 34 [2023-11-29 18:51:02,787 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2023-11-29 18:51:02,787 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 58 treesize of output 46 [2023-11-29 18:51:03,242 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 18:51:03,252 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-11-29 18:51:03,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 75 [2023-11-29 18:51:03,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 18:51:03,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 47 [2023-11-29 18:51:03,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-11-29 18:51:03,496 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2023-11-29 18:51:03,496 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 27 [2023-11-29 18:51:03,823 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 18:51:03,831 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2023-11-29 18:51:03,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 51 [2023-11-29 18:51:03,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 18:51:03,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2023-11-29 18:51:04,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 44 [2023-11-29 18:51:04,273 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2023-11-29 18:51:04,273 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 68 treesize of output 56 [2023-11-29 18:51:04,661 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 18:51:04,671 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-11-29 18:51:04,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 66 [2023-11-29 18:51:04,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 18:51:04,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2023-11-29 18:51:05,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 44 [2023-11-29 18:51:05,163 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2023-11-29 18:51:05,165 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 68 treesize of output 56 [2023-11-29 18:51:05,611 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 18:51:05,620 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-11-29 18:51:05,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 66 [2023-11-29 18:51:05,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 18:51:05,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2023-11-29 18:51:05,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 44 [2023-11-29 18:51:06,152 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2023-11-29 18:51:06,152 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 68 treesize of output 56 [2023-11-29 18:51:06,625 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 18:51:06,634 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-11-29 18:51:06,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 66 [2023-11-29 18:51:06,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 18:51:06,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2023-11-29 18:51:06,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-11-29 18:51:06,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 18:51:06,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2023-11-29 18:51:07,304 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 18:51:07,311 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2023-11-29 18:51:07,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2023-11-29 18:51:07,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 18:51:07,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-29 18:51:07,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 3 [2023-11-29 18:51:07,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 18:51:07,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2023-11-29 18:51:08,034 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 18:51:08,039 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2023-11-29 18:51:08,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2023-11-29 18:51:08,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 18:51:08,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-29 18:51:08,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2023-11-29 18:51:08,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 18:51:08,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2023-11-29 18:51:08,691 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 18:51:08,696 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2023-11-29 18:51:08,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2023-11-29 18:51:08,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 18:51:08,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-29 18:51:08,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2023-11-29 18:51:09,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 18:51:09,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 13 [2023-11-29 18:51:09,315 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-29 18:51:09,315 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 42 treesize of output 16 [2023-11-29 18:51:09,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-29 18:51:09,326 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 19 treesize of output 7 [2023-11-29 18:51:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6296 backedges. 4429 proven. 837 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2023-11-29 18:51:09,387 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-11-29 19:04:13,267 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-29 19:04:13,267 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-29 19:04:14,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-29 19:04:14,480 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-11-29 19:04:14,509 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-29 19:04:14,509 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 19:04:14,509 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 823 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-11-29 19:04:14,510 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-29 19:04:14,510 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-29 19:04:14,510 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-29 19:04:14,511 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-29 19:04:14,511 INFO L457 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1, 1] [2023-11-29 19:04:14,517 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 19:04:14,517 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 19:04:14,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 07:04:14 BasicIcfg [2023-11-29 19:04:14,521 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 19:04:14,521 INFO L158 Benchmark]: Toolchain (without parser) took 864246.80ms. Allocated memory was 675.3MB in the beginning and 3.9GB in the end (delta: 3.2GB). Free memory was 620.7MB in the beginning and 2.4GB in the end (delta: -1.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. [2023-11-29 19:04:14,521 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 352.3MB. Free memory is still 301.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-29 19:04:14,521 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.10ms. Allocated memory is still 675.3MB. Free memory was 620.4MB in the beginning and 589.7MB in the end (delta: 30.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-11-29 19:04:14,521 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.24ms. Allocated memory is still 675.3MB. Free memory was 589.7MB in the beginning and 586.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 19:04:14,521 INFO L158 Benchmark]: Boogie Preprocessor took 45.72ms. Allocated memory is still 675.3MB. Free memory was 586.9MB in the beginning and 584.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 19:04:14,522 INFO L158 Benchmark]: RCFGBuilder took 538.57ms. Allocated memory is still 675.3MB. Free memory was 584.7MB in the beginning and 633.5MB in the end (delta: -48.7MB). Peak memory consumption was 25.5MB. Max. memory is 16.0GB. [2023-11-29 19:04:14,522 INFO L158 Benchmark]: TraceAbstraction took 863184.73ms. Allocated memory was 675.3MB in the beginning and 3.9GB in the end (delta: 3.2GB). Free memory was 632.4MB in the beginning and 2.4GB in the end (delta: -1.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. [2023-11-29 19:04:14,523 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks [2023-11-29 19:04:14,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 352.3MB. Free memory is still 301.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 434.10ms. Allocated memory is still 675.3MB. Free memory was 620.4MB in the beginning and 589.7MB in the end (delta: 30.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 35.24ms. Allocated memory is still 675.3MB. Free memory was 589.7MB in the beginning and 586.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 45.72ms. Allocated memory is still 675.3MB. Free memory was 586.9MB in the beginning and 584.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 538.57ms. Allocated memory is still 675.3MB. Free memory was 584.7MB in the beginning and 633.5MB in the end (delta: -48.7MB). Peak memory consumption was 25.5MB. Max. memory is 16.0GB. * TraceAbstraction took 863184.73ms. Allocated memory was 675.3MB in the beginning and 3.9GB in the end (delta: 3.2GB). Free memory was 632.4MB in the beginning and 2.4GB in the end (delta: -1.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 823 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 823 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 823 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 823 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 347 locations, 5 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: 863.1s, OverallIterations: 13, TraceHistogramMax: 20, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 21.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1667 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1667 mSDsluCounter, 1323 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2218 IncrementalHoareTripleChecker+Unchecked, 1120 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4427 IncrementalHoareTripleChecker+Invalid, 6740 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 203 mSDtfsCounter, 4427 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5260 GetRequests, 4865 SyntacticMatches, 50 SemanticMatches, 345 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 5601 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28300occurred in iteration=12, InterpolantAutomatonStates: 220, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 7.7s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 6586 NumberOfCodeBlocks, 6426 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 8744 ConstructedInterpolants, 58 QuantifiedInterpolants, 32308 SizeOfPredicates, 97 NumberOfNonLiveVariables, 5435 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 24 InterpolantComputations, 7 PerfectInterpolantSequences, 23725/37988 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown