/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_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-29 19:00:22,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 19:00:22,358 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 19:00:22,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 19:00:22,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 19:00:22,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 19:00:22,380 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 19:00:22,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 19:00:22,381 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 19:00:22,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 19:00:22,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 19:00:22,382 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 19:00:22,382 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 19:00:22,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 19:00:22,383 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 19:00:22,383 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 19:00:22,383 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 19:00:22,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 19:00:22,384 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 19:00:22,384 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 19:00:22,385 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 19:00:22,385 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 19:00:22,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 19:00:22,386 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-29 19:00:22,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 19:00:22,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 19:00:22,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 19:00:22,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 19:00:22,388 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 19:00:22,388 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 19:00:22,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 19:00:22,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 19:00:22,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 19:00:22,389 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 19:00:22,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 19:00:22,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 19:00:22,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 19:00:22,640 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 19:00:22,640 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 19:00:22,641 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-11-29 19:00:23,758 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 19:00:23,993 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 19:00:23,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-11-29 19:00:24,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5903e1554/793d1a26a2ac4737af7b104efed928f5/FLAG7990fb598 [2023-11-29 19:00:24,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5903e1554/793d1a26a2ac4737af7b104efed928f5 [2023-11-29 19:00:24,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 19:00:24,031 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-29 19:00:24,032 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 19:00:24,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 19:00:24,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 19:00:24,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:00:24" (1/1) ... [2023-11-29 19:00:24,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f545b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:24, skipping insertion in model container [2023-11-29 19:00:24,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:00:24" (1/1) ... [2023-11-29 19:00:24,097 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 19:00:24,451 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_longest.i[43280,43293] [2023-11-29 19:00:24,456 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_longest.i[43553,43566] [2023-11-29 19:00:24,459 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 19:00:24,469 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 19:00:24,510 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_longest.i[43280,43293] [2023-11-29 19:00:24,512 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_longest.i[43553,43566] [2023-11-29 19:00:24,514 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 19:00:24,588 INFO L206 MainTranslator]: Completed translation [2023-11-29 19:00:24,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:24 WrapperNode [2023-11-29 19:00:24,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 19:00:24,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 19:00:24,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 19:00:24,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 19:00:24,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:24" (1/1) ... [2023-11-29 19:00:24,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:24" (1/1) ... [2023-11-29 19:00:24,659 INFO L138 Inliner]: procedures = 275, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 208 [2023-11-29 19:00:24,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 19:00:24,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 19:00:24,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 19:00:24,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 19:00:24,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:24" (1/1) ... [2023-11-29 19:00:24,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:24" (1/1) ... [2023-11-29 19:00:24,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:24" (1/1) ... [2023-11-29 19:00:24,683 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:24" (1/1) ... [2023-11-29 19:00:24,691 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:24" (1/1) ... [2023-11-29 19:00:24,694 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:24" (1/1) ... [2023-11-29 19:00:24,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:24" (1/1) ... [2023-11-29 19:00:24,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:24" (1/1) ... [2023-11-29 19:00:24,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 19:00:24,701 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 19:00:24,701 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 19:00:24,701 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 19:00:24,702 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:24" (1/1) ... [2023-11-29 19:00:24,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 19:00:24,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 19:00:24,729 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 19:00:24,752 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 19:00:24,772 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-29 19:00:24,772 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-29 19:00:24,773 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-29 19:00:24,773 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-29 19:00:24,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 19:00:24,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 19:00:24,773 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-29 19:00:24,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 19:00:24,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 19:00:24,773 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-29 19:00:24,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 19:00:24,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 19:00:24,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 19:00:24,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 19:00:24,775 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 19:00:24,941 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 19:00:24,942 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 19:00:25,195 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 19:00:25,216 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 19:00:25,217 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 19:00:25,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:00:25 BoogieIcfgContainer [2023-11-29 19:00:25,218 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 19:00:25,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 19:00:25,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 19:00:25,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 19:00:25,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:00:24" (1/3) ... [2023-11-29 19:00:25,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f697507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:00:25, skipping insertion in model container [2023-11-29 19:00:25,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:00:24" (2/3) ... [2023-11-29 19:00:25,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f697507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:00:25, skipping insertion in model container [2023-11-29 19:00:25,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:00:25" (3/3) ... [2023-11-29 19:00:25,224 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2023-11-29 19:00:25,238 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 19:00:25,238 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 19:00:25,238 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 19:00:25,340 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 19:00:25,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 228 transitions, 470 flow [2023-11-29 19:00:25,450 INFO L124 PetriNetUnfolderBase]: 13/226 cut-off events. [2023-11-29 19:00:25,451 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 19:00:25,463 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 19:00:25,464 INFO L82 GeneralOperation]: Start removeDead. Operand has 222 places, 228 transitions, 470 flow [2023-11-29 19:00:25,469 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 216 transitions, 441 flow [2023-11-29 19:00:25,476 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 19:00:25,481 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;@1317e516, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 19:00:25,482 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-29 19:00:25,493 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 19:00:25,493 INFO L124 PetriNetUnfolderBase]: 1/58 cut-off events. [2023-11-29 19:00:25,493 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 19:00:25,493 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:00:25,494 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 19:00:25,494 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 19:00:25,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:00:25,499 INFO L85 PathProgramCache]: Analyzing trace with hash -484014062, now seen corresponding path program 1 times [2023-11-29 19:00:25,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:00:25,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472771760] [2023-11-29 19:00:25,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:00:25,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:00:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:00:25,770 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 19:00:25,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 19:00:25,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472771760] [2023-11-29 19:00:25,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472771760] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 19:00:25,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 19:00:25,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 19:00:25,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627290846] [2023-11-29 19:00:25,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 19:00:25,780 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 19:00:25,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 19:00:25,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 19:00:25,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 19:00:25,811 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 228 [2023-11-29 19:00:25,816 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 19:00:25,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 19:00:25,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 228 [2023-11-29 19:00:25,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 19:00:25,956 INFO L124 PetriNetUnfolderBase]: 26/374 cut-off events. [2023-11-29 19:00:25,957 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-29 19:00:25,960 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 19:00:25,962 INFO L140 encePairwiseOnDemand]: 224/228 looper letters, 7 selfloop transitions, 0 changer transitions 3/207 dead transitions. [2023-11-29 19:00:25,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 207 transitions, 437 flow [2023-11-29 19:00:25,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 19:00:25,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 19:00:25,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 437 transitions. [2023-11-29 19:00:25,979 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9583333333333334 [2023-11-29 19:00:25,979 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 437 transitions. [2023-11-29 19:00:25,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 437 transitions. [2023-11-29 19:00:25,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 19:00:25,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 437 transitions. [2023-11-29 19:00:25,988 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 19:00:25,992 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 19:00:25,993 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 19:00:25,995 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, -4 predicate places. [2023-11-29 19:00:25,996 INFO L500 AbstractCegarLoop]: Abstraction has has 206 places, 207 transitions, 437 flow [2023-11-29 19:00:25,996 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 19:00:25,996 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:00:25,996 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 19:00:26,001 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 19:00:26,002 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 19:00:26,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:00:26,003 INFO L85 PathProgramCache]: Analyzing trace with hash 559808428, now seen corresponding path program 1 times [2023-11-29 19:00:26,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:00:26,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522811054] [2023-11-29 19:00:26,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:00:26,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:00:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:00:26,971 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 19:00:26,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 19:00:26,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522811054] [2023-11-29 19:00:26,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522811054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 19:00:26,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 19:00:26,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 19:00:26,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679103232] [2023-11-29 19:00:26,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 19:00:26,974 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 19:00:26,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 19:00:26,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 19:00:26,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-29 19:00:26,980 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 228 [2023-11-29 19:00:26,982 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 19:00:26,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 19:00:26,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 228 [2023-11-29 19:00:26,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 19:00:27,752 INFO L124 PetriNetUnfolderBase]: 841/3185 cut-off events. [2023-11-29 19:00:27,752 INFO L125 PetriNetUnfolderBase]: For 287/289 co-relation queries the response was YES. [2023-11-29 19:00:27,763 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 19:00:27,777 INFO L140 encePairwiseOnDemand]: 211/228 looper letters, 46 selfloop transitions, 16 changer transitions 0/203 dead transitions. [2023-11-29 19:00:27,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 203 transitions, 553 flow [2023-11-29 19:00:27,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 19:00:27,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 19:00:27,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1923 transitions. [2023-11-29 19:00:27,783 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7028508771929824 [2023-11-29 19:00:27,783 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1923 transitions. [2023-11-29 19:00:27,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1923 transitions. [2023-11-29 19:00:27,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 19:00:27,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1923 transitions. [2023-11-29 19:00:27,789 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 19:00:27,796 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 19:00:27,798 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 19:00:27,799 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, 4 predicate places. [2023-11-29 19:00:27,799 INFO L500 AbstractCegarLoop]: Abstraction has has 214 places, 203 transitions, 553 flow [2023-11-29 19:00:27,800 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 19:00:27,801 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:00:27,801 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 19:00:27,802 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 19:00:27,802 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 19:00:27,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:00:27,803 INFO L85 PathProgramCache]: Analyzing trace with hash 348938573, now seen corresponding path program 1 times [2023-11-29 19:00:27,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:00:27,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080473180] [2023-11-29 19:00:27,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:00:27,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:00:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:00:28,061 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 19:00:28,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 19:00:28,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080473180] [2023-11-29 19:00:28,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080473180] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 19:00:28,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 19:00:28,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 19:00:28,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086369980] [2023-11-29 19:00:28,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 19:00:28,064 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 19:00:28,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 19:00:28,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 19:00:28,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 19:00:28,068 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 228 [2023-11-29 19:00:28,071 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 19:00:28,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 19:00:28,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 228 [2023-11-29 19:00:28,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 19:00:28,243 INFO L124 PetriNetUnfolderBase]: 306/1259 cut-off events. [2023-11-29 19:00:28,244 INFO L125 PetriNetUnfolderBase]: For 729/765 co-relation queries the response was YES. [2023-11-29 19:00:28,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2268 conditions, 1259 events. 306/1259 cut-off events. For 729/765 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 19:00:28,250 INFO L140 encePairwiseOnDemand]: 224/228 looper letters, 12 selfloop transitions, 2 changer transitions 9/209 dead transitions. [2023-11-29 19:00:28,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 209 transitions, 629 flow [2023-11-29 19:00:28,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 19:00:28,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 19:00:28,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 641 transitions. [2023-11-29 19:00:28,252 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9371345029239766 [2023-11-29 19:00:28,253 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 641 transitions. [2023-11-29 19:00:28,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 641 transitions. [2023-11-29 19:00:28,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 19:00:28,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 641 transitions. [2023-11-29 19:00:28,255 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 19:00:28,256 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 19:00:28,257 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 19:00:28,258 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, 6 predicate places. [2023-11-29 19:00:28,258 INFO L500 AbstractCegarLoop]: Abstraction has has 216 places, 209 transitions, 629 flow [2023-11-29 19:00:28,258 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 19:00:28,258 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:00:28,258 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 19:00:28,259 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 19:00:28,259 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 19:00:28,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:00:28,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1606788658, now seen corresponding path program 1 times [2023-11-29 19:00:28,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:00:28,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920876566] [2023-11-29 19:00:28,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:00:28,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:00:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:00:28,353 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 19:00:28,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 19:00:28,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920876566] [2023-11-29 19:00:28,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920876566] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 19:00:28,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 19:00:28,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 19:00:28,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212584321] [2023-11-29 19:00:28,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 19:00:28,359 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 19:00:28,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 19:00:28,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 19:00:28,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 19:00:28,362 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 228 [2023-11-29 19:00:28,363 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 19:00:28,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 19:00:28,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 228 [2023-11-29 19:00:28,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 19:00:28,593 INFO L124 PetriNetUnfolderBase]: 447/1756 cut-off events. [2023-11-29 19:00:28,594 INFO L125 PetriNetUnfolderBase]: For 2166/2243 co-relation queries the response was YES. [2023-11-29 19:00:28,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3594 conditions, 1756 events. 447/1756 cut-off events. For 2166/2243 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 19:00:28,603 INFO L140 encePairwiseOnDemand]: 225/228 looper letters, 21 selfloop transitions, 2 changer transitions 6/216 dead transitions. [2023-11-29 19:00:28,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 216 transitions, 718 flow [2023-11-29 19:00:28,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 19:00:28,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 19:00:28,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 640 transitions. [2023-11-29 19:00:28,606 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.935672514619883 [2023-11-29 19:00:28,606 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 640 transitions. [2023-11-29 19:00:28,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 640 transitions. [2023-11-29 19:00:28,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 19:00:28,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 640 transitions. [2023-11-29 19:00:28,608 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 19:00:28,609 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 19:00:28,611 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 19:00:28,613 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, 8 predicate places. [2023-11-29 19:00:28,613 INFO L500 AbstractCegarLoop]: Abstraction has has 218 places, 216 transitions, 718 flow [2023-11-29 19:00:28,613 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 19:00:28,613 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:00:28,614 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 19:00:28,614 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 19:00:28,614 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 19:00:28,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:00:28,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1287457348, now seen corresponding path program 1 times [2023-11-29 19:00:28,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:00:28,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055005674] [2023-11-29 19:00:28,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:00:28,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:00:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:00:28,755 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 19:00:28,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 19:00:28,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055005674] [2023-11-29 19:00:28,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055005674] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 19:00:28,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709641384] [2023-11-29 19:00:28,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:00:28,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 19:00:28,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 19:00:28,764 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 19:00:28,791 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 19:00:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:00:28,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 19:00:28,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 19:00:28,963 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 19:00:28,979 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 19:00:28,979 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 19:00:28,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709641384] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 19:00:28,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 19:00:28,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-29 19:00:28,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117908464] [2023-11-29 19:00:28,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 19:00:28,980 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 19:00:28,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 19:00:28,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 19:00:28,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 19:00:28,981 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 228 [2023-11-29 19:00:28,982 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 19:00:28,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 19:00:28,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 228 [2023-11-29 19:00:28,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 19:00:29,162 INFO L124 PetriNetUnfolderBase]: 201/1116 cut-off events. [2023-11-29 19:00:29,163 INFO L125 PetriNetUnfolderBase]: For 1882/1907 co-relation queries the response was YES. [2023-11-29 19:00:29,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2124 conditions, 1116 events. 201/1116 cut-off events. For 1882/1907 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 19:00:29,169 INFO L140 encePairwiseOnDemand]: 224/228 looper letters, 15 selfloop transitions, 3 changer transitions 10/218 dead transitions. [2023-11-29 19:00:29,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 218 transitions, 798 flow [2023-11-29 19:00:29,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 19:00:29,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 19:00:29,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2023-11-29 19:00:29,171 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9298245614035088 [2023-11-29 19:00:29,171 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 636 transitions. [2023-11-29 19:00:29,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 636 transitions. [2023-11-29 19:00:29,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 19:00:29,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 636 transitions. [2023-11-29 19:00:29,173 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 19:00:29,175 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 19:00:29,176 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 19:00:29,181 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, 10 predicate places. [2023-11-29 19:00:29,181 INFO L500 AbstractCegarLoop]: Abstraction has has 220 places, 218 transitions, 798 flow [2023-11-29 19:00:29,182 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 19:00:29,182 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:00:29,183 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 19:00:29,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 19:00:29,389 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 19:00:29,389 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 19:00:29,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:00:29,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1206536814, now seen corresponding path program 1 times [2023-11-29 19:00:29,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:00:29,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659383933] [2023-11-29 19:00:29,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:00:29,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:00:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:00:29,564 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 19:00:29,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 19:00:29,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659383933] [2023-11-29 19:00:29,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659383933] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 19:00:29,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270009338] [2023-11-29 19:00:29,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:00:29,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 19:00:29,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 19:00:29,566 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 19:00:29,575 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 19:00:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:00:29,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 19:00:29,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 19:00:29,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 19:00:29,805 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 19:00:29,868 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 19:00:29,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270009338] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 19:00:29,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 19:00:29,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-29 19:00:29,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132056958] [2023-11-29 19:00:29,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 19:00:29,870 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 19:00:29,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 19:00:29,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 19:00:29,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-29 19:00:29,873 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 228 [2023-11-29 19:00:29,875 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 19:00:29,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 19:00:29,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 228 [2023-11-29 19:00:29,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 19:00:30,108 INFO L124 PetriNetUnfolderBase]: 254/1403 cut-off events. [2023-11-29 19:00:30,109 INFO L125 PetriNetUnfolderBase]: For 2147/2190 co-relation queries the response was YES. [2023-11-29 19:00:30,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2877 conditions, 1403 events. 254/1403 cut-off events. For 2147/2190 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 19:00:30,116 INFO L140 encePairwiseOnDemand]: 222/228 looper letters, 27 selfloop transitions, 9 changer transitions 10/231 dead transitions. [2023-11-29 19:00:30,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 231 transitions, 998 flow [2023-11-29 19:00:30,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 19:00:30,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 19:00:30,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1880 transitions. [2023-11-29 19:00:30,121 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9161793372319688 [2023-11-29 19:00:30,121 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1880 transitions. [2023-11-29 19:00:30,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1880 transitions. [2023-11-29 19:00:30,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 19:00:30,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1880 transitions. [2023-11-29 19:00:30,126 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 19:00:30,129 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 19:00:30,131 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 19:00:30,133 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, 18 predicate places. [2023-11-29 19:00:30,133 INFO L500 AbstractCegarLoop]: Abstraction has has 228 places, 231 transitions, 998 flow [2023-11-29 19:00:30,134 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 19:00:30,134 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:00:30,135 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 19:00:30,144 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 19:00:30,340 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 19:00:30,341 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 19:00:30,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:00:30,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1536100156, now seen corresponding path program 2 times [2023-11-29 19:00:30,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:00:30,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608662889] [2023-11-29 19:00:30,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:00:30,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:00:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:00:30,605 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 19:00:30,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 19:00:30,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608662889] [2023-11-29 19:00:30,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608662889] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 19:00:30,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112617014] [2023-11-29 19:00:30,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 19:00:30,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 19:00:30,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 19:00:30,607 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 19:00:30,628 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 19:00:30,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 19:00:30,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 19:00:30,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 19:00:30,825 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 19:00:30,953 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 19:00:30,953 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 19:00:31,133 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 19:00:31,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112617014] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 19:00:31,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 19:00:31,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-11-29 19:00:31,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719859142] [2023-11-29 19:00:31,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 19:00:31,135 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 19:00:31,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 19:00:31,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 19:00:31,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-11-29 19:00:31,139 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 228 [2023-11-29 19:00:31,143 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 19:00:31,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 19:00:31,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 228 [2023-11-29 19:00:31,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 19:00:31,700 INFO L124 PetriNetUnfolderBase]: 454/2521 cut-off events. [2023-11-29 19:00:31,700 INFO L125 PetriNetUnfolderBase]: For 4230/4290 co-relation queries the response was YES. [2023-11-29 19:00:31,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5426 conditions, 2521 events. 454/2521 cut-off events. For 4230/4290 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 19:00:31,712 INFO L140 encePairwiseOnDemand]: 222/228 looper letters, 51 selfloop transitions, 21 changer transitions 10/267 dead transitions. [2023-11-29 19:00:31,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 267 transitions, 1546 flow [2023-11-29 19:00:31,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 19:00:31,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-29 19:00:31,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4374 transitions. [2023-11-29 19:00:31,721 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9135338345864662 [2023-11-29 19:00:31,721 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4374 transitions. [2023-11-29 19:00:31,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4374 transitions. [2023-11-29 19:00:31,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 19:00:31,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4374 transitions. [2023-11-29 19:00:31,732 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 19:00:31,740 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 19:00:31,742 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 19:00:31,743 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, 38 predicate places. [2023-11-29 19:00:31,743 INFO L500 AbstractCegarLoop]: Abstraction has has 248 places, 267 transitions, 1546 flow [2023-11-29 19:00:31,744 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 19:00:31,744 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:00:31,745 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 19:00:31,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 19:00:31,951 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 19:00:31,951 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 19:00:31,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:00:31,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1357434690, now seen corresponding path program 3 times [2023-11-29 19:00:31,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:00:31,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151278484] [2023-11-29 19:00:31,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:00:31,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:00:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:00:32,546 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 19:00:32,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 19:00:32,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151278484] [2023-11-29 19:00:32,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151278484] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 19:00:32,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751033233] [2023-11-29 19:00:32,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 19:00:32,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 19:00:32,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 19:00:32,548 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 19:00:32,567 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 19:00:32,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 19:00:32,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 19:00:32,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-29 19:00:32,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 19:00:34,101 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 19:00:34,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 19:00:34,175 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 19:00:34,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 19:00:34,398 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 19:00:34,448 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 19:00:34,522 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 19:00:34,523 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 19:00:34,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751033233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 19:00:34,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 19:00:34,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 28 [2023-11-29 19:00:34,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588642673] [2023-11-29 19:00:34,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 19:00:34,524 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 19:00:34,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 19:00:34,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 19:00:34,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2023-11-29 19:00:34,526 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 228 [2023-11-29 19:00:34,527 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 19:00:34,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 19:00:34,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 228 [2023-11-29 19:00:34,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 19:00:35,796 INFO L124 PetriNetUnfolderBase]: 1158/4647 cut-off events. [2023-11-29 19:00:35,796 INFO L125 PetriNetUnfolderBase]: For 12764/12907 co-relation queries the response was YES. [2023-11-29 19:00:35,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13497 conditions, 4647 events. 1158/4647 cut-off events. For 12764/12907 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 19:00:35,827 INFO L140 encePairwiseOnDemand]: 209/228 looper letters, 187 selfloop transitions, 26 changer transitions 13/386 dead transitions. [2023-11-29 19:00:35,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 386 transitions, 3592 flow [2023-11-29 19:00:35,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 19:00:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-29 19:00:35,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2131 transitions. [2023-11-29 19:00:35,833 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7189608636977058 [2023-11-29 19:00:35,833 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2131 transitions. [2023-11-29 19:00:35,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2131 transitions. [2023-11-29 19:00:35,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 19:00:35,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2131 transitions. [2023-11-29 19:00:35,838 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 19:00:35,854 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 19:00:35,856 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 19:00:35,856 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, 50 predicate places. [2023-11-29 19:00:35,856 INFO L500 AbstractCegarLoop]: Abstraction has has 260 places, 386 transitions, 3592 flow [2023-11-29 19:00:35,857 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 19:00:35,857 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:00:35,857 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 19:00:35,872 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 19:00:36,070 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 19:00:36,071 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 19:00:36,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:00:36,072 INFO L85 PathProgramCache]: Analyzing trace with hash 483837613, now seen corresponding path program 1 times [2023-11-29 19:00:36,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:00:36,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547523804] [2023-11-29 19:00:36,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:00:36,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:00:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:00:36,744 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 19:00:36,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 19:00:36,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547523804] [2023-11-29 19:00:36,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547523804] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 19:00:36,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993941544] [2023-11-29 19:00:36,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:00:36,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 19:00:36,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 19:00:36,746 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 19:00:36,749 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 19:00:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:00:36,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 19:00:37,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 19:00:37,315 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 19:00:37,315 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 19:00:37,776 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 19:00:37,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993941544] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 19:00:37,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 19:00:37,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2023-11-29 19:00:37,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805094604] [2023-11-29 19:00:37,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 19:00:37,778 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-29 19:00:37,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 19:00:37,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-29 19:00:37,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 19:00:37,786 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 228 [2023-11-29 19:00:37,790 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 19:00:37,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 19:00:37,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 228 [2023-11-29 19:00:37,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 19:00:40,450 INFO L124 PetriNetUnfolderBase]: 2362/9179 cut-off events. [2023-11-29 19:00:40,451 INFO L125 PetriNetUnfolderBase]: For 30146/30342 co-relation queries the response was YES. [2023-11-29 19:00:40,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28434 conditions, 9179 events. 2362/9179 cut-off events. For 30146/30342 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 19:00:40,499 INFO L140 encePairwiseOnDemand]: 222/228 looper letters, 265 selfloop transitions, 45 changer transitions 13/546 dead transitions. [2023-11-29 19:00:40,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 546 transitions, 7014 flow [2023-11-29 19:00:40,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-29 19:00:40,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-11-29 19:00:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 9362 transitions. [2023-11-29 19:00:40,516 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9124756335282651 [2023-11-29 19:00:40,516 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 9362 transitions. [2023-11-29 19:00:40,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 9362 transitions. [2023-11-29 19:00:40,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 19:00:40,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 9362 transitions. [2023-11-29 19:00:40,536 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 19:00:40,552 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 19:00:40,554 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 19:00:40,555 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, 94 predicate places. [2023-11-29 19:00:40,555 INFO L500 AbstractCegarLoop]: Abstraction has has 304 places, 546 transitions, 7014 flow [2023-11-29 19:00:40,557 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 19:00:40,557 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:00:40,557 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 19:00:40,571 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 19:00:40,771 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 19:00:40,771 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 19:00:40,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:00:40,772 INFO L85 PathProgramCache]: Analyzing trace with hash -793582591, now seen corresponding path program 2 times [2023-11-29 19:00:40,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:00:40,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368027109] [2023-11-29 19:00:40,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:00:40,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:00:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:00:42,662 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 19:00:42,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 19:00:42,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368027109] [2023-11-29 19:00:42,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368027109] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 19:00:42,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496678911] [2023-11-29 19:00:42,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 19:00:42,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 19:00:42,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 19:00:42,664 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 19:00:42,688 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 19:00:43,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 19:00:43,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 19:00:43,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 1318 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 19:00:43,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 19:00:43,607 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 19:00:43,607 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 19:00:44,830 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 19:00:44,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496678911] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 19:00:44,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 19:00:44,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2023-11-29 19:00:44,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754643905] [2023-11-29 19:00:44,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 19:00:44,833 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-11-29 19:00:44,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 19:00:44,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-11-29 19:00:44,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1122, Invalid=3168, Unknown=0, NotChecked=0, Total=4290 [2023-11-29 19:00:44,850 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 228 [2023-11-29 19:00:44,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 546 transitions, 7014 flow. Second operand has 66 states, 66 states have (on average 207.5) internal successors, (13695), 66 states have internal predecessors, (13695), 0 states have call successors, (0), 0 states 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 19:00:44,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 19:00:44,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 228 [2023-11-29 19:00:44,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 19:00:53,024 INFO L124 PetriNetUnfolderBase]: 4771/18235 cut-off events. [2023-11-29 19:00:53,025 INFO L125 PetriNetUnfolderBase]: For 71441/71719 co-relation queries the response was YES. [2023-11-29 19:00:53,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59829 conditions, 18235 events. 4771/18235 cut-off events. For 71441/71719 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 109974 event pairs, 224 based on Foata normal form. 2/17939 useless extension candidates. Maximal degree in co-relation 58656. Up to 8189 conditions per place. [2023-11-29 19:00:53,128 INFO L140 encePairwiseOnDemand]: 222/228 looper letters, 536 selfloop transitions, 93 changer transitions 14/866 dead transitions. [2023-11-29 19:00:53,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 866 transitions, 14500 flow [2023-11-29 19:00:53,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-11-29 19:00:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2023-11-29 19:00:53,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 19338 transitions. [2023-11-29 19:00:53,152 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9119977362761743 [2023-11-29 19:00:53,153 INFO L72 ComplementDD]: Start complementDD. Operand 93 states and 19338 transitions. [2023-11-29 19:00:53,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 19338 transitions. [2023-11-29 19:00:53,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 19:00:53,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 93 states and 19338 transitions. [2023-11-29 19:00:53,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 94 states, 93 states have (on average 207.93548387096774) internal successors, (19338), 93 states have internal predecessors, (19338), 0 states have call successors, (0), 0 states 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 19:00:53,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 94 states, 94 states have (on average 228.0) internal successors, (21432), 94 states have internal predecessors, (21432), 0 states have call successors, (0), 0 states 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 19:00:53,222 INFO L81 ComplementDD]: Finished complementDD. Result has 94 states, 94 states have (on average 228.0) internal successors, (21432), 94 states have internal predecessors, (21432), 0 states have call successors, (0), 0 states 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 19:00:53,223 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, 186 predicate places. [2023-11-29 19:00:53,224 INFO L500 AbstractCegarLoop]: Abstraction has has 396 places, 866 transitions, 14500 flow [2023-11-29 19:00:53,227 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 207.5) internal successors, (13695), 66 states have internal predecessors, (13695), 0 states have call successors, (0), 0 states 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 19:00:53,227 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:00:53,227 INFO L232 CegarLoopForPetriNet]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:00:53,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 19:00:53,434 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 19:00:53,435 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 19:00:53,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:00:53,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1030497961, now seen corresponding path program 3 times [2023-11-29 19:00:53,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:00:53,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406252460] [2023-11-29 19:00:53,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:00:53,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:00:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:00:59,102 INFO L134 CoverageAnalysis]: Checked inductivity of 14851 backedges. 0 proven. 14851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 19:00:59,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 19:00:59,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406252460] [2023-11-29 19:00:59,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406252460] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 19:00:59,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664267325] [2023-11-29 19:00:59,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 19:00:59,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 19:00:59,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 19:00:59,103 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 19:00:59,105 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 19:00:59,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-29 19:00:59,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 19:00:59,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 77 conjunts are in the unsatisfiable core [2023-11-29 19:00:59,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 19:01:03,598 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 19:01:03,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 19:01:03,670 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 19:01:03,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 19:01:03,919 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 19:01:03,958 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 19:01:04,168 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 19:01:04,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 19:01:04,248 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 19:01:04,472 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 19:01:04,514 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 19:01:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 14851 backedges. 1921 proven. 694 refuted. 0 times theorem prover too weak. 12236 trivial. 0 not checked. [2023-11-29 19:01:04,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 19:01:04,995 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1528 (Array Int Int))) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1528) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 800))) is different from false [2023-11-29 19:01:05,057 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1528 (Array Int Int))) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1528) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1))))) is different from false [2023-11-29 19:01:05,064 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1528 (Array Int Int))) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1528) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 800))) is different from false [2023-11-29 19:01:05,070 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1528 (Array Int Int))) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (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 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1528) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1))))) is different from false [2023-11-29 19:01:05,082 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1528 (Array Int Int))) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (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 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1528) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1))))) (= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 800)) is different from false [2023-11-29 19:01:05,220 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (v_ArrVal_1528 (Array Int Int))) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1528) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1))))) (= .cse4 800)))) is different from false [2023-11-29 19:01:05,255 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int)) (let ((.cse3 (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|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 800) (forall ((|v_t1Thread1of1ForFork1_enqueue_~x#1_93| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (v_ArrVal_1528 (Array Int Int))) (not (= (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1528) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_93|)) .cse2)) 800))))))) is different from false [2023-11-29 19:01:10,749 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_93| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_123| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (v_ArrVal_1528 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse3 (store .cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_123| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse0 (select .cse3 .cse4))) (or (= 800 .cse0) (not (= 800 (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1528) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_93|)) .cse2)))) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_123|)))))) is different from false [2023-11-29 19:01:12,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 19:01:12,771 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 231 treesize of output 161 [2023-11-29 19:01:12,810 INFO L349 Elim1Store]: treesize reduction 42, result has 58.0 percent of original size [2023-11-29 19:01:12,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 280 treesize of output 253 [2023-11-29 19:01:12,818 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-29 19:01:12,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 19:01:12,853 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 204 treesize of output 194 [2023-11-29 19:01:12,868 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 19:01:12,872 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 25 treesize of output 17 [2023-11-29 19:01:12,884 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 59 treesize of output 47 [2023-11-29 19:01:12,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-29 19:01:12,953 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 19:01:12,955 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 147 [2023-11-29 19:01:13,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 19:01:13,013 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 317 treesize of output 297 [2023-11-29 19:01:13,065 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 19:01:13,067 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 19:01:13,075 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 19:01:13,077 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 19:01:14,462 INFO L134 CoverageAnalysis]: Checked inductivity of 14851 backedges. 977 proven. 823 refuted. 258 times theorem prover too weak. 12236 trivial. 557 not checked. [2023-11-29 19:01:14,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664267325] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 19:01:14,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 19:01:14,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 21, 24] total 106 [2023-11-29 19:01:14,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454366226] [2023-11-29 19:01:14,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 19:01:14,467 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2023-11-29 19:01:14,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 19:01:14,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2023-11-29 19:01:14,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1317, Invalid=8189, Unknown=32, NotChecked=1592, Total=11130 [2023-11-29 19:01:14,485 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 228 [2023-11-29 19:01:14,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 866 transitions, 14500 flow. Second operand has 106 states, 106 states have (on average 153.5) internal successors, (16271), 106 states have internal predecessors, (16271), 0 states have call successors, (0), 0 states 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 19:01:14,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 19:01:14,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 228 [2023-11-29 19:01:14,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 19:03:55,235 INFO L124 PetriNetUnfolderBase]: 12398/42071 cut-off events. [2023-11-29 19:03:55,235 INFO L125 PetriNetUnfolderBase]: For 187858/188152 co-relation queries the response was YES. [2023-11-29 19:03:55,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168126 conditions, 42071 events. 12398/42071 cut-off events. For 187858/188152 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 303602 event pairs, 129 based on Foata normal form. 0/41758 useless extension candidates. Maximal degree in co-relation 165861. Up to 19506 conditions per place. [2023-11-29 19:03:55,509 INFO L140 encePairwiseOnDemand]: 197/228 looper letters, 3763 selfloop transitions, 2545 changer transitions 22/6455 dead transitions. [2023-11-29 19:03:55,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1406 places, 6455 transitions, 73717 flow [2023-11-29 19:03:55,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1011 states. [2023-11-29 19:03:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2023-11-29 19:03:55,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 152902 transitions. [2023-11-29 19:03:55,629 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.663326218612803 [2023-11-29 19:03:55,629 INFO L72 ComplementDD]: Start complementDD. Operand 1011 states and 152902 transitions. [2023-11-29 19:03:55,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1011 states and 152902 transitions. [2023-11-29 19:03:55,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 19:03:55,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 1011 states and 152902 transitions. [2023-11-29 19:03:55,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 1012 states, 1011 states have (on average 151.2383778437191) internal successors, (152902), 1011 states have internal predecessors, (152902), 0 states have call successors, (0), 0 states 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 19:03:56,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 1012 states, 1012 states have (on average 228.0) internal successors, (230736), 1012 states have internal predecessors, (230736), 0 states have call successors, (0), 0 states 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 19:03:56,107 INFO L81 ComplementDD]: Finished complementDD. Result has 1012 states, 1012 states have (on average 228.0) internal successors, (230736), 1012 states have internal predecessors, (230736), 0 states have call successors, (0), 0 states 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 19:03:56,108 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, 1196 predicate places. [2023-11-29 19:03:56,108 INFO L500 AbstractCegarLoop]: Abstraction has has 1406 places, 6455 transitions, 73717 flow [2023-11-29 19:03:56,111 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 106 states have (on average 153.5) internal successors, (16271), 106 states have internal predecessors, (16271), 0 states have call successors, (0), 0 states 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 19:03:56,111 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:03:56,112 INFO L232 CegarLoopForPetriNet]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 22, 22, 22, 22, 22, 22, 22, 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, 1, 1, 1] [2023-11-29 19:03:56,123 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 19:03:56,318 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 19:03:56,319 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 19:03:56,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:03:56,320 INFO L85 PathProgramCache]: Analyzing trace with hash 741150049, now seen corresponding path program 1 times [2023-11-29 19:03:56,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:03:56,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768771552] [2023-11-29 19:03:56,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:03:56,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:03:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:04:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 16388 backedges. 0 proven. 16388 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 19:04:01,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 19:04:01,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768771552] [2023-11-29 19:04:01,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768771552] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 19:04:01,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356196908] [2023-11-29 19:04:01,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:04:01,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 19:04:01,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 19:04:01,640 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 19:04:01,644 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 19:04:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:04:02,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 2502 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 19:04:02,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 19:04:03,203 INFO L134 CoverageAnalysis]: Checked inductivity of 16388 backedges. 0 proven. 16388 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 19:04:03,203 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 19:04:06,915 INFO L134 CoverageAnalysis]: Checked inductivity of 16388 backedges. 0 proven. 16388 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 19:04:06,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356196908] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 19:04:06,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 19:04:06,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 134 [2023-11-29 19:04:06,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876711826] [2023-11-29 19:04:06,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 19:04:06,920 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 134 states [2023-11-29 19:04:06,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 19:04:06,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2023-11-29 19:04:06,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4556, Invalid=13266, Unknown=0, NotChecked=0, Total=17822 [2023-11-29 19:04:06,944 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 228 [2023-11-29 19:04:06,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1406 places, 6455 transitions, 73717 flow. Second operand has 134 states, 134 states have (on average 207.50746268656715) internal successors, (27806), 134 states have internal predecessors, (27806), 0 states have call successors, (0), 0 states 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 19:04:06,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 19:04:06,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 228 [2023-11-29 19:04:06,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 19:05:38,568 INFO L124 PetriNetUnfolderBase]: 24651/83184 cut-off events. [2023-11-29 19:05:38,568 INFO L125 PetriNetUnfolderBase]: For 432904/433174 co-relation queries the response was YES. [2023-11-29 19:05:38,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347350 conditions, 83184 events. 24651/83184 cut-off events. For 432904/433174 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 597730 event pairs, 397 based on Foata normal form. 0/82685 useless extension candidates. Maximal degree in co-relation 344988. Up to 38763 conditions per place. [2023-11-29 19:05:39,183 INFO L140 encePairwiseOnDemand]: 222/228 looper letters, 2843 selfloop transitions, 768 changer transitions 19/8267 dead transitions. [2023-11-29 19:05:39,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1600 places, 8267 transitions, 121717 flow [2023-11-29 19:05:39,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2023-11-29 19:05:39,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2023-11-29 19:05:39,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 40537 transitions. [2023-11-29 19:05:39,210 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9117633828160144 [2023-11-29 19:05:39,210 INFO L72 ComplementDD]: Start complementDD. Operand 195 states and 40537 transitions. [2023-11-29 19:05:39,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 40537 transitions. [2023-11-29 19:05:39,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 19:05:39,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 195 states and 40537 transitions. [2023-11-29 19:05:39,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 196 states, 195 states have (on average 207.8820512820513) internal successors, (40537), 195 states have internal predecessors, (40537), 0 states have call successors, (0), 0 states 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 19:05:39,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 196 states, 196 states have (on average 228.0) internal successors, (44688), 196 states have internal predecessors, (44688), 0 states have call successors, (0), 0 states 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 19:05:39,295 INFO L81 ComplementDD]: Finished complementDD. Result has 196 states, 196 states have (on average 228.0) internal successors, (44688), 196 states have internal predecessors, (44688), 0 states have call successors, (0), 0 states 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 19:05:39,296 INFO L307 CegarLoopForPetriNet]: 210 programPoint places, 1390 predicate places. [2023-11-29 19:05:39,296 INFO L500 AbstractCegarLoop]: Abstraction has has 1600 places, 8267 transitions, 121717 flow [2023-11-29 19:05:39,300 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 134 states, 134 states have (on average 207.50746268656715) internal successors, (27806), 134 states have internal predecessors, (27806), 0 states have call successors, (0), 0 states 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 19:05:39,300 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 19:05:39,300 INFO L232 CegarLoopForPetriNet]: trace histogram [65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 47, 47, 47, 47, 47, 47, 47, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:05:39,309 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:05:39,508 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 19:05:39,509 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 19:05:39,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 19:05:39,510 INFO L85 PathProgramCache]: Analyzing trace with hash -278550395, now seen corresponding path program 4 times [2023-11-29 19:05:39,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 19:05:39,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38888130] [2023-11-29 19:05:39,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 19:05:39,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 19:05:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 19:06:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 69257 backedges. 0 proven. 69257 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 19:06:07,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 19:06:07,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38888130] [2023-11-29 19:06:07,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38888130] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 19:06:07,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616635996] [2023-11-29 19:06:07,517 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 19:06:07,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 19:06:07,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 19:06:07,519 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 19:06:07,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process Received shutdown request... [2023-11-29 19:13:58,750 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-29 19:13:58,750 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:13:59,904 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 0 [2023-11-29 19:13:59,951 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forcibly destroying the process [2023-11-29 19:13:59,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 137 [2023-11-29 19:13:59,964 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 19:13:59,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-11-29 19:13:59,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2023-11-29 19:13:59,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832997799] [2023-11-29 19:13:59,965 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-11-29 19:13:59,966 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 133 states [2023-11-29 19:13:59,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 19:13:59,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2023-11-29 19:13:59,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2023-11-29 19:13:59,986 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 228 [2023-11-29 19:13:59,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1600 places, 8267 transitions, 121717 flow. Second operand has 133 states, 133 states have (on average 207.50375939849624) internal successors, (27598), 133 states have internal predecessors, (27598), 0 states have call successors, (0), 0 states 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 19:13:59,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 19:13:59,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 228 [2023-11-29 19:13:59,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 19:14:00,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 19:14:00,001 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-29 19:14:00,001 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 19:14:00,001 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (133states, 205/228 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 17 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place.). [2023-11-29 19:14:00,003 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-29 19:14:00,003 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-29 19:14:00,003 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-29 19:14:00,003 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-29 19:14:00,003 INFO L457 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1] [2023-11-29 19:14:00,007 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 19:14:00,007 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 19:14:00,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 07:14:00 BasicIcfg [2023-11-29 19:14:00,010 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 19:14:00,010 INFO L158 Benchmark]: Toolchain (without parser) took 815979.08ms. Allocated memory was 572.5MB in the beginning and 5.2GB in the end (delta: 4.6GB). Free memory was 517.2MB in the beginning and 2.0GB in the end (delta: -1.5GB). Peak memory consumption was 3.1GB. Max. memory is 16.0GB. [2023-11-29 19:14:00,011 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 369.1MB. Free memory is still 315.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-29 19:14:00,011 INFO L158 Benchmark]: CACSL2BoogieTranslator took 557.64ms. Allocated memory is still 572.5MB. Free memory was 516.8MB in the beginning and 486.3MB in the end (delta: 30.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-11-29 19:14:00,011 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.42ms. Allocated memory is still 572.5MB. Free memory was 486.3MB in the beginning and 483.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 19:14:00,011 INFO L158 Benchmark]: Boogie Preprocessor took 40.29ms. Allocated memory is still 572.5MB. Free memory was 483.2MB in the beginning and 481.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 19:14:00,011 INFO L158 Benchmark]: RCFGBuilder took 516.99ms. Allocated memory is still 572.5MB. Free memory was 481.0MB in the beginning and 522.7MB in the end (delta: -41.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-11-29 19:14:00,012 INFO L158 Benchmark]: TraceAbstraction took 814790.61ms. Allocated memory was 572.5MB in the beginning and 5.2GB in the end (delta: 4.6GB). Free memory was 521.7MB in the beginning and 2.0GB in the end (delta: -1.5GB). Peak memory consumption was 3.1GB. Max. memory is 16.0GB. [2023-11-29 19:14:00,013 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 369.1MB. Free memory is still 315.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 557.64ms. Allocated memory is still 572.5MB. Free memory was 516.8MB in the beginning and 486.3MB in the end (delta: 30.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 68.42ms. Allocated memory is still 572.5MB. Free memory was 486.3MB in the beginning and 483.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 40.29ms. Allocated memory is still 572.5MB. Free memory was 483.2MB in the beginning and 481.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 516.99ms. Allocated memory is still 572.5MB. Free memory was 481.0MB in the beginning and 522.7MB in the end (delta: -41.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 814790.61ms. Allocated memory was 572.5MB in the beginning and 5.2GB in the end (delta: 4.6GB). Free memory was 521.7MB in the beginning and 2.0GB in the end (delta: -1.5GB). Peak memory consumption was 3.1GB. 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 enhancing Floyd-Hoare automaton (133states, 205/228 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 17 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place.). - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (133states, 205/228 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 17 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place.). - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (133states, 205/228 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 17 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place.). - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (133states, 205/228 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 17 conditions, 2 events (0/1 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/2 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place.). - 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: 814.6s, OverallIterations: 13, TraceHistogramMax: 65, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 269.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16012 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16012 mSDsluCounter, 2350 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 48424 IncrementalHoareTripleChecker+Unchecked, 2179 mSDsCounter, 1116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8675 IncrementalHoareTripleChecker+Invalid, 58215 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1116 mSolverCounterUnsat, 171 mSDtfsCounter, 8675 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11437 GetRequests, 9093 SyntacticMatches, 568 SemanticMatches, 1776 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 949044 ImplicationChecksByTransitivity, 155.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121717occurred in iteration=12, InterpolantAutomatonStates: 1410, 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.7s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 67.7s InterpolantComputationTime, 11404 NumberOfCodeBlocks, 10292 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 15172 ConstructedInterpolants, 58 QuantifiedInterpolants, 55740 SizeOfPredicates, 160 NumberOfNonLiveVariables, 6787 ConjunctsInSsa, 279 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 28050/176676 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