/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 12:21:44,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 12:21:44,574 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-VariableLbe.epf [2023-08-27 12:21:44,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 12:21:44,578 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 12:21:44,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 12:21:44,602 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 12:21:44,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 12:21:44,606 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 12:21:44,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 12:21:44,609 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 12:21:44,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 12:21:44,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 12:21:44,610 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 12:21:44,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 12:21:44,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 12:21:44,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 12:21:44,611 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 12:21:44,611 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 12:21:44,611 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 12:21:44,611 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 12:21:44,611 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 12:21:44,612 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 12:21:44,612 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 12:21:44,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 12:21:44,612 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 12:21:44,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 12:21:44,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 12:21:44,613 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 12:21:44,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 12:21:44,614 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 12:21:44,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 12:21:44,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 12:21:44,614 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 12:21:44,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 12:21:44,614 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 12:21:44,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 12:21:44,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 12:21:44,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 12:21:44,837 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 12:21:44,838 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 12:21:44,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2023-08-27 12:21:45,806 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 12:21:45,976 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 12:21:45,977 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2023-08-27 12:21:45,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91977e7e5/5efe1ab204314a73b805b06bc394b396/FLAG56a6e1ca5 [2023-08-27 12:21:45,995 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91977e7e5/5efe1ab204314a73b805b06bc394b396 [2023-08-27 12:21:45,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 12:21:45,999 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 12:21:46,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 12:21:46,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 12:21:46,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 12:21:46,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 12:21:45" (1/1) ... [2023-08-27 12:21:46,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53331371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:21:46, skipping insertion in model container [2023-08-27 12:21:46,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 12:21:45" (1/1) ... [2023-08-27 12:21:46,020 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 12:21:46,165 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 12:21:46,172 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 12:21:46,202 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 12:21:46,211 INFO L206 MainTranslator]: Completed translation [2023-08-27 12:21:46,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:21:46 WrapperNode [2023-08-27 12:21:46,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 12:21:46,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 12:21:46,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 12:21:46,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 12:21:46,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:21:46" (1/1) ... [2023-08-27 12:21:46,228 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:21:46" (1/1) ... [2023-08-27 12:21:46,247 INFO L138 Inliner]: procedures = 20, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 98 [2023-08-27 12:21:46,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 12:21:46,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 12:21:46,249 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 12:21:46,249 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 12:21:46,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:21:46" (1/1) ... [2023-08-27 12:21:46,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:21:46" (1/1) ... [2023-08-27 12:21:46,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:21:46" (1/1) ... [2023-08-27 12:21:46,265 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:21:46" (1/1) ... [2023-08-27 12:21:46,270 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:21:46" (1/1) ... [2023-08-27 12:21:46,272 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:21:46" (1/1) ... [2023-08-27 12:21:46,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:21:46" (1/1) ... [2023-08-27 12:21:46,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:21:46" (1/1) ... [2023-08-27 12:21:46,275 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 12:21:46,275 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 12:21:46,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 12:21:46,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 12:21:46,281 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:21:46" (1/1) ... [2023-08-27 12:21:46,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 12:21:46,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 12:21:46,302 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-08-27 12:21:46,312 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-08-27 12:21:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 12:21:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-27 12:21:46,327 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-27 12:21:46,328 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-27 12:21:46,328 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-27 12:21:46,328 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-27 12:21:46,328 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-27 12:21:46,329 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-27 12:21:46,329 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-27 12:21:46,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 12:21:46,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 12:21:46,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 12:21:46,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 12:21:46,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 12:21:46,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 12:21:46,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 12:21:46,330 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 12:21:46,393 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 12:21:46,394 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 12:21:46,543 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 12:21:46,548 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 12:21:46,548 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-27 12:21:46,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 12:21:46 BoogieIcfgContainer [2023-08-27 12:21:46,550 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 12:21:46,551 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 12:21:46,551 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 12:21:46,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 12:21:46,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 12:21:45" (1/3) ... [2023-08-27 12:21:46,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a267764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 12:21:46, skipping insertion in model container [2023-08-27 12:21:46,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:21:46" (2/3) ... [2023-08-27 12:21:46,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a267764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 12:21:46, skipping insertion in model container [2023-08-27 12:21:46,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 12:21:46" (3/3) ... [2023-08-27 12:21:46,555 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x6.wvr.c [2023-08-27 12:21:46,565 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 12:21:46,565 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-27 12:21:46,565 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 12:21:46,618 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-27 12:21:46,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 136 transitions, 304 flow [2023-08-27 12:21:46,687 INFO L124 PetriNetUnfolderBase]: 10/132 cut-off events. [2023-08-27 12:21:46,687 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-27 12:21:46,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 132 events. 10/132 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 87 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-08-27 12:21:46,692 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 136 transitions, 304 flow [2023-08-27 12:21:46,694 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 119 transitions, 262 flow [2023-08-27 12:21:46,697 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 12:21:46,702 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 119 transitions, 262 flow [2023-08-27 12:21:46,704 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 119 transitions, 262 flow [2023-08-27 12:21:46,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 119 transitions, 262 flow [2023-08-27 12:21:46,742 INFO L124 PetriNetUnfolderBase]: 10/119 cut-off events. [2023-08-27 12:21:46,742 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-27 12:21:46,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 119 events. 10/119 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 86 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-08-27 12:21:46,744 INFO L119 LiptonReduction]: Number of co-enabled transitions 2160 [2023-08-27 12:21:49,716 INFO L134 LiptonReduction]: Checked pairs total: 2179 [2023-08-27 12:21:49,717 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-08-27 12:21:49,725 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 12:21:49,729 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@5b74bb26, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 12:21:49,729 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-27 12:21:49,737 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 12:21:49,737 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2023-08-27 12:21:49,737 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-27 12:21:49,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 12:21:49,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 12:21:49,741 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-27 12:21:49,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 12:21:49,746 INFO L85 PathProgramCache]: Analyzing trace with hash -667664440, now seen corresponding path program 1 times [2023-08-27 12:21:49,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 12:21:49,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841640597] [2023-08-27 12:21:49,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 12:21:49,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 12:21:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 12:21:50,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:21:50,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 12:21:50,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841640597] [2023-08-27 12:21:50,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841640597] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 12:21:50,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 12:21:50,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 12:21:50,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526859805] [2023-08-27 12:21:50,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 12:21:50,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 12:21:50,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 12:21:50,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 12:21:50,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 12:21:50,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 242 [2023-08-27 12:21:50,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:50,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 12:21:50,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 242 [2023-08-27 12:21:50,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 12:21:50,412 INFO L124 PetriNetUnfolderBase]: 497/677 cut-off events. [2023-08-27 12:21:50,412 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2023-08-27 12:21:50,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 677 events. 497/677 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1765 event pairs, 117 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1016. Up to 471 conditions per place. [2023-08-27 12:21:50,419 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2023-08-27 12:21:50,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 233 flow [2023-08-27 12:21:50,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 12:21:50,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 12:21:50,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2023-08-27 12:21:50,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4256198347107438 [2023-08-27 12:21:50,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2023-08-27 12:21:50,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2023-08-27 12:21:50,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 12:21:50,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2023-08-27 12:21:50,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:50,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:50,445 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:50,446 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 74 flow. Second operand 3 states and 309 transitions. [2023-08-27 12:21:50,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 233 flow [2023-08-27 12:21:50,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 47 transitions, 203 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-27 12:21:50,452 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 91 flow [2023-08-27 12:21:50,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2023-08-27 12:21:50,455 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2023-08-27 12:21:50,455 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 91 flow [2023-08-27 12:21:50,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:50,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 12:21:50,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 12:21:50,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 12:21:50,456 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-27 12:21:50,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 12:21:50,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1663353083, now seen corresponding path program 1 times [2023-08-27 12:21:50,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 12:21:50,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680793259] [2023-08-27 12:21:50,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 12:21:50,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 12:21:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 12:21:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:21:50,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 12:21:50,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680793259] [2023-08-27 12:21:50,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680793259] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 12:21:50,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 12:21:50,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 12:21:50,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541644416] [2023-08-27 12:21:50,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 12:21:50,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 12:21:50,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 12:21:50,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 12:21:50,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 12:21:50,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 242 [2023-08-27 12:21:50,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:50,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 12:21:50,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 242 [2023-08-27 12:21:50,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 12:21:50,815 INFO L124 PetriNetUnfolderBase]: 461/641 cut-off events. [2023-08-27 12:21:50,815 INFO L125 PetriNetUnfolderBase]: For 227/227 co-relation queries the response was YES. [2023-08-27 12:21:50,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1641 conditions, 641 events. 461/641 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1806 event pairs, 37 based on Foata normal form. 36/677 useless extension candidates. Maximal degree in co-relation 586. Up to 435 conditions per place. [2023-08-27 12:21:50,818 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 50 selfloop transitions, 9 changer transitions 1/60 dead transitions. [2023-08-27 12:21:50,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 60 transitions, 289 flow [2023-08-27 12:21:50,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 12:21:50,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 12:21:50,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 402 transitions. [2023-08-27 12:21:50,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4152892561983471 [2023-08-27 12:21:50,820 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 402 transitions. [2023-08-27 12:21:50,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 402 transitions. [2023-08-27 12:21:50,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 12:21:50,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 402 transitions. [2023-08-27 12:21:50,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:50,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:50,825 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:50,825 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 91 flow. Second operand 4 states and 402 transitions. [2023-08-27 12:21:50,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 60 transitions, 289 flow [2023-08-27 12:21:50,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 60 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 12:21:50,827 INFO L231 Difference]: Finished difference. Result has 32 places, 33 transitions, 127 flow [2023-08-27 12:21:50,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=32, PETRI_TRANSITIONS=33} [2023-08-27 12:21:50,827 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-08-27 12:21:50,828 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 33 transitions, 127 flow [2023-08-27 12:21:50,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:50,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 12:21:50,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 12:21:50,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 12:21:50,831 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-27 12:21:50,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 12:21:50,833 INFO L85 PathProgramCache]: Analyzing trace with hash 81516279, now seen corresponding path program 2 times [2023-08-27 12:21:50,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 12:21:50,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579111490] [2023-08-27 12:21:50,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 12:21:50,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 12:21:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 12:21:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:21:50,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 12:21:50,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579111490] [2023-08-27 12:21:50,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579111490] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 12:21:50,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007483443] [2023-08-27 12:21:50,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 12:21:50,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 12:21:50,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 12:21:50,952 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-08-27 12:21:50,984 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-08-27 12:21:51,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 12:21:51,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 12:21:51,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-27 12:21:51,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 12:21:51,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:21:51,156 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 12:21:51,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:21:51,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007483443] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 12:21:51,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 12:21:51,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-27 12:21:51,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278261405] [2023-08-27 12:21:51,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 12:21:51,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 12:21:51,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 12:21:51,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 12:21:51,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-27 12:21:51,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 242 [2023-08-27 12:21:51,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 127 flow. Second operand has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:51,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 12:21:51,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 242 [2023-08-27 12:21:51,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 12:21:51,427 INFO L124 PetriNetUnfolderBase]: 893/1233 cut-off events. [2023-08-27 12:21:51,427 INFO L125 PetriNetUnfolderBase]: For 582/582 co-relation queries the response was YES. [2023-08-27 12:21:51,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3381 conditions, 1233 events. 893/1233 cut-off events. For 582/582 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3998 event pairs, 125 based on Foata normal form. 36/1269 useless extension candidates. Maximal degree in co-relation 745. Up to 482 conditions per place. [2023-08-27 12:21:51,434 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 89 selfloop transitions, 12 changer transitions 1/102 dead transitions. [2023-08-27 12:21:51,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 102 transitions, 526 flow [2023-08-27 12:21:51,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 12:21:51,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 12:21:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 610 transitions. [2023-08-27 12:21:51,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4201101928374656 [2023-08-27 12:21:51,436 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 610 transitions. [2023-08-27 12:21:51,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 610 transitions. [2023-08-27 12:21:51,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 12:21:51,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 610 transitions. [2023-08-27 12:21:51,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:51,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:51,440 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:51,440 INFO L175 Difference]: Start difference. First operand has 32 places, 33 transitions, 127 flow. Second operand 6 states and 610 transitions. [2023-08-27 12:21:51,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 102 transitions, 526 flow [2023-08-27 12:21:51,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 102 transitions, 512 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 12:21:51,448 INFO L231 Difference]: Finished difference. Result has 38 places, 38 transitions, 179 flow [2023-08-27 12:21:51,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=38, PETRI_TRANSITIONS=38} [2023-08-27 12:21:51,449 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2023-08-27 12:21:51,449 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 38 transitions, 179 flow [2023-08-27 12:21:51,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:51,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 12:21:51,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 12:21:51,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-27 12:21:51,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 12:21:51,655 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-27 12:21:51,655 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 12:21:51,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1496070667, now seen corresponding path program 1 times [2023-08-27 12:21:51,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 12:21:51,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336386864] [2023-08-27 12:21:51,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 12:21:51,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 12:21:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 12:21:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:21:51,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 12:21:51,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336386864] [2023-08-27 12:21:51,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336386864] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 12:21:51,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 12:21:51,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 12:21:51,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879325974] [2023-08-27 12:21:51,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 12:21:51,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 12:21:51,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 12:21:51,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 12:21:51,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 12:21:51,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 242 [2023-08-27 12:21:51,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 38 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:51,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 12:21:51,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 242 [2023-08-27 12:21:51,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 12:21:52,004 INFO L124 PetriNetUnfolderBase]: 863/1203 cut-off events. [2023-08-27 12:21:52,004 INFO L125 PetriNetUnfolderBase]: For 1859/1859 co-relation queries the response was YES. [2023-08-27 12:21:52,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3838 conditions, 1203 events. 863/1203 cut-off events. For 1859/1859 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3876 event pairs, 175 based on Foata normal form. 30/1233 useless extension candidates. Maximal degree in co-relation 2126. Up to 997 conditions per place. [2023-08-27 12:21:52,010 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 49 selfloop transitions, 11 changer transitions 11/71 dead transitions. [2023-08-27 12:21:52,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 71 transitions, 434 flow [2023-08-27 12:21:52,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 12:21:52,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 12:21:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 402 transitions. [2023-08-27 12:21:52,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4152892561983471 [2023-08-27 12:21:52,012 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 402 transitions. [2023-08-27 12:21:52,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 402 transitions. [2023-08-27 12:21:52,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 12:21:52,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 402 transitions. [2023-08-27 12:21:52,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:52,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:52,014 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:52,015 INFO L175 Difference]: Start difference. First operand has 38 places, 38 transitions, 179 flow. Second operand 4 states and 402 transitions. [2023-08-27 12:21:52,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 71 transitions, 434 flow [2023-08-27 12:21:52,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 71 transitions, 423 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-27 12:21:52,020 INFO L231 Difference]: Finished difference. Result has 41 places, 42 transitions, 222 flow [2023-08-27 12:21:52,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=41, PETRI_TRANSITIONS=42} [2023-08-27 12:21:52,021 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2023-08-27 12:21:52,021 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 42 transitions, 222 flow [2023-08-27 12:21:52,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:52,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 12:21:52,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 12:21:52,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 12:21:52,022 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-27 12:21:52,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 12:21:52,023 INFO L85 PathProgramCache]: Analyzing trace with hash 559273403, now seen corresponding path program 1 times [2023-08-27 12:21:52,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 12:21:52,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425293821] [2023-08-27 12:21:52,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 12:21:52,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 12:21:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 12:21:52,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:21:52,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 12:21:52,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425293821] [2023-08-27 12:21:52,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425293821] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 12:21:52,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709607419] [2023-08-27 12:21:52,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 12:21:52,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 12:21:52,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 12:21:52,152 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-08-27 12:21:52,155 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-08-27 12:21:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 12:21:52,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-27 12:21:52,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 12:21:52,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:21:52,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 12:21:52,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:21:52,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709607419] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 12:21:52,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 12:21:52,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-27 12:21:52,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102466004] [2023-08-27 12:21:52,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 12:21:52,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 12:21:52,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 12:21:52,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 12:21:52,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-27 12:21:52,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 242 [2023-08-27 12:21:52,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 42 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:52,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 12:21:52,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 242 [2023-08-27 12:21:52,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 12:21:52,632 INFO L124 PetriNetUnfolderBase]: 1541/2125 cut-off events. [2023-08-27 12:21:52,632 INFO L125 PetriNetUnfolderBase]: For 3029/3029 co-relation queries the response was YES. [2023-08-27 12:21:52,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7304 conditions, 2125 events. 1541/2125 cut-off events. For 3029/3029 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7653 event pairs, 285 based on Foata normal form. 90/2215 useless extension candidates. Maximal degree in co-relation 3827. Up to 896 conditions per place. [2023-08-27 12:21:52,642 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 103 selfloop transitions, 14 changer transitions 3/120 dead transitions. [2023-08-27 12:21:52,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 120 transitions, 789 flow [2023-08-27 12:21:52,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 12:21:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 12:21:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions. [2023-08-27 12:21:52,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41735537190082644 [2023-08-27 12:21:52,644 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 606 transitions. [2023-08-27 12:21:52,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 606 transitions. [2023-08-27 12:21:52,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 12:21:52,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 606 transitions. [2023-08-27 12:21:52,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:52,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:52,648 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:52,648 INFO L175 Difference]: Start difference. First operand has 41 places, 42 transitions, 222 flow. Second operand 6 states and 606 transitions. [2023-08-27 12:21:52,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 120 transitions, 789 flow [2023-08-27 12:21:52,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 120 transitions, 780 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 12:21:52,654 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 284 flow [2023-08-27 12:21:52,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=284, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2023-08-27 12:21:52,656 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2023-08-27 12:21:52,656 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 284 flow [2023-08-27 12:21:52,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:52,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 12:21:52,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 12:21:52,664 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-08-27 12:21:52,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 12:21:52,863 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-27 12:21:52,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 12:21:52,863 INFO L85 PathProgramCache]: Analyzing trace with hash 844375621, now seen corresponding path program 2 times [2023-08-27 12:21:52,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 12:21:52,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671769873] [2023-08-27 12:21:52,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 12:21:52,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 12:21:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 12:21:52,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:21:52,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 12:21:52,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671769873] [2023-08-27 12:21:52,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671769873] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 12:21:52,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 12:21:52,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 12:21:52,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483536300] [2023-08-27 12:21:52,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 12:21:52,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 12:21:52,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 12:21:52,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 12:21:52,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 12:21:52,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 242 [2023-08-27 12:21:52,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 284 flow. Second operand has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:52,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 12:21:52,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 242 [2023-08-27 12:21:52,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 12:21:53,216 INFO L124 PetriNetUnfolderBase]: 1885/2599 cut-off events. [2023-08-27 12:21:53,216 INFO L125 PetriNetUnfolderBase]: For 5804/5804 co-relation queries the response was YES. [2023-08-27 12:21:53,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10407 conditions, 2599 events. 1885/2599 cut-off events. For 5804/5804 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9692 event pairs, 363 based on Foata normal form. 84/2683 useless extension candidates. Maximal degree in co-relation 5273. Up to 1525 conditions per place. [2023-08-27 12:21:53,229 INFO L140 encePairwiseOnDemand]: 237/242 looper letters, 95 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2023-08-27 12:21:53,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 105 transitions, 772 flow [2023-08-27 12:21:53,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 12:21:53,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 12:21:53,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 559 transitions. [2023-08-27 12:21:53,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46198347107438015 [2023-08-27 12:21:53,232 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 559 transitions. [2023-08-27 12:21:53,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 559 transitions. [2023-08-27 12:21:53,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 12:21:53,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 559 transitions. [2023-08-27 12:21:53,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:53,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:53,234 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:53,234 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 284 flow. Second operand 5 states and 559 transitions. [2023-08-27 12:21:53,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 105 transitions, 772 flow [2023-08-27 12:21:53,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 105 transitions, 761 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-27 12:21:53,242 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 328 flow [2023-08-27 12:21:53,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=328, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2023-08-27 12:21:53,244 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2023-08-27 12:21:53,244 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 328 flow [2023-08-27 12:21:53,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:53,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 12:21:53,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 12:21:53,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 12:21:53,245 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-27 12:21:53,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 12:21:53,245 INFO L85 PathProgramCache]: Analyzing trace with hash -94445505, now seen corresponding path program 1 times [2023-08-27 12:21:53,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 12:21:53,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528750163] [2023-08-27 12:21:53,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 12:21:53,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 12:21:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 12:21:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:21:53,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 12:21:53,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528750163] [2023-08-27 12:21:53,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528750163] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 12:21:53,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756169110] [2023-08-27 12:21:53,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 12:21:53,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 12:21:53,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 12:21:53,335 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-08-27 12:21:53,337 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-08-27 12:21:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 12:21:53,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-27 12:21:53,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 12:21:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:21:53,453 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 12:21:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:21:53,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756169110] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 12:21:53,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 12:21:53,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-27 12:21:53,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167638601] [2023-08-27 12:21:53,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 12:21:53,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 12:21:53,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 12:21:53,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 12:21:53,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-27 12:21:53,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 242 [2023-08-27 12:21:53,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 328 flow. Second operand has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:53,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 12:21:53,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 242 [2023-08-27 12:21:53,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 12:21:53,796 INFO L124 PetriNetUnfolderBase]: 2379/3273 cut-off events. [2023-08-27 12:21:53,796 INFO L125 PetriNetUnfolderBase]: For 11011/11011 co-relation queries the response was YES. [2023-08-27 12:21:53,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14283 conditions, 3273 events. 2379/3273 cut-off events. For 11011/11011 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12737 event pairs, 673 based on Foata normal form. 84/3357 useless extension candidates. Maximal degree in co-relation 9336. Up to 1925 conditions per place. [2023-08-27 12:21:53,815 INFO L140 encePairwiseOnDemand]: 237/242 looper letters, 115 selfloop transitions, 10 changer transitions 0/125 dead transitions. [2023-08-27 12:21:53,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 125 transitions, 1000 flow [2023-08-27 12:21:53,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 12:21:53,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 12:21:53,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2023-08-27 12:21:53,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46859504132231405 [2023-08-27 12:21:53,817 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 567 transitions. [2023-08-27 12:21:53,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 567 transitions. [2023-08-27 12:21:53,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 12:21:53,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 567 transitions. [2023-08-27 12:21:53,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:53,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:53,820 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:53,820 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 328 flow. Second operand 5 states and 567 transitions. [2023-08-27 12:21:53,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 125 transitions, 1000 flow [2023-08-27 12:21:53,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 125 transitions, 931 flow, removed 24 selfloop flow, removed 2 redundant places. [2023-08-27 12:21:53,838 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 358 flow [2023-08-27 12:21:53,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=358, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2023-08-27 12:21:53,839 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2023-08-27 12:21:53,839 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 358 flow [2023-08-27 12:21:53,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:21:53,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 12:21:53,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 12:21:53,846 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-08-27 12:21:54,044 WARN L477 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-08-27 12:21:54,045 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-27 12:21:54,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 12:21:54,045 INFO L85 PathProgramCache]: Analyzing trace with hash -114446828, now seen corresponding path program 1 times [2023-08-27 12:21:54,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 12:21:54,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889780716] [2023-08-27 12:21:54,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 12:21:54,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 12:21:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 12:21:54,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:21:54,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 12:21:54,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889780716] [2023-08-27 12:21:54,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889780716] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 12:21:54,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622641123] [2023-08-27 12:21:54,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 12:21:54,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 12:21:54,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 12:21:54,377 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-08-27 12:21:54,380 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-08-27 12:21:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 12:21:54,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-27 12:21:54,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 12:23:06,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:23:06,677 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 12:23:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:23:18,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622641123] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 12:23:18,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 12:23:18,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2023-08-27 12:23:18,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770147533] [2023-08-27 12:23:18,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 12:23:18,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-27 12:23:18,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 12:23:18,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-27 12:23:18,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=142, Unknown=13, NotChecked=0, Total=210 [2023-08-27 12:23:18,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 242 [2023-08-27 12:23:18,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 358 flow. Second operand has 15 states, 15 states have (on average 88.93333333333334) internal successors, (1334), 15 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:23:18,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 12:23:18,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 242 [2023-08-27 12:23:18,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 12:23:23,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:23:28,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:23:29,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:23:40,093 WARN L234 SmtUtils]: Spent 8.23s on a formula simplification. DAG size of input: 39 DAG size of output: 32 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 12:23:43,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:23:45,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:23:47,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:23:49,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:23:53,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:23:56,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:23:57,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:24:00,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:24:02,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:24:05,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:24:07,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:24:09,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:24:12,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:24:14,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:24:18,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:24:20,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:24:25,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:24:27,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:24:29,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:24:33,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:24:35,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:24:38,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:24:40,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:24:42,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:24:44,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:24:47,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:24:50,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:24:52,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:24:53,208 INFO L124 PetriNetUnfolderBase]: 4393/6084 cut-off events. [2023-08-27 12:24:53,208 INFO L125 PetriNetUnfolderBase]: For 21764/21764 co-relation queries the response was YES. [2023-08-27 12:24:53,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27318 conditions, 6084 events. 4393/6084 cut-off events. For 21764/21764 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 27260 event pairs, 395 based on Foata normal form. 25/6109 useless extension candidates. Maximal degree in co-relation 17948. Up to 3721 conditions per place. [2023-08-27 12:24:53,241 INFO L140 encePairwiseOnDemand]: 234/242 looper letters, 220 selfloop transitions, 77 changer transitions 6/303 dead transitions. [2023-08-27 12:24:53,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 303 transitions, 2240 flow [2023-08-27 12:24:53,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-27 12:24:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-27 12:24:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1531 transitions. [2023-08-27 12:24:53,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421763085399449 [2023-08-27 12:24:53,245 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1531 transitions. [2023-08-27 12:24:53,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1531 transitions. [2023-08-27 12:24:53,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 12:24:53,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1531 transitions. [2023-08-27 12:24:53,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 102.06666666666666) internal successors, (1531), 15 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:24:53,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 242.0) internal successors, (3872), 16 states have internal predecessors, (3872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:24:53,252 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 242.0) internal successors, (3872), 16 states have internal predecessors, (3872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:24:53,252 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 358 flow. Second operand 15 states and 1531 transitions. [2023-08-27 12:24:53,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 303 transitions, 2240 flow [2023-08-27 12:24:53,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 303 transitions, 2187 flow, removed 20 selfloop flow, removed 2 redundant places. [2023-08-27 12:24:53,287 INFO L231 Difference]: Finished difference. Result has 79 places, 124 transitions, 1140 flow [2023-08-27 12:24:53,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1140, PETRI_PLACES=79, PETRI_TRANSITIONS=124} [2023-08-27 12:24:53,288 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 45 predicate places. [2023-08-27 12:24:53,288 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 124 transitions, 1140 flow [2023-08-27 12:24:53,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 88.93333333333334) internal successors, (1334), 15 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:24:53,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 12:24:53,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 12:24:53,297 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-08-27 12:24:53,497 WARN L477 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-08-27 12:24:53,498 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-27 12:24:53,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 12:24:53,498 INFO L85 PathProgramCache]: Analyzing trace with hash 714169666, now seen corresponding path program 1 times [2023-08-27 12:24:53,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 12:24:53,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099276910] [2023-08-27 12:24:53,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 12:24:53,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 12:24:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 12:24:53,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:24:53,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 12:24:53,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099276910] [2023-08-27 12:24:53,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099276910] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 12:24:53,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406793231] [2023-08-27 12:24:53,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 12:24:53,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 12:24:53,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 12:24:53,908 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-08-27 12:24:53,910 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-08-27 12:24:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 12:24:54,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-27 12:24:54,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 12:25:14,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:25:14,830 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 12:25:29,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:25:29,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406793231] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 12:25:29,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 12:25:29,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2023-08-27 12:25:29,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961256778] [2023-08-27 12:25:29,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 12:25:29,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-27 12:25:29,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 12:25:29,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-27 12:25:29,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=125, Unknown=14, NotChecked=0, Total=182 [2023-08-27 12:25:29,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 242 [2023-08-27 12:25:29,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 124 transitions, 1140 flow. Second operand has 14 states, 14 states have (on average 89.64285714285714) internal successors, (1255), 14 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:25:29,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 12:25:29,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 242 [2023-08-27 12:25:29,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 12:25:36,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:25:51,063 WARN L234 SmtUtils]: Spent 13.18s on a formula simplification. DAG size of input: 86 DAG size of output: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 12:26:03,912 WARN L234 SmtUtils]: Spent 5.93s on a formula simplification. DAG size of input: 48 DAG size of output: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 12:26:06,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:26:08,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:26:17,180 WARN L234 SmtUtils]: Spent 6.57s on a formula simplification. DAG size of input: 38 DAG size of output: 34 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 12:26:19,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:26:20,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:26:22,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:26:24,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:26:26,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:26:28,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:26:30,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:26:32,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:26:34,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:26:36,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:26:38,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:26:39,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:26:41,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:26:42,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:26:45,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:26:47,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:26:49,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:26:51,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:26:54,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:26:55,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:26:58,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:00,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:01,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:03,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:06,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:08,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:11,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:12,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:14,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:16,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:18,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:20,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:22,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:26,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:28,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:30,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:32,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:35,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:39,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:41,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:45,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:47,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:49,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:51,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:54,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:27:57,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:28:00,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:28:02,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:28:06,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:28:07,878 INFO L124 PetriNetUnfolderBase]: 6435/8995 cut-off events. [2023-08-27 12:28:07,878 INFO L125 PetriNetUnfolderBase]: For 50203/50203 co-relation queries the response was YES. [2023-08-27 12:28:07,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46370 conditions, 8995 events. 6435/8995 cut-off events. For 50203/50203 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 43320 event pairs, 1213 based on Foata normal form. 5/9000 useless extension candidates. Maximal degree in co-relation 43474. Up to 6402 conditions per place. [2023-08-27 12:28:07,921 INFO L140 encePairwiseOnDemand]: 234/242 looper letters, 267 selfloop transitions, 97 changer transitions 10/374 dead transitions. [2023-08-27 12:28:07,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 374 transitions, 3513 flow [2023-08-27 12:28:07,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-27 12:28:07,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-27 12:28:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1507 transitions. [2023-08-27 12:28:07,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2023-08-27 12:28:07,925 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1507 transitions. [2023-08-27 12:28:07,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1507 transitions. [2023-08-27 12:28:07,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 12:28:07,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1507 transitions. [2023-08-27 12:28:07,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 100.46666666666667) internal successors, (1507), 15 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:28:07,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 242.0) internal successors, (3872), 16 states have internal predecessors, (3872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:28:07,931 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 242.0) internal successors, (3872), 16 states have internal predecessors, (3872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:28:07,931 INFO L175 Difference]: Start difference. First operand has 79 places, 124 transitions, 1140 flow. Second operand 15 states and 1507 transitions. [2023-08-27 12:28:07,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 374 transitions, 3513 flow [2023-08-27 12:28:08,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 374 transitions, 3378 flow, removed 63 selfloop flow, removed 1 redundant places. [2023-08-27 12:28:08,018 INFO L231 Difference]: Finished difference. Result has 99 places, 217 transitions, 2111 flow [2023-08-27 12:28:08,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2111, PETRI_PLACES=99, PETRI_TRANSITIONS=217} [2023-08-27 12:28:08,019 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 65 predicate places. [2023-08-27 12:28:08,019 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 217 transitions, 2111 flow [2023-08-27 12:28:08,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 89.64285714285714) internal successors, (1255), 14 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:28:08,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 12:28:08,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 12:28:08,027 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-08-27 12:28:08,224 WARN L477 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-08-27 12:28:08,224 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-27 12:28:08,224 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 12:28:08,224 INFO L85 PathProgramCache]: Analyzing trace with hash 675517676, now seen corresponding path program 2 times [2023-08-27 12:28:08,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 12:28:08,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447080382] [2023-08-27 12:28:08,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 12:28:08,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 12:28:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 12:28:08,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:28:08,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 12:28:08,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447080382] [2023-08-27 12:28:08,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447080382] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 12:28:08,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173686185] [2023-08-27 12:28:08,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 12:28:08,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 12:28:08,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 12:28:08,600 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-08-27 12:28:08,602 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-08-27 12:28:09,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 12:28:09,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 12:28:09,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-27 12:28:09,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 12:28:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:28:16,715 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 12:28:21,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:28:21,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173686185] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 12:28:21,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 12:28:21,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2023-08-27 12:28:21,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856485318] [2023-08-27 12:28:21,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 12:28:21,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-27 12:28:21,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 12:28:21,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-27 12:28:21,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=125, Unknown=3, NotChecked=0, Total=182 [2023-08-27 12:28:21,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 242 [2023-08-27 12:28:21,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 217 transitions, 2111 flow. Second operand has 14 states, 14 states have (on average 89.64285714285714) internal successors, (1255), 14 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:28:21,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 12:28:21,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 242 [2023-08-27 12:28:21,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 12:28:24,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:28:29,529 WARN L234 SmtUtils]: Spent 5.24s on a formula simplification. DAG size of input: 59 DAG size of output: 56 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 12:28:31,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:28:33,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:28:35,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:28:38,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:28:39,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:28:41,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:28:42,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:28:44,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:28:48,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:28:51,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:28:53,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:02,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:04,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:08,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:10,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:12,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:14,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:18,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:20,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:22,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:23,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:25,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:27,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:29,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:32,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:34,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:37,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:39,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:41,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:43,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:45,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:47,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:49,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:52,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:54,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:57,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:59,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:29:59,626 INFO L124 PetriNetUnfolderBase]: 7799/10946 cut-off events. [2023-08-27 12:29:59,627 INFO L125 PetriNetUnfolderBase]: For 84338/84338 co-relation queries the response was YES. [2023-08-27 12:29:59,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63227 conditions, 10946 events. 7799/10946 cut-off events. For 84338/84338 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 55122 event pairs, 1479 based on Foata normal form. 3/10949 useless extension candidates. Maximal degree in co-relation 60956. Up to 9063 conditions per place. [2023-08-27 12:29:59,678 INFO L140 encePairwiseOnDemand]: 234/242 looper letters, 341 selfloop transitions, 52 changer transitions 6/399 dead transitions. [2023-08-27 12:29:59,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 399 transitions, 4276 flow [2023-08-27 12:29:59,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-27 12:29:59,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-27 12:29:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1301 transitions. [2023-08-27 12:29:59,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41354100445009534 [2023-08-27 12:29:59,681 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1301 transitions. [2023-08-27 12:29:59,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1301 transitions. [2023-08-27 12:29:59,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 12:29:59,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1301 transitions. [2023-08-27 12:29:59,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 100.07692307692308) internal successors, (1301), 13 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:29:59,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 242.0) internal successors, (3388), 14 states have internal predecessors, (3388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:29:59,687 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 242.0) internal successors, (3388), 14 states have internal predecessors, (3388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:29:59,687 INFO L175 Difference]: Start difference. First operand has 99 places, 217 transitions, 2111 flow. Second operand 13 states and 1301 transitions. [2023-08-27 12:29:59,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 399 transitions, 4276 flow [2023-08-27 12:29:59,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 399 transitions, 3992 flow, removed 142 selfloop flow, removed 0 redundant places. [2023-08-27 12:29:59,959 INFO L231 Difference]: Finished difference. Result has 116 places, 264 transitions, 2523 flow [2023-08-27 12:29:59,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1827, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2523, PETRI_PLACES=116, PETRI_TRANSITIONS=264} [2023-08-27 12:29:59,959 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 82 predicate places. [2023-08-27 12:29:59,959 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 264 transitions, 2523 flow [2023-08-27 12:29:59,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 89.64285714285714) internal successors, (1255), 14 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:29:59,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 12:29:59,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 12:29:59,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-27 12:30:00,167 WARN L477 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-08-27 12:30:00,167 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-27 12:30:00,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 12:30:00,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1660542996, now seen corresponding path program 2 times [2023-08-27 12:30:00,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 12:30:00,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114772179] [2023-08-27 12:30:00,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 12:30:00,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 12:30:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 12:30:00,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:30:00,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 12:30:00,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114772179] [2023-08-27 12:30:00,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114772179] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 12:30:00,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621309317] [2023-08-27 12:30:00,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 12:30:00,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 12:30:00,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 12:30:00,573 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-08-27 12:30:00,575 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-08-27 12:30:01,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 12:30:01,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 12:30:01,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-27 12:30:01,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 12:30:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:30:07,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 12:30:10,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:30:10,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621309317] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 12:30:10,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 12:30:10,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2023-08-27 12:30:10,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49445525] [2023-08-27 12:30:10,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 12:30:10,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-27 12:30:10,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 12:30:10,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-27 12:30:10,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=81, Unknown=4, NotChecked=0, Total=110 [2023-08-27 12:30:10,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 242 [2023-08-27 12:30:10,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 264 transitions, 2523 flow. Second operand has 11 states, 11 states have (on average 90.36363636363636) internal successors, (994), 11 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:30:10,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 12:30:10,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 242 [2023-08-27 12:30:10,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 12:30:22,891 WARN L234 SmtUtils]: Spent 12.47s on a formula simplification. DAG size of input: 80 DAG size of output: 42 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 12:30:25,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:30:37,565 WARN L234 SmtUtils]: Spent 8.79s on a formula simplification. DAG size of input: 43 DAG size of output: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 12:30:39,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:30:41,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:30:43,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:30:45,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:30:47,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:30:49,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:30:51,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:31:00,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:31:02,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:31:04,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:31:11,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:31:13,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:31:15,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:31:17,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:31:18,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:31:20,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:31:22,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:31:24,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:31:26,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:31:28,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:31:31,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:31:33,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:31:35,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:31:37,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:31:40,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:31:42,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:31:45,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:31:47,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-27 12:31:49,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:31:53,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 12:31:53,328 INFO L124 PetriNetUnfolderBase]: 10051/14121 cut-off events. [2023-08-27 12:31:53,328 INFO L125 PetriNetUnfolderBase]: For 128214/128214 co-relation queries the response was YES. [2023-08-27 12:31:53,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83627 conditions, 14121 events. 10051/14121 cut-off events. For 128214/128214 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 74533 event pairs, 1609 based on Foata normal form. 5/14126 useless extension candidates. Maximal degree in co-relation 81489. Up to 11194 conditions per place. [2023-08-27 12:31:53,403 INFO L140 encePairwiseOnDemand]: 234/242 looper letters, 389 selfloop transitions, 74 changer transitions 6/469 dead transitions. [2023-08-27 12:31:53,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 469 transitions, 5019 flow [2023-08-27 12:31:53,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-27 12:31:53,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-27 12:31:53,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1222 transitions. [2023-08-27 12:31:53,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42079889807162535 [2023-08-27 12:31:53,406 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1222 transitions. [2023-08-27 12:31:53,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1222 transitions. [2023-08-27 12:31:53,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 12:31:53,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1222 transitions. [2023-08-27 12:31:53,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 101.83333333333333) internal successors, (1222), 12 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:31:53,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 242.0) internal successors, (3146), 13 states have internal predecessors, (3146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:31:53,411 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 242.0) internal successors, (3146), 13 states have internal predecessors, (3146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:31:53,411 INFO L175 Difference]: Start difference. First operand has 116 places, 264 transitions, 2523 flow. Second operand 12 states and 1222 transitions. [2023-08-27 12:31:53,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 469 transitions, 5019 flow [2023-08-27 12:31:53,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 469 transitions, 4835 flow, removed 92 selfloop flow, removed 0 redundant places. [2023-08-27 12:31:53,843 INFO L231 Difference]: Finished difference. Result has 134 places, 329 transitions, 3372 flow [2023-08-27 12:31:53,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=2339, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3372, PETRI_PLACES=134, PETRI_TRANSITIONS=329} [2023-08-27 12:31:53,844 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 100 predicate places. [2023-08-27 12:31:53,844 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 329 transitions, 3372 flow [2023-08-27 12:31:53,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.36363636363636) internal successors, (994), 11 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:31:53,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 12:31:53,845 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 12:31:53,852 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-08-27 12:31:54,048 WARN L477 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-08-27 12:31:54,048 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-27 12:31:54,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 12:31:54,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1163900507, now seen corresponding path program 3 times [2023-08-27 12:31:54,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 12:31:54,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975219641] [2023-08-27 12:31:54,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 12:31:54,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 12:31:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 12:31:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 12:31:54,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 12:31:54,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975219641] [2023-08-27 12:31:54,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975219641] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 12:31:54,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305123116] [2023-08-27 12:31:54,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 12:31:54,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 12:31:54,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 12:31:54,176 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-08-27 12:31:54,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process Received shutdown request... [2023-08-27 12:36:23,160 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-27 12:36:23,174 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-08-27 12:36:24,185 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-08-27 12:36:24,360 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forcibly destroying the process [2023-08-27 12:36:24,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 137 [2023-08-27 12:36:24,367 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-27 12:36:24,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-08-27 12:36:24,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2023-08-27 12:36:24,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000179360] [2023-08-27 12:36:24,367 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-08-27 12:36:24,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 12:36:24,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 12:36:24,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 12:36:24,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 12:36:24,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 242 [2023-08-27 12:36:24,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 329 transitions, 3372 flow. Second operand has 6 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 12:36:24,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 12:36:24,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 242 [2023-08-27 12:36:24,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 12:36:24,371 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (4 of 5 remaining) [2023-08-27 12:36:24,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 12:36:24,371 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-27 12:36:24,372 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-08-27 12:36:24,372 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-27 12:36:24,372 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-27 12:36:24,372 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-08-27 12:36:24,372 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1] [2023-08-27 12:36:24,374 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 12:36:24,374 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 12:36:24,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 12:36:24 BasicIcfg [2023-08-27 12:36:24,376 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 12:36:24,376 INFO L158 Benchmark]: Toolchain (without parser) took 878377.34ms. Allocated memory was 356.5MB in the beginning and 528.5MB in the end (delta: 172.0MB). Free memory was 332.8MB in the beginning and 225.7MB in the end (delta: 107.0MB). Peak memory consumption was 279.5MB. Max. memory is 16.0GB. [2023-08-27 12:36:24,376 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 356.5MB. Free memory is still 333.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 12:36:24,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.27ms. Allocated memory is still 356.5MB. Free memory was 332.3MB in the beginning and 321.1MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-27 12:36:24,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.99ms. Allocated memory is still 356.5MB. Free memory was 321.1MB in the beginning and 319.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 12:36:24,377 INFO L158 Benchmark]: Boogie Preprocessor took 26.32ms. Allocated memory is still 356.5MB. Free memory was 319.6MB in the beginning and 318.1MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 12:36:24,377 INFO L158 Benchmark]: RCFGBuilder took 274.64ms. Allocated memory is still 356.5MB. Free memory was 318.1MB in the beginning and 302.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-08-27 12:36:24,377 INFO L158 Benchmark]: TraceAbstraction took 877824.70ms. Allocated memory was 356.5MB in the beginning and 528.5MB in the end (delta: 172.0MB). Free memory was 301.8MB in the beginning and 225.7MB in the end (delta: 76.1MB). Peak memory consumption was 248.0MB. Max. memory is 16.0GB. [2023-08-27 12:36:24,378 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 356.5MB. Free memory is still 333.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 210.27ms. Allocated memory is still 356.5MB. Free memory was 332.3MB in the beginning and 321.1MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 35.99ms. Allocated memory is still 356.5MB. Free memory was 321.1MB in the beginning and 319.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 26.32ms. Allocated memory is still 356.5MB. Free memory was 319.6MB in the beginning and 318.1MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 274.64ms. Allocated memory is still 356.5MB. Free memory was 318.1MB in the beginning and 302.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 877824.70ms. Allocated memory was 356.5MB in the beginning and 528.5MB in the end (delta: 172.0MB). Free memory was 301.8MB in the beginning and 225.7MB in the end (delta: 76.1MB). Peak memory consumption was 248.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 122 PlacesBefore, 34 PlacesAfterwards, 119 TransitionsBefore, 25 TransitionsAfterwards, 2160 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 8 ConcurrentYvCompositions, 6 ChoiceCompositions, 106 TotalNumberOfCompositions, 2179 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2179, independent: 2179, independent conditional: 0, independent unconditional: 2179, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1157, independent: 1157, independent conditional: 0, independent unconditional: 1157, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2179, independent: 1022, independent conditional: 0, independent unconditional: 1022, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1157, unknown conditional: 0, unknown unconditional: 1157] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 163 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: 877.7s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 456.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 110 mSolverCounterUnknown, 1037 SdHoareTripleChecker+Valid, 353.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1037 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 351.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3563 IncrementalHoareTripleChecker+Invalid, 3761 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 0 mSDtfsCounter, 3563 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 381 GetRequests, 267 SyntacticMatches, 9 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 188.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3372occurred in iteration=11, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 143.0s InterpolantComputationTime, 427 NumberOfCodeBlocks, 427 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 559 ConstructedInterpolants, 0 QuantifiedInterpolants, 18431 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1412 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 26 InterpolantComputations, 4 PerfectInterpolantSequences, 6/40 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