/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:47:30,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:47:31,008 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-SemanticLbe.epf [2023-11-17 11:47:31,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:47:31,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:47:31,041 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:47:31,041 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:47:31,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:47:31,042 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:47:31,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:47:31,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:47:31,047 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:47:31,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:47:31,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:47:31,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:47:31,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:47:31,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:47:31,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:47:31,049 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:47:31,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:47:31,049 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:47:31,050 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:47:31,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:47:31,051 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:47:31,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:47:31,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:47:31,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:47:31,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:47:31,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:47:31,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:47:31,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:47:31,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:47:31,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:47:31,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:47:31,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:47:31,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:47:31,301 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:47:31,301 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:47:31,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c [2023-11-17 11:47:32,453 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:47:32,633 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:47:32,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c [2023-11-17 11:47:32,639 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38f12533e/d5e1d65ccd4e450b915af47c2472ace0/FLAGe1af71435 [2023-11-17 11:47:32,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38f12533e/d5e1d65ccd4e450b915af47c2472ace0 [2023-11-17 11:47:32,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:47:32,655 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:47:32,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:47:32,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:47:32,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:47:32,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:47:32" (1/1) ... [2023-11-17 11:47:32,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e1d5056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:47:32, skipping insertion in model container [2023-11-17 11:47:32,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:47:32" (1/1) ... [2023-11-17 11:47:32,680 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:47:32,892 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c[2703,2716] [2023-11-17 11:47:32,903 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:47:32,912 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:47:32,948 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c[2703,2716] [2023-11-17 11:47:32,949 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:47:32,962 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:47:32,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:47:32 WrapperNode [2023-11-17 11:47:32,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:47:32,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:47:32,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:47:32,964 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:47:32,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:47:32" (1/1) ... [2023-11-17 11:47:32,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:47:32" (1/1) ... [2023-11-17 11:47:32,994 INFO L138 Inliner]: procedures = 22, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 131 [2023-11-17 11:47:32,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:47:32,995 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:47:32,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:47:32,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:47:33,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:47:32" (1/1) ... [2023-11-17 11:47:33,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:47:32" (1/1) ... [2023-11-17 11:47:33,006 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:47:32" (1/1) ... [2023-11-17 11:47:33,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:47:32" (1/1) ... [2023-11-17 11:47:33,013 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:47:32" (1/1) ... [2023-11-17 11:47:33,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:47:32" (1/1) ... [2023-11-17 11:47:33,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:47:32" (1/1) ... [2023-11-17 11:47:33,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:47:32" (1/1) ... [2023-11-17 11:47:33,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:47:33,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:47:33,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:47:33,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:47:33,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:47:32" (1/1) ... [2023-11-17 11:47:33,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:47:33,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:47:33,054 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 11:47:33,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 11:47:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:47:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 11:47:33,081 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 11:47:33,082 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 11:47:33,082 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 11:47:33,082 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 11:47:33,082 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 11:47:33,082 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-17 11:47:33,082 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-17 11:47:33,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:47:33,082 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-11-17 11:47:33,083 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-11-17 11:47:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-11-17 11:47:33,083 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-11-17 11:47:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:47:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:47:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:47:33,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:47:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 11:47:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:47:33,085 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:47:33,178 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:47:33,180 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:47:33,405 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:47:33,610 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:47:33,610 INFO L307 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-17 11:47:33,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:47:33 BoogieIcfgContainer [2023-11-17 11:47:33,612 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:47:33,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:47:33,614 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:47:33,617 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:47:33,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:47:32" (1/3) ... [2023-11-17 11:47:33,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e468da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:47:33, skipping insertion in model container [2023-11-17 11:47:33,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:47:32" (2/3) ... [2023-11-17 11:47:33,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e468da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:47:33, skipping insertion in model container [2023-11-17 11:47:33,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:47:33" (3/3) ... [2023-11-17 11:47:33,619 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3.wvr.c [2023-11-17 11:47:33,636 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:47:33,637 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 11:47:33,637 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:47:33,713 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-11-17 11:47:33,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 51 transitions, 144 flow [2023-11-17 11:47:33,789 INFO L124 PetriNetUnfolderBase]: 6/45 cut-off events. [2023-11-17 11:47:33,790 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-17 11:47:33,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 45 events. 6/45 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2023-11-17 11:47:33,816 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 51 transitions, 144 flow [2023-11-17 11:47:33,819 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 44 transitions, 124 flow [2023-11-17 11:47:33,822 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:47:33,839 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 44 transitions, 124 flow [2023-11-17 11:47:33,843 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 44 transitions, 124 flow [2023-11-17 11:47:33,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 44 transitions, 124 flow [2023-11-17 11:47:33,876 INFO L124 PetriNetUnfolderBase]: 6/44 cut-off events. [2023-11-17 11:47:33,876 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-17 11:47:33,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 44 events. 6/44 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2023-11-17 11:47:33,879 INFO L119 LiptonReduction]: Number of co-enabled transitions 666 [2023-11-17 11:47:33,941 INFO L134 LiptonReduction]: Checked pairs total: 528 [2023-11-17 11:47:33,941 INFO L136 LiptonReduction]: Total number of compositions: 1 [2023-11-17 11:47:33,955 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:47:33,960 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@74b374c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:47:33,961 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-17 11:47:33,972 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:47:33,972 INFO L124 PetriNetUnfolderBase]: 6/42 cut-off events. [2023-11-17 11:47:33,975 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-17 11:47:33,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:47:33,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:47:33,977 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:47:33,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:47:33,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1569536597, now seen corresponding path program 1 times [2023-11-17 11:47:33,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:47:33,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773518131] [2023-11-17 11:47:33,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:47:33,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:47:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:47:34,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:47:34,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:47:34,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773518131] [2023-11-17 11:47:34,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773518131] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:47:34,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:47:34,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:47:34,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423599500] [2023-11-17 11:47:34,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:47:34,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:47:34,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:47:34,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:47:34,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:47:34,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:47:34,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:34,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:47:34,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:47:34,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:47:36,758 INFO L124 PetriNetUnfolderBase]: 21341/24682 cut-off events. [2023-11-17 11:47:36,759 INFO L125 PetriNetUnfolderBase]: For 1387/1387 co-relation queries the response was YES. [2023-11-17 11:47:36,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50578 conditions, 24682 events. 21341/24682 cut-off events. For 1387/1387 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 79585 event pairs, 1773 based on Foata normal form. 1/13572 useless extension candidates. Maximal degree in co-relation 38647. Up to 23405 conditions per place. [2023-11-17 11:47:36,991 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 63 selfloop transitions, 7 changer transitions 1/77 dead transitions. [2023-11-17 11:47:36,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 77 transitions, 365 flow [2023-11-17 11:47:36,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:47:36,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:47:37,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-17 11:47:37,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7115384615384616 [2023-11-17 11:47:37,006 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-17 11:47:37,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-17 11:47:37,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:47:37,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-17 11:47:37,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:37,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:37,019 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:37,020 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 122 flow. Second operand 3 states and 111 transitions. [2023-11-17 11:47:37,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 77 transitions, 365 flow [2023-11-17 11:47:37,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 77 transitions, 319 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-11-17 11:47:37,051 INFO L231 Difference]: Finished difference. Result has 47 places, 49 transitions, 145 flow [2023-11-17 11:47:37,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=47, PETRI_TRANSITIONS=49} [2023-11-17 11:47:37,056 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -9 predicate places. [2023-11-17 11:47:37,057 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 49 transitions, 145 flow [2023-11-17 11:47:37,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:37,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:47:37,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:47:37,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:47:37,058 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:47:37,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:47:37,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1932557592, now seen corresponding path program 1 times [2023-11-17 11:47:37,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:47:37,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62216666] [2023-11-17 11:47:37,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:47:37,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:47:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:47:37,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:47:37,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:47:37,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62216666] [2023-11-17 11:47:37,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62216666] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:47:37,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:47:37,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:47:37,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712560089] [2023-11-17 11:47:37,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:47:37,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:47:37,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:47:37,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:47:37,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:47:37,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:47:37,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 49 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:37,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:47:37,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:47:37,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:47:39,762 INFO L124 PetriNetUnfolderBase]: 27899/32450 cut-off events. [2023-11-17 11:47:39,762 INFO L125 PetriNetUnfolderBase]: For 8359/8359 co-relation queries the response was YES. [2023-11-17 11:47:39,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80547 conditions, 32450 events. 27899/32450 cut-off events. For 8359/8359 co-relation queries the response was YES. Maximal size of possible extension queue 969. Compared 114327 event pairs, 1893 based on Foata normal form. 294/32672 useless extension candidates. Maximal degree in co-relation 21818. Up to 14321 conditions per place. [2023-11-17 11:47:40,029 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 116 selfloop transitions, 10 changer transitions 0/132 dead transitions. [2023-11-17 11:47:40,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 132 transitions, 633 flow [2023-11-17 11:47:40,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:47:40,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:47:40,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2023-11-17 11:47:40,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6961538461538461 [2023-11-17 11:47:40,032 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 181 transitions. [2023-11-17 11:47:40,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 181 transitions. [2023-11-17 11:47:40,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:47:40,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 181 transitions. [2023-11-17 11:47:40,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:40,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:40,035 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:40,035 INFO L175 Difference]: Start difference. First operand has 47 places, 49 transitions, 145 flow. Second operand 5 states and 181 transitions. [2023-11-17 11:47:40,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 132 transitions, 633 flow [2023-11-17 11:47:40,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 132 transitions, 621 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:47:40,039 INFO L231 Difference]: Finished difference. Result has 52 places, 56 transitions, 203 flow [2023-11-17 11:47:40,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=203, PETRI_PLACES=52, PETRI_TRANSITIONS=56} [2023-11-17 11:47:40,040 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -4 predicate places. [2023-11-17 11:47:40,040 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 56 transitions, 203 flow [2023-11-17 11:47:40,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:40,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:47:40,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:47:40,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:47:40,041 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:47:40,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:47:40,042 INFO L85 PathProgramCache]: Analyzing trace with hash -264870400, now seen corresponding path program 2 times [2023-11-17 11:47:40,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:47:40,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701222126] [2023-11-17 11:47:40,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:47:40,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:47:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:47:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:47:40,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:47:40,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701222126] [2023-11-17 11:47:40,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701222126] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:47:40,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:47:40,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:47:40,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860576971] [2023-11-17 11:47:40,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:47:40,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:47:40,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:47:40,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:47:40,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:47:40,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:47:40,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 56 transitions, 203 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:40,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:47:40,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:47:40,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:47:42,221 INFO L124 PetriNetUnfolderBase]: 26725/31322 cut-off events. [2023-11-17 11:47:42,222 INFO L125 PetriNetUnfolderBase]: For 20110/20110 co-relation queries the response was YES. [2023-11-17 11:47:42,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88444 conditions, 31322 events. 26725/31322 cut-off events. For 20110/20110 co-relation queries the response was YES. Maximal size of possible extension queue 957. Compared 114214 event pairs, 5591 based on Foata normal form. 646/31686 useless extension candidates. Maximal degree in co-relation 24190. Up to 16295 conditions per place. [2023-11-17 11:47:42,427 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 114 selfloop transitions, 10 changer transitions 0/130 dead transitions. [2023-11-17 11:47:42,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 130 transitions, 668 flow [2023-11-17 11:47:42,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:47:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:47:42,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2023-11-17 11:47:42,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6961538461538461 [2023-11-17 11:47:42,432 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 181 transitions. [2023-11-17 11:47:42,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 181 transitions. [2023-11-17 11:47:42,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:47:42,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 181 transitions. [2023-11-17 11:47:42,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:42,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:42,437 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:42,438 INFO L175 Difference]: Start difference. First operand has 52 places, 56 transitions, 203 flow. Second operand 5 states and 181 transitions. [2023-11-17 11:47:42,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 130 transitions, 668 flow [2023-11-17 11:47:42,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 130 transitions, 668 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:47:42,455 INFO L231 Difference]: Finished difference. Result has 58 places, 59 transitions, 257 flow [2023-11-17 11:47:42,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=257, PETRI_PLACES=58, PETRI_TRANSITIONS=59} [2023-11-17 11:47:42,457 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2023-11-17 11:47:42,457 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 59 transitions, 257 flow [2023-11-17 11:47:42,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:42,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:47:42,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:47:42,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:47:42,458 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:47:42,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:47:42,459 INFO L85 PathProgramCache]: Analyzing trace with hash -708064551, now seen corresponding path program 1 times [2023-11-17 11:47:42,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:47:42,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832916452] [2023-11-17 11:47:42,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:47:42,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:47:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:47:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:47:42,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:47:42,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832916452] [2023-11-17 11:47:42,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832916452] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:47:42,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:47:42,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:47:42,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566498276] [2023-11-17 11:47:42,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:47:42,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:47:42,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:47:42,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:47:42,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:47:42,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:47:42,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 59 transitions, 257 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:42,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:47:42,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:47:42,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:47:44,538 INFO L124 PetriNetUnfolderBase]: 26767/31318 cut-off events. [2023-11-17 11:47:44,538 INFO L125 PetriNetUnfolderBase]: For 37517/37517 co-relation queries the response was YES. [2023-11-17 11:47:44,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94392 conditions, 31318 events. 26767/31318 cut-off events. For 37517/37517 co-relation queries the response was YES. Maximal size of possible extension queue 958. Compared 114907 event pairs, 2135 based on Foata normal form. 486/31732 useless extension candidates. Maximal degree in co-relation 47609. Up to 13835 conditions per place. [2023-11-17 11:47:44,764 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 119 selfloop transitions, 8 changer transitions 0/133 dead transitions. [2023-11-17 11:47:44,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 133 transitions, 716 flow [2023-11-17 11:47:44,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:47:44,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:47:44,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2023-11-17 11:47:44,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2023-11-17 11:47:44,771 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 180 transitions. [2023-11-17 11:47:44,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 180 transitions. [2023-11-17 11:47:44,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:47:44,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 180 transitions. [2023-11-17 11:47:44,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:44,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:44,773 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:44,773 INFO L175 Difference]: Start difference. First operand has 58 places, 59 transitions, 257 flow. Second operand 5 states and 180 transitions. [2023-11-17 11:47:44,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 133 transitions, 716 flow [2023-11-17 11:47:44,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 133 transitions, 707 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-17 11:47:44,862 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 262 flow [2023-11-17 11:47:44,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=262, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2023-11-17 11:47:44,863 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places. [2023-11-17 11:47:44,864 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 262 flow [2023-11-17 11:47:44,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:44,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:47:44,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:47:44,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:47:44,865 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:47:44,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:47:44,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1087319732, now seen corresponding path program 1 times [2023-11-17 11:47:44,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:47:44,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490369601] [2023-11-17 11:47:44,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:47:44,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:47:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:47:45,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:47:45,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:47:45,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490369601] [2023-11-17 11:47:45,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490369601] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:47:45,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:47:45,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:47:45,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662927861] [2023-11-17 11:47:45,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:47:45,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:47:45,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:47:45,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:47:45,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:47:45,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:47:45,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 262 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:45,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:47:45,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:47:45,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:47:47,709 INFO L124 PetriNetUnfolderBase]: 36005/42945 cut-off events. [2023-11-17 11:47:47,710 INFO L125 PetriNetUnfolderBase]: For 70354/70354 co-relation queries the response was YES. [2023-11-17 11:47:47,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135313 conditions, 42945 events. 36005/42945 cut-off events. For 70354/70354 co-relation queries the response was YES. Maximal size of possible extension queue 1416. Compared 175931 event pairs, 5689 based on Foata normal form. 912/43531 useless extension candidates. Maximal degree in co-relation 67525. Up to 20703 conditions per place. [2023-11-17 11:47:47,960 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 150 selfloop transitions, 8 changer transitions 0/164 dead transitions. [2023-11-17 11:47:47,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 164 transitions, 1102 flow [2023-11-17 11:47:47,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:47:47,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:47:47,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 183 transitions. [2023-11-17 11:47:47,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7038461538461539 [2023-11-17 11:47:47,962 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 183 transitions. [2023-11-17 11:47:47,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 183 transitions. [2023-11-17 11:47:47,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:47:47,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 183 transitions. [2023-11-17 11:47:47,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:47,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:47,964 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:47,965 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 262 flow. Second operand 5 states and 183 transitions. [2023-11-17 11:47:47,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 164 transitions, 1102 flow [2023-11-17 11:47:47,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 164 transitions, 1075 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-17 11:47:47,987 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 308 flow [2023-11-17 11:47:47,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=308, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2023-11-17 11:47:47,990 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 12 predicate places. [2023-11-17 11:47:47,990 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 308 flow [2023-11-17 11:47:47,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:47,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:47:47,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:47:47,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:47:47,991 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:47:47,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:47:47,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1836949596, now seen corresponding path program 2 times [2023-11-17 11:47:47,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:47:47,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93358021] [2023-11-17 11:47:47,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:47:47,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:47:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:47:48,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:47:48,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:47:48,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93358021] [2023-11-17 11:47:48,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93358021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:47:48,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:47:48,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:47:48,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241695831] [2023-11-17 11:47:48,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:47:48,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:47:48,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:47:48,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:47:48,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:47:48,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:47:48,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 308 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:48,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:47:48,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:47:48,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:47:50,293 INFO L124 PetriNetUnfolderBase]: 31831/37759 cut-off events. [2023-11-17 11:47:50,293 INFO L125 PetriNetUnfolderBase]: For 70501/70501 co-relation queries the response was YES. [2023-11-17 11:47:50,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135028 conditions, 37759 events. 31831/37759 cut-off events. For 70501/70501 co-relation queries the response was YES. Maximal size of possible extension queue 1227. Compared 146860 event pairs, 2108 based on Foata normal form. 488/38137 useless extension candidates. Maximal degree in co-relation 85475. Up to 16759 conditions per place. [2023-11-17 11:47:50,595 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 150 selfloop transitions, 11 changer transitions 0/167 dead transitions. [2023-11-17 11:47:50,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 167 transitions, 1168 flow [2023-11-17 11:47:50,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:47:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:47:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 177 transitions. [2023-11-17 11:47:50,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6807692307692308 [2023-11-17 11:47:50,596 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 177 transitions. [2023-11-17 11:47:50,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 177 transitions. [2023-11-17 11:47:50,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:47:50,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 177 transitions. [2023-11-17 11:47:50,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:50,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:50,603 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:50,603 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 308 flow. Second operand 5 states and 177 transitions. [2023-11-17 11:47:50,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 167 transitions, 1168 flow [2023-11-17 11:47:50,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 167 transitions, 1168 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:47:50,749 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 369 flow [2023-11-17 11:47:50,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=369, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2023-11-17 11:47:50,749 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 17 predicate places. [2023-11-17 11:47:50,750 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 369 flow [2023-11-17 11:47:50,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:50,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:47:50,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:47:50,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:47:50,750 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:47:50,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:47:50,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1850321728, now seen corresponding path program 1 times [2023-11-17 11:47:50,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:47:50,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519234523] [2023-11-17 11:47:50,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:47:50,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:47:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:47:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:47:50,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:47:50,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519234523] [2023-11-17 11:47:50,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519234523] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:47:50,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384170014] [2023-11-17 11:47:50,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:47:50,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:47:50,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:47:50,862 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:47:50,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-17 11:47:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:47:51,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 11:47:51,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:47:51,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:47:51,230 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:47:51,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:47:51,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384170014] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:47:51,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:47:51,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-11-17 11:47:51,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197720567] [2023-11-17 11:47:51,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:47:51,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:47:51,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:47:51,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:47:51,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:47:51,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:47:51,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 369 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:51,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:47:51,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:47:51,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:47:54,706 INFO L124 PetriNetUnfolderBase]: 41941/50801 cut-off events. [2023-11-17 11:47:54,706 INFO L125 PetriNetUnfolderBase]: For 141163/141163 co-relation queries the response was YES. [2023-11-17 11:47:54,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198137 conditions, 50801 events. 41941/50801 cut-off events. For 141163/141163 co-relation queries the response was YES. Maximal size of possible extension queue 1814. Compared 226721 event pairs, 6487 based on Foata normal form. 976/51119 useless extension candidates. Maximal degree in co-relation 123315. Up to 22832 conditions per place. [2023-11-17 11:47:55,021 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 179 selfloop transitions, 8 changer transitions 0/193 dead transitions. [2023-11-17 11:47:55,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 193 transitions, 1493 flow [2023-11-17 11:47:55,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:47:55,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:47:55,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2023-11-17 11:47:55,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6730769230769231 [2023-11-17 11:47:55,024 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 175 transitions. [2023-11-17 11:47:55,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 175 transitions. [2023-11-17 11:47:55,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:47:55,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 175 transitions. [2023-11-17 11:47:55,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:55,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:55,025 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:55,026 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 369 flow. Second operand 5 states and 175 transitions. [2023-11-17 11:47:55,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 193 transitions, 1493 flow [2023-11-17 11:47:55,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 193 transitions, 1453 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-11-17 11:47:55,084 INFO L231 Difference]: Finished difference. Result has 79 places, 73 transitions, 411 flow [2023-11-17 11:47:55,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=411, PETRI_PLACES=79, PETRI_TRANSITIONS=73} [2023-11-17 11:47:55,085 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 23 predicate places. [2023-11-17 11:47:55,085 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 73 transitions, 411 flow [2023-11-17 11:47:55,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:55,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:47:55,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:47:55,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-17 11:47:55,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:47:55,291 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:47:55,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:47:55,294 INFO L85 PathProgramCache]: Analyzing trace with hash 910567781, now seen corresponding path program 1 times [2023-11-17 11:47:55,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:47:55,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936811204] [2023-11-17 11:47:55,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:47:55,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:47:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:47:55,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:47:55,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:47:55,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936811204] [2023-11-17 11:47:55,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936811204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:47:55,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:47:55,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:47:55,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848142002] [2023-11-17 11:47:55,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:47:55,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:47:55,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:47:55,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:47:55,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:47:55,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:47:55,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 73 transitions, 411 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:55,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:47:55,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:47:55,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:47:58,818 INFO L124 PetriNetUnfolderBase]: 41233/49721 cut-off events. [2023-11-17 11:47:58,818 INFO L125 PetriNetUnfolderBase]: For 144662/144734 co-relation queries the response was YES. [2023-11-17 11:47:58,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213185 conditions, 49721 events. 41233/49721 cut-off events. For 144662/144734 co-relation queries the response was YES. Maximal size of possible extension queue 1771. Compared 218753 event pairs, 2323 based on Foata normal form. 720/50335 useless extension candidates. Maximal degree in co-relation 132709. Up to 22481 conditions per place. [2023-11-17 11:47:59,281 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 171 selfloop transitions, 8 changer transitions 0/185 dead transitions. [2023-11-17 11:47:59,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 185 transitions, 1407 flow [2023-11-17 11:47:59,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:47:59,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:47:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2023-11-17 11:47:59,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.676923076923077 [2023-11-17 11:47:59,282 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 176 transitions. [2023-11-17 11:47:59,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 176 transitions. [2023-11-17 11:47:59,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:47:59,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 176 transitions. [2023-11-17 11:47:59,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:59,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:59,283 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:59,284 INFO L175 Difference]: Start difference. First operand has 79 places, 73 transitions, 411 flow. Second operand 5 states and 176 transitions. [2023-11-17 11:47:59,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 185 transitions, 1407 flow [2023-11-17 11:47:59,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 185 transitions, 1407 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:47:59,611 INFO L231 Difference]: Finished difference. Result has 84 places, 72 transitions, 427 flow [2023-11-17 11:47:59,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=427, PETRI_PLACES=84, PETRI_TRANSITIONS=72} [2023-11-17 11:47:59,612 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 28 predicate places. [2023-11-17 11:47:59,612 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 72 transitions, 427 flow [2023-11-17 11:47:59,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:59,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:47:59,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:47:59,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:47:59,612 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:47:59,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:47:59,613 INFO L85 PathProgramCache]: Analyzing trace with hash 786179843, now seen corresponding path program 1 times [2023-11-17 11:47:59,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:47:59,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781731187] [2023-11-17 11:47:59,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:47:59,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:47:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:47:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:47:59,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:47:59,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781731187] [2023-11-17 11:47:59,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781731187] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:47:59,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:47:59,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:47:59,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297127740] [2023-11-17 11:47:59,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:47:59,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:47:59,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:47:59,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:47:59,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:47:59,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:47:59,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 72 transitions, 427 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:47:59,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:47:59,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:47:59,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:48:02,904 INFO L124 PetriNetUnfolderBase]: 40741/49445 cut-off events. [2023-11-17 11:48:02,905 INFO L125 PetriNetUnfolderBase]: For 170755/170755 co-relation queries the response was YES. [2023-11-17 11:48:03,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218332 conditions, 49445 events. 40741/49445 cut-off events. For 170755/170755 co-relation queries the response was YES. Maximal size of possible extension queue 1784. Compared 217441 event pairs, 1967 based on Foata normal form. 492/49579 useless extension candidates. Maximal degree in co-relation 136017. Up to 21632 conditions per place. [2023-11-17 11:48:03,239 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 184 selfloop transitions, 10 changer transitions 0/200 dead transitions. [2023-11-17 11:48:03,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 200 transitions, 1648 flow [2023-11-17 11:48:03,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:48:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:48:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2023-11-17 11:48:03,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6653846153846154 [2023-11-17 11:48:03,240 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 173 transitions. [2023-11-17 11:48:03,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 173 transitions. [2023-11-17 11:48:03,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:48:03,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 173 transitions. [2023-11-17 11:48:03,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:03,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:03,242 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:03,242 INFO L175 Difference]: Start difference. First operand has 84 places, 72 transitions, 427 flow. Second operand 5 states and 173 transitions. [2023-11-17 11:48:03,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 200 transitions, 1648 flow [2023-11-17 11:48:03,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 200 transitions, 1611 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-11-17 11:48:03,768 INFO L231 Difference]: Finished difference. Result has 88 places, 77 transitions, 479 flow [2023-11-17 11:48:03,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=479, PETRI_PLACES=88, PETRI_TRANSITIONS=77} [2023-11-17 11:48:03,769 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 32 predicate places. [2023-11-17 11:48:03,769 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 77 transitions, 479 flow [2023-11-17 11:48:03,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:03,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:48:03,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:48:03,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:48:03,771 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:48:03,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:48:03,771 INFO L85 PathProgramCache]: Analyzing trace with hash 592682885, now seen corresponding path program 2 times [2023-11-17 11:48:03,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:48:03,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036395944] [2023-11-17 11:48:03,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:48:03,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:48:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:48:03,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:48:03,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:48:03,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036395944] [2023-11-17 11:48:03,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036395944] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:48:03,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:48:03,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:48:03,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393974548] [2023-11-17 11:48:03,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:48:03,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:48:03,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:48:03,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:48:03,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:48:03,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:48:03,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 77 transitions, 479 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:03,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:48:03,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:48:03,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:48:07,259 INFO L124 PetriNetUnfolderBase]: 39773/48621 cut-off events. [2023-11-17 11:48:07,259 INFO L125 PetriNetUnfolderBase]: For 160225/160225 co-relation queries the response was YES. [2023-11-17 11:48:07,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221766 conditions, 48621 events. 39773/48621 cut-off events. For 160225/160225 co-relation queries the response was YES. Maximal size of possible extension queue 1731. Compared 222199 event pairs, 6227 based on Foata normal form. 968/49087 useless extension candidates. Maximal degree in co-relation 143999. Up to 28049 conditions per place. [2023-11-17 11:48:07,602 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 177 selfloop transitions, 10 changer transitions 0/193 dead transitions. [2023-11-17 11:48:07,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 193 transitions, 1586 flow [2023-11-17 11:48:07,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:48:07,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:48:07,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2023-11-17 11:48:07,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65 [2023-11-17 11:48:07,603 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 169 transitions. [2023-11-17 11:48:07,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 169 transitions. [2023-11-17 11:48:07,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:48:07,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 169 transitions. [2023-11-17 11:48:07,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:07,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:07,605 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:07,605 INFO L175 Difference]: Start difference. First operand has 88 places, 77 transitions, 479 flow. Second operand 5 states and 169 transitions. [2023-11-17 11:48:07,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 193 transitions, 1586 flow [2023-11-17 11:48:08,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 193 transitions, 1571 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-17 11:48:08,182 INFO L231 Difference]: Finished difference. Result has 93 places, 80 transitions, 518 flow [2023-11-17 11:48:08,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=518, PETRI_PLACES=93, PETRI_TRANSITIONS=80} [2023-11-17 11:48:08,182 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 37 predicate places. [2023-11-17 11:48:08,183 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 80 transitions, 518 flow [2023-11-17 11:48:08,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:08,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:48:08,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:48:08,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 11:48:08,183 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:48:08,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:48:08,184 INFO L85 PathProgramCache]: Analyzing trace with hash -382920012, now seen corresponding path program 2 times [2023-11-17 11:48:08,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:48:08,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292633074] [2023-11-17 11:48:08,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:48:08,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:48:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:48:08,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:48:08,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:48:08,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292633074] [2023-11-17 11:48:08,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292633074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:48:08,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:48:08,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:48:08,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787642862] [2023-11-17 11:48:08,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:48:08,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:48:08,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:48:08,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:48:08,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:48:08,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:48:08,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 80 transitions, 518 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:08,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:48:08,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:48:08,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:48:11,269 INFO L124 PetriNetUnfolderBase]: 35409/43129 cut-off events. [2023-11-17 11:48:11,269 INFO L125 PetriNetUnfolderBase]: For 151097/151097 co-relation queries the response was YES. [2023-11-17 11:48:11,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204729 conditions, 43129 events. 35409/43129 cut-off events. For 151097/151097 co-relation queries the response was YES. Maximal size of possible extension queue 1487. Compared 187152 event pairs, 1983 based on Foata normal form. 484/43255 useless extension candidates. Maximal degree in co-relation 180883. Up to 19060 conditions per place. [2023-11-17 11:48:11,534 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 185 selfloop transitions, 9 changer transitions 0/200 dead transitions. [2023-11-17 11:48:11,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 200 transitions, 1665 flow [2023-11-17 11:48:11,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:48:11,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:48:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 172 transitions. [2023-11-17 11:48:11,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6615384615384615 [2023-11-17 11:48:11,535 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 172 transitions. [2023-11-17 11:48:11,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 172 transitions. [2023-11-17 11:48:11,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:48:11,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 172 transitions. [2023-11-17 11:48:11,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:11,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:11,536 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:11,536 INFO L175 Difference]: Start difference. First operand has 93 places, 80 transitions, 518 flow. Second operand 5 states and 172 transitions. [2023-11-17 11:48:11,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 200 transitions, 1665 flow [2023-11-17 11:48:12,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 200 transitions, 1645 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-11-17 11:48:12,158 INFO L231 Difference]: Finished difference. Result has 96 places, 79 transitions, 513 flow [2023-11-17 11:48:12,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=513, PETRI_PLACES=96, PETRI_TRANSITIONS=79} [2023-11-17 11:48:12,159 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 40 predicate places. [2023-11-17 11:48:12,159 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 79 transitions, 513 flow [2023-11-17 11:48:12,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:12,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:48:12,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:48:12,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 11:48:12,160 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:48:12,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:48:12,161 INFO L85 PathProgramCache]: Analyzing trace with hash -907508477, now seen corresponding path program 2 times [2023-11-17 11:48:12,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:48:12,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893828890] [2023-11-17 11:48:12,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:48:12,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:48:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:48:12,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:48:12,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:48:12,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893828890] [2023-11-17 11:48:12,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893828890] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:48:12,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:48:12,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:48:12,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168281423] [2023-11-17 11:48:12,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:48:12,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:48:12,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:48:12,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:48:12,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:48:12,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:48:12,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 79 transitions, 513 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:12,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:48:12,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:48:12,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:48:15,153 INFO L124 PetriNetUnfolderBase]: 34257/41917 cut-off events. [2023-11-17 11:48:15,153 INFO L125 PetriNetUnfolderBase]: For 159697/159985 co-relation queries the response was YES. [2023-11-17 11:48:15,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201606 conditions, 41917 events. 34257/41917 cut-off events. For 159697/159985 co-relation queries the response was YES. Maximal size of possible extension queue 1437. Compared 190370 event pairs, 7063 based on Foata normal form. 1200/42867 useless extension candidates. Maximal degree in co-relation 177096. Up to 23245 conditions per place. [2023-11-17 11:48:15,606 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 193 selfloop transitions, 8 changer transitions 0/207 dead transitions. [2023-11-17 11:48:15,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 207 transitions, 1773 flow [2023-11-17 11:48:15,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:48:15,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:48:15,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2023-11-17 11:48:15,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6653846153846154 [2023-11-17 11:48:15,608 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 173 transitions. [2023-11-17 11:48:15,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 173 transitions. [2023-11-17 11:48:15,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:48:15,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 173 transitions. [2023-11-17 11:48:15,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:15,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:15,610 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:15,610 INFO L175 Difference]: Start difference. First operand has 96 places, 79 transitions, 513 flow. Second operand 5 states and 173 transitions. [2023-11-17 11:48:15,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 207 transitions, 1773 flow [2023-11-17 11:48:16,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 207 transitions, 1738 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-11-17 11:48:16,025 INFO L231 Difference]: Finished difference. Result has 101 places, 82 transitions, 553 flow [2023-11-17 11:48:16,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=553, PETRI_PLACES=101, PETRI_TRANSITIONS=82} [2023-11-17 11:48:16,026 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 45 predicate places. [2023-11-17 11:48:16,026 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 82 transitions, 553 flow [2023-11-17 11:48:16,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:16,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:48:16,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:48:16,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 11:48:16,026 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:48:16,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:48:16,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1033960727, now seen corresponding path program 2 times [2023-11-17 11:48:16,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:48:16,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067464117] [2023-11-17 11:48:16,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:48:16,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:48:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:48:16,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:48:16,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:48:16,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067464117] [2023-11-17 11:48:16,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067464117] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:48:16,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580901951] [2023-11-17 11:48:16,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 11:48:16,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:48:16,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:48:16,116 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:48:16,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-17 11:48:16,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 11:48:16,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:48:16,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 11:48:16,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:48:16,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:48:16,331 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:48:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:48:16,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580901951] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:48:16,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:48:16,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-11-17 11:48:16,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988948216] [2023-11-17 11:48:16,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:48:16,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:48:16,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:48:16,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:48:16,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:48:16,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:48:16,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 82 transitions, 553 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:16,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:48:16,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:48:16,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:48:19,417 INFO L124 PetriNetUnfolderBase]: 33421/41024 cut-off events. [2023-11-17 11:48:19,417 INFO L125 PetriNetUnfolderBase]: For 176531/176787 co-relation queries the response was YES. [2023-11-17 11:48:19,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206644 conditions, 41024 events. 33421/41024 cut-off events. For 176531/176787 co-relation queries the response was YES. Maximal size of possible extension queue 1396. Compared 189473 event pairs, 10579 based on Foata normal form. 876/41682 useless extension candidates. Maximal degree in co-relation 186029. Up to 23061 conditions per place. [2023-11-17 11:48:19,857 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 209 selfloop transitions, 8 changer transitions 0/223 dead transitions. [2023-11-17 11:48:19,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 223 transitions, 1943 flow [2023-11-17 11:48:19,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:48:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:48:19,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 177 transitions. [2023-11-17 11:48:19,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6807692307692308 [2023-11-17 11:48:19,858 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 177 transitions. [2023-11-17 11:48:19,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 177 transitions. [2023-11-17 11:48:19,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:48:19,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 177 transitions. [2023-11-17 11:48:19,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:19,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:19,859 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:19,859 INFO L175 Difference]: Start difference. First operand has 101 places, 82 transitions, 553 flow. Second operand 5 states and 177 transitions. [2023-11-17 11:48:19,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 223 transitions, 1943 flow [2023-11-17 11:48:20,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 223 transitions, 1881 flow, removed 20 selfloop flow, removed 2 redundant places. [2023-11-17 11:48:20,125 INFO L231 Difference]: Finished difference. Result has 105 places, 85 transitions, 590 flow [2023-11-17 11:48:20,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=590, PETRI_PLACES=105, PETRI_TRANSITIONS=85} [2023-11-17 11:48:20,126 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 49 predicate places. [2023-11-17 11:48:20,126 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 85 transitions, 590 flow [2023-11-17 11:48:20,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:48:20,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:48:20,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:48:20,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-17 11:48:20,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-17 11:48:20,327 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:48:20,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:48:20,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1519285190, now seen corresponding path program 1 times [2023-11-17 11:48:20,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:48:20,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141151508] [2023-11-17 11:48:20,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:48:20,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:48:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:48:21,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:48:21,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:48:21,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141151508] [2023-11-17 11:48:21,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141151508] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:48:21,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368114159] [2023-11-17 11:48:21,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:48:21,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:48:21,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:48:21,101 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:48:21,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-17 11:48:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:48:21,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-17 11:48:21,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:48:57,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:48:57,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:49:21,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:49:21,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368114159] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:49:21,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:49:21,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-11-17 11:49:21,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358516273] [2023-11-17 11:49:21,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:49:21,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-17 11:49:21,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:49:21,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-17 11:49:21,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=168, Unknown=22, NotChecked=0, Total=240 [2023-11-17 11:49:21,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:49:21,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 85 transitions, 590 flow. Second operand has 16 states, 16 states have (on average 18.375) internal successors, (294), 16 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:49:21,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:49:21,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:49:21,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:49:24,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-11-17 11:49:25,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:42,636 WARN L293 SmtUtils]: Spent 13.14s on a formula simplification. DAG size of input: 84 DAG size of output: 69 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 11:49:44,737 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-11-17 11:49:46,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:47,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:50,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-11-17 11:49:52,972 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-11-17 11:49:55,495 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-11-17 11:49:56,627 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-11-17 11:50:11,552 WARN L293 SmtUtils]: Spent 10.42s on a formula simplification. DAG size of input: 101 DAG size of output: 59 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 11:50:14,974 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-11-17 11:50:17,266 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-11-17 11:50:19,274 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-11-17 11:50:21,526 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-11-17 11:50:24,459 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-11-17 11:50:26,493 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-11-17 11:50:30,269 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-11-17 11:50:39,866 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-11-17 11:50:42,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:50:44,127 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-11-17 11:50:46,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:50:48,525 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-11-17 11:50:50,751 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-11-17 11:50:52,862 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-11-17 11:50:53,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:50:55,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:50:57,793 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-11-17 11:50:59,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:01,529 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-11-17 11:51:02,573 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-11-17 11:51:04,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:05,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:07,798 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-11-17 11:51:08,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:11,826 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-11-17 11:51:13,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:15,651 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-11-17 11:51:17,655 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-11-17 11:51:19,659 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-11-17 11:51:26,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:29,821 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-11-17 11:51:31,833 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-11-17 11:51:34,196 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-11-17 11:51:35,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:37,803 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-11-17 11:51:39,816 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-11-17 11:51:41,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:45,425 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-11-17 11:51:47,483 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-11-17 11:51:53,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:57,623 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-11-17 11:51:59,892 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-11-17 11:52:03,092 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-11-17 11:52:04,557 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-11-17 11:52:09,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:11,178 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-11-17 11:52:14,494 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-11-17 11:52:16,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:20,676 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-11-17 11:52:22,682 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-11-17 11:52:26,803 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-11-17 11:52:30,800 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-11-17 11:52:35,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:43,308 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-11-17 11:52:44,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:47,701 INFO L124 PetriNetUnfolderBase]: 39223/48238 cut-off events. [2023-11-17 11:52:47,701 INFO L125 PetriNetUnfolderBase]: For 194880/194880 co-relation queries the response was YES. [2023-11-17 11:52:47,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245039 conditions, 48238 events. 39223/48238 cut-off events. For 194880/194880 co-relation queries the response was YES. Maximal size of possible extension queue 1641. Compared 226638 event pairs, 6657 based on Foata normal form. 90/48258 useless extension candidates. Maximal degree in co-relation 223843. Up to 40835 conditions per place. [2023-11-17 11:52:48,097 INFO L140 encePairwiseOnDemand]: 42/52 looper letters, 304 selfloop transitions, 79 changer transitions 9/398 dead transitions. [2023-11-17 11:52:48,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 398 transitions, 3162 flow [2023-11-17 11:52:48,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 11:52:48,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-17 11:52:48,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 444 transitions. [2023-11-17 11:52:48,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7115384615384616 [2023-11-17 11:52:48,100 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 444 transitions. [2023-11-17 11:52:48,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 444 transitions. [2023-11-17 11:52:48,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:52:48,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 444 transitions. [2023-11-17 11:52:48,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 37.0) internal successors, (444), 12 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:52:48,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 52.0) internal successors, (676), 13 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:52:48,102 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 52.0) internal successors, (676), 13 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:52:48,102 INFO L175 Difference]: Start difference. First operand has 105 places, 85 transitions, 590 flow. Second operand 12 states and 444 transitions. [2023-11-17 11:52:48,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 398 transitions, 3162 flow [2023-11-17 11:52:48,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 398 transitions, 3115 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-11-17 11:52:48,704 INFO L231 Difference]: Finished difference. Result has 122 places, 157 transitions, 1575 flow [2023-11-17 11:52:48,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1575, PETRI_PLACES=122, PETRI_TRANSITIONS=157} [2023-11-17 11:52:48,705 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 66 predicate places. [2023-11-17 11:52:48,705 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 157 transitions, 1575 flow [2023-11-17 11:52:48,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 18.375) internal successors, (294), 16 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:52:48,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:52:48,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:52:48,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-17 11:52:48,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:52:48,906 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:52:48,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:52:48,906 INFO L85 PathProgramCache]: Analyzing trace with hash 39966572, now seen corresponding path program 1 times [2023-11-17 11:52:48,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:52:48,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929221991] [2023-11-17 11:52:48,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:52:48,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:52:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:52:49,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:52:49,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:52:49,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929221991] [2023-11-17 11:52:49,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929221991] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:52:49,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074087389] [2023-11-17 11:52:49,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:52:49,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:52:49,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:52:49,500 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:52:49,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-17 11:52:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:52:50,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-17 11:52:50,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:53:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:53:11,500 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:53:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:53:19,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074087389] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:53:19,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:53:19,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-11-17 11:53:19,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028338124] [2023-11-17 11:53:19,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:53:19,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-17 11:53:19,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:53:19,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-17 11:53:19,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=168, Unknown=7, NotChecked=0, Total=240 [2023-11-17 11:53:19,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:53:19,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 157 transitions, 1575 flow. Second operand has 16 states, 16 states have (on average 18.4375) internal successors, (295), 16 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:53:19,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:53:19,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:53:19,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:53:23,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-11-17 11:53:26,441 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-11-17 11:53:28,984 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-11-17 11:53:37,499 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-11-17 11:53:39,815 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-11-17 11:53:41,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:53:43,911 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-11-17 11:53:45,920 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-11-17 11:53:47,926 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-11-17 11:53:49,930 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-11-17 11:53:51,937 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-11-17 11:53:53,953 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-11-17 11:53:55,957 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-11-17 11:53:57,960 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-11-17 11:53:59,967 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-11-17 11:54:01,976 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-11-17 11:54:03,982 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-11-17 11:54:05,986 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-11-17 11:54:10,844 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-11-17 11:54:12,946 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-11-17 11:54:14,369 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-11-17 11:54:16,469 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-11-17 11:54:18,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-11-17 11:54:22,324 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-11-17 11:54:24,331 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-11-17 11:54:27,573 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-11-17 11:54:29,581 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-11-17 11:54:32,242 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-11-17 11:54:34,256 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-11-17 11:54:36,900 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-11-17 11:54:38,998 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-11-17 11:54:41,390 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-11-17 11:54:43,470 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-11-17 11:54:47,356 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-11-17 11:54:49,391 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-11-17 11:54:50,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:54:53,794 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-11-17 11:54:57,199 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-11-17 11:55:01,547 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-11-17 11:55:03,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-11-17 11:55:05,603 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-11-17 11:55:07,607 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-11-17 11:55:08,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:55:10,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:55:13,343 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-11-17 11:55:15,958 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-11-17 11:55:17,967 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-11-17 11:55:20,221 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-11-17 11:55:22,501 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-11-17 11:55:23,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:55:25,966 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-11-17 11:55:28,024 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-11-17 11:55:31,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-11-17 11:55:34,425 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-11-17 11:55:37,541 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-11-17 11:55:39,721 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-11-17 11:55:42,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:55:46,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:55:51,110 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-11-17 11:55:52,872 INFO L124 PetriNetUnfolderBase]: 54067/66927 cut-off events. [2023-11-17 11:55:52,872 INFO L125 PetriNetUnfolderBase]: For 336648/336648 co-relation queries the response was YES. [2023-11-17 11:55:53,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381000 conditions, 66927 events. 54067/66927 cut-off events. For 336648/336648 co-relation queries the response was YES. Maximal size of possible extension queue 2327. Compared 335723 event pairs, 3521 based on Foata normal form. 3/66860 useless extension candidates. Maximal degree in co-relation 369298. Up to 51777 conditions per place. [2023-11-17 11:55:53,610 INFO L140 encePairwiseOnDemand]: 42/52 looper letters, 507 selfloop transitions, 156 changer transitions 12/681 dead transitions. [2023-11-17 11:55:53,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 681 transitions, 6272 flow [2023-11-17 11:55:53,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-17 11:55:53,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-17 11:55:53,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 626 transitions. [2023-11-17 11:55:53,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7524038461538461 [2023-11-17 11:55:53,612 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 626 transitions. [2023-11-17 11:55:53,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 626 transitions. [2023-11-17 11:55:53,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:55:53,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 626 transitions. [2023-11-17 11:55:53,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 39.125) internal successors, (626), 16 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:55:53,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 52.0) internal successors, (884), 17 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:55:53,616 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 52.0) internal successors, (884), 17 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:55:53,616 INFO L175 Difference]: Start difference. First operand has 122 places, 157 transitions, 1575 flow. Second operand 16 states and 626 transitions. [2023-11-17 11:55:53,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 681 transitions, 6272 flow [2023-11-17 11:55:55,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 681 transitions, 6175 flow, removed 45 selfloop flow, removed 1 redundant places. [2023-11-17 11:55:55,321 INFO L231 Difference]: Finished difference. Result has 146 places, 309 transitions, 3675 flow [2023-11-17 11:55:55,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1478, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3675, PETRI_PLACES=146, PETRI_TRANSITIONS=309} [2023-11-17 11:55:55,321 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 90 predicate places. [2023-11-17 11:55:55,322 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 309 transitions, 3675 flow [2023-11-17 11:55:55,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 18.4375) internal successors, (295), 16 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:55:55,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:55:55,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:55:55,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-17 11:55:55,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-17 11:55:55,523 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:55:55,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:55:55,523 INFO L85 PathProgramCache]: Analyzing trace with hash 488443274, now seen corresponding path program 1 times [2023-11-17 11:55:55,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:55:55,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948617077] [2023-11-17 11:55:55,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:55:55,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:55:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:55:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:55:57,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:55:57,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948617077] [2023-11-17 11:55:57,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948617077] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:55:57,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710242899] [2023-11-17 11:55:57,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:55:57,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:55:57,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:55:57,113 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:55:57,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-17 11:55:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:55:57,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-17 11:55:57,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:56:11,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:56:11,388 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:56:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:56:13,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710242899] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:56:13,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:56:13,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-11-17 11:56:13,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323144229] [2023-11-17 11:56:13,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:56:13,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-17 11:56:13,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:56:13,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-17 11:56:13,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=168, Unknown=1, NotChecked=0, Total=240 [2023-11-17 11:56:13,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2023-11-17 11:56:13,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 309 transitions, 3675 flow. Second operand has 16 states, 16 states have (on average 18.9375) internal successors, (303), 16 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:56:13,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:56:13,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2023-11-17 11:56:13,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:56:16,136 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-11-17 11:56:21,025 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-11-17 11:56:22,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:56:31,499 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-11-17 11:56:34,677 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-11-17 11:56:36,827 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-11-17 11:56:38,895 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-11-17 11:56:41,276 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-11-17 11:56:43,281 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 [] Received shutdown request... [2023-11-17 11:56:43,445 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 11:56:43,445 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 11:56:44,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-17 11:56:44,645 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-11-17 11:56:44,652 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-17 11:56:44,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-11-17 11:56:44,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-17 11:56:44,653 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-11-17 11:56:44,654 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2023-11-17 11:56:44,654 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-17 11:56:44,654 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-17 11:56:44,654 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-17 11:56:44,654 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-17 11:56:44,654 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2023-11-17 11:56:44,655 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2023-11-17 11:56:44,657 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:56:44,657 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:56:44,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:56:44 BasicIcfg [2023-11-17 11:56:44,659 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:56:44,659 INFO L158 Benchmark]: Toolchain (without parser) took 552004.38ms. Allocated memory was 371.2MB in the beginning and 7.9GB in the end (delta: 7.5GB). Free memory was 318.4MB in the beginning and 6.4GB in the end (delta: -6.1GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2023-11-17 11:56:44,659 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 205.5MB. Free memory is still 152.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:56:44,660 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.99ms. Allocated memory is still 371.2MB. Free memory was 318.4MB in the beginning and 306.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 11:56:44,660 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.76ms. Allocated memory is still 371.2MB. Free memory was 306.9MB in the beginning and 304.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:56:44,660 INFO L158 Benchmark]: Boogie Preprocessor took 29.41ms. Allocated memory is still 371.2MB. Free memory was 304.8MB in the beginning and 303.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:56:44,660 INFO L158 Benchmark]: RCFGBuilder took 587.29ms. Allocated memory is still 371.2MB. Free memory was 303.2MB in the beginning and 259.2MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. [2023-11-17 11:56:44,660 INFO L158 Benchmark]: TraceAbstraction took 551044.96ms. Allocated memory was 371.2MB in the beginning and 7.9GB in the end (delta: 7.5GB). Free memory was 258.6MB in the beginning and 6.4GB in the end (delta: -6.2GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-11-17 11:56:44,661 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.13ms. Allocated memory is still 205.5MB. Free memory is still 152.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 306.99ms. Allocated memory is still 371.2MB. Free memory was 318.4MB in the beginning and 306.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.76ms. Allocated memory is still 371.2MB. Free memory was 306.9MB in the beginning and 304.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.41ms. Allocated memory is still 371.2MB. Free memory was 304.8MB in the beginning and 303.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 587.29ms. Allocated memory is still 371.2MB. Free memory was 303.2MB in the beginning and 259.2MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. * TraceAbstraction took 551044.96ms. Allocated memory was 371.2MB in the beginning and 7.9GB in the end (delta: 7.5GB). Free memory was 258.6MB in the beginning and 6.4GB in the end (delta: -6.2GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 57 PlacesBefore, 56 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 1 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 528 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 528, independent: 528, independent conditional: 0, independent unconditional: 528, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 264, independent: 264, independent conditional: 0, independent unconditional: 264, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 264, independent: 264, independent conditional: 0, independent unconditional: 264, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 528, independent: 264, independent conditional: 0, independent unconditional: 264, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 264, unknown conditional: 0, unknown unconditional: 264] , Statistics on independence cache: Total cache size (in pairs): 264, Positive cache size: 264, Positive conditional cache size: 0, Positive unconditional cache size: 264, 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: 114]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 70 locations, 7 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: 550.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 438.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 101 mSolverCounterUnknown, 1374 SdHoareTripleChecker+Valid, 321.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1374 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 319.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4708 IncrementalHoareTripleChecker+Invalid, 4898 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 0 mSDtfsCounter, 4708 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 457 GetRequests, 350 SyntacticMatches, 9 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 151.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3675occurred in iteration=15, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 108.9s InterpolantComputationTime, 803 NumberOfCodeBlocks, 803 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 970 ConstructedInterpolants, 0 QuantifiedInterpolants, 26799 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1659 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 26 InterpolantComputations, 11 PerfectInterpolantSequences, 10/34 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