/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/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:29:53,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:29:53,538 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:29:53,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:29:53,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:29:53,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:29:53,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:29:53,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:29:53,582 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:29:53,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:29:53,586 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:29:53,586 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:29:53,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:29:53,587 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:29:53,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:29:53,588 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:29:53,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:29:53,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:29:53,589 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:29:53,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:29:53,589 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:29:53,590 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:29:53,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:29:53,590 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:29:53,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:29:53,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:29:53,592 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:29:53,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:29:53,592 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:29:53,593 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:29:53,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:29:53,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:29:53,594 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:29:53,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:29:53,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:29:53,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:29:53,898 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:29:53,899 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:29:53,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2023-11-17 11:29:55,068 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:29:55,326 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:29:55,332 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2023-11-17 11:29:55,353 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b03faf49/a8b3321200f74cd1860b7780461ce279/FLAG069c1dd71 [2023-11-17 11:29:55,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b03faf49/a8b3321200f74cd1860b7780461ce279 [2023-11-17 11:29:55,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:29:55,375 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:29:55,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:29:55,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:29:55,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:29:55,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:29:55" (1/1) ... [2023-11-17 11:29:55,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35201224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:55, skipping insertion in model container [2023-11-17 11:29:55,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:29:55" (1/1) ... [2023-11-17 11:29:55,442 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:29:55,614 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2023-11-17 11:29:55,824 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:29:55,835 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:29:55,847 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2023-11-17 11:29:55,909 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:29:55,934 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:29:55,934 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:29:55,940 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:29:55,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:55 WrapperNode [2023-11-17 11:29:55,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:29:55,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:29:55,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:29:55,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:29:55,947 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:29:55" (1/1) ... [2023-11-17 11:29:55,974 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:29:55" (1/1) ... [2023-11-17 11:29:56,019 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2023-11-17 11:29:56,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:29:56,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:29:56,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:29:56,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:29:56,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:55" (1/1) ... [2023-11-17 11:29:56,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:55" (1/1) ... [2023-11-17 11:29:56,055 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:55" (1/1) ... [2023-11-17 11:29:56,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:55" (1/1) ... [2023-11-17 11:29:56,073 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:55" (1/1) ... [2023-11-17 11:29:56,075 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:55" (1/1) ... [2023-11-17 11:29:56,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:55" (1/1) ... [2023-11-17 11:29:56,078 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:55" (1/1) ... [2023-11-17 11:29:56,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:29:56,082 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:29:56,082 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:29:56,082 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:29:56,083 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:55" (1/1) ... [2023-11-17 11:29:56,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:29:56,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:29:56,135 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:29:56,156 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:29:56,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:29:56,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:29:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:29:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:29:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:29:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:29:56,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:29:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:29:56,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:29:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 11:29:56,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 11:29:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:29:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:29:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:29:56,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:29:56,169 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:29:56,296 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:29:56,298 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:29:56,586 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:29:56,810 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:29:56,810 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:29:56,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:29:56 BoogieIcfgContainer [2023-11-17 11:29:56,812 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:29:56,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:29:56,814 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:29:56,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:29:56,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:29:55" (1/3) ... [2023-11-17 11:29:56,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e79e0b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:29:56, skipping insertion in model container [2023-11-17 11:29:56,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:55" (2/3) ... [2023-11-17 11:29:56,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e79e0b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:29:56, skipping insertion in model container [2023-11-17 11:29:56,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:29:56" (3/3) ... [2023-11-17 11:29:56,819 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2023-11-17 11:29:56,834 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:29:56,834 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:29:56,834 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:29:56,877 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:29:56,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2023-11-17 11:29:56,940 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2023-11-17 11:29:56,941 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:29:56,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2023-11-17 11:29:56,946 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2023-11-17 11:29:56,951 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2023-11-17 11:29:56,954 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:29:56,971 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 36 transitions, 81 flow [2023-11-17 11:29:56,976 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 81 flow [2023-11-17 11:29:56,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 81 flow [2023-11-17 11:29:56,991 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2023-11-17 11:29:56,991 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:29:56,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2023-11-17 11:29:56,993 INFO L119 LiptonReduction]: Number of co-enabled transitions 730 [2023-11-17 11:29:58,577 INFO L134 LiptonReduction]: Checked pairs total: 1821 [2023-11-17 11:29:58,577 INFO L136 LiptonReduction]: Total number of compositions: 19 [2023-11-17 11:29:58,596 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:29:58,603 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;@3435152f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:29:58,604 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 11:29:58,608 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:29:58,609 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-11-17 11:29:58,609 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:29:58,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:58,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:58,610 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:58,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:58,615 INFO L85 PathProgramCache]: Analyzing trace with hash -351732574, now seen corresponding path program 1 times [2023-11-17 11:29:58,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:58,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487730008] [2023-11-17 11:29:58,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:58,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:59,006 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:29:59,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:59,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487730008] [2023-11-17 11:29:59,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487730008] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:59,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:59,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:29:59,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810562753] [2023-11-17 11:29:59,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:59,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:29:59,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:59,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:29:59,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:29:59,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2023-11-17 11:29:59,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:29:59,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:59,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2023-11-17 11:29:59,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:59,339 INFO L124 PetriNetUnfolderBase]: 711/1160 cut-off events. [2023-11-17 11:29:59,339 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-17 11:29:59,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2279 conditions, 1160 events. 711/1160 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5476 event pairs, 159 based on Foata normal form. 0/1092 useless extension candidates. Maximal degree in co-relation 2268. Up to 793 conditions per place. [2023-11-17 11:29:59,352 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 25 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2023-11-17 11:29:59,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 129 flow [2023-11-17 11:29:59,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:29:59,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:29:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2023-11-17 11:29:59,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-17 11:29:59,364 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 87 transitions. [2023-11-17 11:29:59,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 87 transitions. [2023-11-17 11:29:59,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:59,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 87 transitions. [2023-11-17 11:29:59,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:29:59,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states 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:29:59,371 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states 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:29:59,373 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 53 flow. Second operand 3 states and 87 transitions. [2023-11-17 11:29:59,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 129 flow [2023-11-17 11:29:59,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 11:29:59,377 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-11-17 11:29:59,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-11-17 11:29:59,382 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-11-17 11:29:59,382 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-11-17 11:29:59,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:29:59,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:59,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:59,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:29:59,383 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:59,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:59,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1287421257, now seen corresponding path program 1 times [2023-11-17 11:29:59,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:59,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004446970] [2023-11-17 11:29:59,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:59,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:00,253 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:30:00,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:00,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004446970] [2023-11-17 11:30:00,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004446970] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:00,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:00,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:30:00,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524182944] [2023-11-17 11:30:00,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:00,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:30:00,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:00,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:30:00,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:30:00,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58 [2023-11-17 11:30:00,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:30:00,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:00,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58 [2023-11-17 11:30:00,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:00,579 INFO L124 PetriNetUnfolderBase]: 1278/1958 cut-off events. [2023-11-17 11:30:00,579 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2023-11-17 11:30:00,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4097 conditions, 1958 events. 1278/1958 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9026 event pairs, 93 based on Foata normal form. 70/2028 useless extension candidates. Maximal degree in co-relation 4087. Up to 1293 conditions per place. [2023-11-17 11:30:00,592 INFO L140 encePairwiseOnDemand]: 48/58 looper letters, 39 selfloop transitions, 11 changer transitions 0/50 dead transitions. [2023-11-17 11:30:00,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 50 transitions, 222 flow [2023-11-17 11:30:00,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:30:00,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:30:00,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2023-11-17 11:30:00,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46551724137931033 [2023-11-17 11:30:00,597 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 108 transitions. [2023-11-17 11:30:00,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 108 transitions. [2023-11-17 11:30:00,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:00,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 108 transitions. [2023-11-17 11:30:00,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:30:00,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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:30:00,602 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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:30:00,602 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 4 states and 108 transitions. [2023-11-17 11:30:00,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 50 transitions, 222 flow [2023-11-17 11:30:00,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 50 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:30:00,607 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 130 flow [2023-11-17 11:30:00,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2023-11-17 11:30:00,608 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2023-11-17 11:30:00,608 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 130 flow [2023-11-17 11:30:00,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:30:00,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:00,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:00,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:30:00,610 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:00,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:00,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1255353482, now seen corresponding path program 1 times [2023-11-17 11:30:00,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:00,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429495007] [2023-11-17 11:30:00,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:00,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:01,208 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:30:01,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:01,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429495007] [2023-11-17 11:30:01,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429495007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:01,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:01,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:30:01,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705084796] [2023-11-17 11:30:01,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:01,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:30:01,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:01,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:30:01,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:30:01,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58 [2023-11-17 11:30:01,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:30:01,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:01,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58 [2023-11-17 11:30:01,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:01,546 INFO L124 PetriNetUnfolderBase]: 1244/1907 cut-off events. [2023-11-17 11:30:01,546 INFO L125 PetriNetUnfolderBase]: For 997/997 co-relation queries the response was YES. [2023-11-17 11:30:01,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5556 conditions, 1907 events. 1244/1907 cut-off events. For 997/997 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8913 event pairs, 100 based on Foata normal form. 8/1915 useless extension candidates. Maximal degree in co-relation 5543. Up to 1266 conditions per place. [2023-11-17 11:30:01,558 INFO L140 encePairwiseOnDemand]: 48/58 looper letters, 43 selfloop transitions, 14 changer transitions 0/57 dead transitions. [2023-11-17 11:30:01,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 57 transitions, 348 flow [2023-11-17 11:30:01,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:30:01,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:30:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2023-11-17 11:30:01,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4525862068965517 [2023-11-17 11:30:01,563 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 105 transitions. [2023-11-17 11:30:01,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 105 transitions. [2023-11-17 11:30:01,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:01,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 105 transitions. [2023-11-17 11:30:01,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:30:01,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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:30:01,566 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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:30:01,566 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 130 flow. Second operand 4 states and 105 transitions. [2023-11-17 11:30:01,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 57 transitions, 348 flow [2023-11-17 11:30:01,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 57 transitions, 348 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:30:01,569 INFO L231 Difference]: Finished difference. Result has 39 places, 39 transitions, 252 flow [2023-11-17 11:30:01,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=39, PETRI_TRANSITIONS=39} [2023-11-17 11:30:01,571 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2023-11-17 11:30:01,571 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 39 transitions, 252 flow [2023-11-17 11:30:01,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:30:01,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:01,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:01,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:30:01,572 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:01,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:01,572 INFO L85 PathProgramCache]: Analyzing trace with hash -226967650, now seen corresponding path program 1 times [2023-11-17 11:30:01,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:01,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751793943] [2023-11-17 11:30:01,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:01,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:01,745 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:30:01,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:01,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751793943] [2023-11-17 11:30:01,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751793943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:01,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:01,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:30:01,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097288517] [2023-11-17 11:30:01,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:01,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:30:01,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:01,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:30:01,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:30:01,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2023-11-17 11:30:01,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 39 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:30:01,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:01,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2023-11-17 11:30:01,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:02,020 INFO L124 PetriNetUnfolderBase]: 1064/1731 cut-off events. [2023-11-17 11:30:02,020 INFO L125 PetriNetUnfolderBase]: For 2845/2852 co-relation queries the response was YES. [2023-11-17 11:30:02,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6032 conditions, 1731 events. 1064/1731 cut-off events. For 2845/2852 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9148 event pairs, 382 based on Foata normal form. 47/1726 useless extension candidates. Maximal degree in co-relation 6014. Up to 888 conditions per place. [2023-11-17 11:30:02,035 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 42 selfloop transitions, 6 changer transitions 0/54 dead transitions. [2023-11-17 11:30:02,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 414 flow [2023-11-17 11:30:02,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:30:02,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:30:02,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2023-11-17 11:30:02,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47701149425287354 [2023-11-17 11:30:02,038 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 83 transitions. [2023-11-17 11:30:02,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 83 transitions. [2023-11-17 11:30:02,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:02,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 83 transitions. [2023-11-17 11:30:02,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:30:02,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states 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:30:02,041 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states 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:30:02,041 INFO L175 Difference]: Start difference. First operand has 39 places, 39 transitions, 252 flow. Second operand 3 states and 83 transitions. [2023-11-17 11:30:02,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 414 flow [2023-11-17 11:30:02,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 54 transitions, 414 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:30:02,054 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 272 flow [2023-11-17 11:30:02,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2023-11-17 11:30:02,056 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2023-11-17 11:30:02,056 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 272 flow [2023-11-17 11:30:02,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:30:02,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:02,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:02,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:30:02,057 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:02,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:02,057 INFO L85 PathProgramCache]: Analyzing trace with hash -218061102, now seen corresponding path program 1 times [2023-11-17 11:30:02,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:02,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298129982] [2023-11-17 11:30:02,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:02,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:02,361 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:30:02,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:02,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298129982] [2023-11-17 11:30:02,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298129982] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:02,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:02,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:30:02,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905513142] [2023-11-17 11:30:02,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:02,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:30:02,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:02,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:30:02,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:30:02,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 58 [2023-11-17 11:30:02,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:30:02,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:02,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 58 [2023-11-17 11:30:02,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:02,654 INFO L124 PetriNetUnfolderBase]: 1346/2162 cut-off events. [2023-11-17 11:30:02,654 INFO L125 PetriNetUnfolderBase]: For 4243/4243 co-relation queries the response was YES. [2023-11-17 11:30:02,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7692 conditions, 2162 events. 1346/2162 cut-off events. For 4243/4243 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 10760 event pairs, 332 based on Foata normal form. 3/2148 useless extension candidates. Maximal degree in co-relation 7672. Up to 1933 conditions per place. [2023-11-17 11:30:02,666 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 44 selfloop transitions, 4 changer transitions 1/54 dead transitions. [2023-11-17 11:30:02,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 472 flow [2023-11-17 11:30:02,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:30:02,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:30:02,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2023-11-17 11:30:02,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4827586206896552 [2023-11-17 11:30:02,668 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 84 transitions. [2023-11-17 11:30:02,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 84 transitions. [2023-11-17 11:30:02,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:02,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 84 transitions. [2023-11-17 11:30:02,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.0) internal successors, (84), 3 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:30:02,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states 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:30:02,669 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states 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:30:02,669 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 272 flow. Second operand 3 states and 84 transitions. [2023-11-17 11:30:02,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 472 flow [2023-11-17 11:30:02,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 458 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-17 11:30:02,680 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 300 flow [2023-11-17 11:30:02,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2023-11-17 11:30:02,681 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2023-11-17 11:30:02,681 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 300 flow [2023-11-17 11:30:02,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:30:02,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:02,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:02,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:30:02,682 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:02,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:02,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1830039772, now seen corresponding path program 1 times [2023-11-17 11:30:02,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:02,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718383829] [2023-11-17 11:30:02,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:02,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:02,912 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:30:02,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:02,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718383829] [2023-11-17 11:30:02,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718383829] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:02,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:02,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:30:02,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833560354] [2023-11-17 11:30:02,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:02,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:30:02,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:02,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:30:02,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:30:02,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 58 [2023-11-17 11:30:02,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 300 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:30:02,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:02,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 58 [2023-11-17 11:30:02,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:03,216 INFO L124 PetriNetUnfolderBase]: 1352/2180 cut-off events. [2023-11-17 11:30:03,216 INFO L125 PetriNetUnfolderBase]: For 4074/4074 co-relation queries the response was YES. [2023-11-17 11:30:03,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8066 conditions, 2180 events. 1352/2180 cut-off events. For 4074/4074 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10878 event pairs, 219 based on Foata normal form. 3/2183 useless extension candidates. Maximal degree in co-relation 8044. Up to 1637 conditions per place. [2023-11-17 11:30:03,229 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 50 selfloop transitions, 9 changer transitions 4/68 dead transitions. [2023-11-17 11:30:03,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 68 transitions, 602 flow [2023-11-17 11:30:03,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:30:03,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:30:03,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2023-11-17 11:30:03,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47844827586206895 [2023-11-17 11:30:03,231 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 111 transitions. [2023-11-17 11:30:03,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 111 transitions. [2023-11-17 11:30:03,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:03,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 111 transitions. [2023-11-17 11:30:03,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 27.75) internal successors, (111), 4 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:30:03,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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:30:03,232 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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:30:03,232 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 300 flow. Second operand 4 states and 111 transitions. [2023-11-17 11:30:03,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 68 transitions, 602 flow [2023-11-17 11:30:03,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 68 transitions, 598 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:30:03,242 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 342 flow [2023-11-17 11:30:03,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=342, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2023-11-17 11:30:03,243 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 15 predicate places. [2023-11-17 11:30:03,243 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 342 flow [2023-11-17 11:30:03,243 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:30:03,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:03,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:03,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:30:03,244 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:03,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:03,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1830018382, now seen corresponding path program 2 times [2023-11-17 11:30:03,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:03,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573072539] [2023-11-17 11:30:03,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:03,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:03,978 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:30:03,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:03,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573072539] [2023-11-17 11:30:03,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573072539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:03,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:03,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:30:03,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239654340] [2023-11-17 11:30:03,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:03,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:30:03,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:03,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:30:03,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:30:03,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58 [2023-11-17 11:30:03,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 342 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states 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:30:03,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:03,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58 [2023-11-17 11:30:03,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:04,378 INFO L124 PetriNetUnfolderBase]: 1425/2230 cut-off events. [2023-11-17 11:30:04,378 INFO L125 PetriNetUnfolderBase]: For 4884/4884 co-relation queries the response was YES. [2023-11-17 11:30:04,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8717 conditions, 2230 events. 1425/2230 cut-off events. For 4884/4884 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10670 event pairs, 126 based on Foata normal form. 9/2239 useless extension candidates. Maximal degree in co-relation 8693. Up to 1340 conditions per place. [2023-11-17 11:30:04,391 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 48 selfloop transitions, 33 changer transitions 5/86 dead transitions. [2023-11-17 11:30:04,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 86 transitions, 761 flow [2023-11-17 11:30:04,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:30:04,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:30:04,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2023-11-17 11:30:04,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4281609195402299 [2023-11-17 11:30:04,393 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 149 transitions. [2023-11-17 11:30:04,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 149 transitions. [2023-11-17 11:30:04,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:04,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 149 transitions. [2023-11-17 11:30:04,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states 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:30:04,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 58.0) internal successors, (406), 7 states have internal predecessors, (406), 0 states have call successors, (0), 0 states 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:30:04,395 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 58.0) internal successors, (406), 7 states have internal predecessors, (406), 0 states have call successors, (0), 0 states 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:30:04,395 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 342 flow. Second operand 6 states and 149 transitions. [2023-11-17 11:30:04,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 86 transitions, 761 flow [2023-11-17 11:30:04,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 86 transitions, 749 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-17 11:30:04,413 INFO L231 Difference]: Finished difference. Result has 54 places, 56 transitions, 542 flow [2023-11-17 11:30:04,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=542, PETRI_PLACES=54, PETRI_TRANSITIONS=56} [2023-11-17 11:30:04,414 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2023-11-17 11:30:04,414 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 56 transitions, 542 flow [2023-11-17 11:30:04,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states 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:30:04,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:04,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:04,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:30:04,415 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:04,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:04,415 INFO L85 PathProgramCache]: Analyzing trace with hash -491111067, now seen corresponding path program 1 times [2023-11-17 11:30:04,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:04,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031572363] [2023-11-17 11:30:04,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:04,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:04,729 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:30:04,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:04,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031572363] [2023-11-17 11:30:04,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031572363] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:04,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:04,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:30:04,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589124657] [2023-11-17 11:30:04,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:04,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:30:04,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:04,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:30:04,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:30:04,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 58 [2023-11-17 11:30:04,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 56 transitions, 542 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:30:04,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:04,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 58 [2023-11-17 11:30:04,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:05,048 INFO L124 PetriNetUnfolderBase]: 1262/2035 cut-off events. [2023-11-17 11:30:05,048 INFO L125 PetriNetUnfolderBase]: For 7644/7649 co-relation queries the response was YES. [2023-11-17 11:30:05,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9154 conditions, 2035 events. 1262/2035 cut-off events. For 7644/7649 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10009 event pairs, 248 based on Foata normal form. 12/2043 useless extension candidates. Maximal degree in co-relation 9126. Up to 1646 conditions per place. [2023-11-17 11:30:05,062 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 64 selfloop transitions, 9 changer transitions 4/82 dead transitions. [2023-11-17 11:30:05,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 82 transitions, 910 flow [2023-11-17 11:30:05,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:30:05,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:30:05,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2023-11-17 11:30:05,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47413793103448276 [2023-11-17 11:30:05,064 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 110 transitions. [2023-11-17 11:30:05,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 110 transitions. [2023-11-17 11:30:05,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:05,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 110 transitions. [2023-11-17 11:30:05,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:30:05,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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:30:05,066 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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:30:05,066 INFO L175 Difference]: Start difference. First operand has 54 places, 56 transitions, 542 flow. Second operand 4 states and 110 transitions. [2023-11-17 11:30:05,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 82 transitions, 910 flow [2023-11-17 11:30:05,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 82 transitions, 892 flow, removed 9 selfloop flow, removed 0 redundant places. [2023-11-17 11:30:05,081 INFO L231 Difference]: Finished difference. Result has 58 places, 59 transitions, 582 flow [2023-11-17 11:30:05,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=582, PETRI_PLACES=58, PETRI_TRANSITIONS=59} [2023-11-17 11:30:05,084 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2023-11-17 11:30:05,084 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 59 transitions, 582 flow [2023-11-17 11:30:05,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:30:05,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:05,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:05,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:30:05,085 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:05,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:05,085 INFO L85 PathProgramCache]: Analyzing trace with hash 896658325, now seen corresponding path program 1 times [2023-11-17 11:30:05,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:05,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881782299] [2023-11-17 11:30:05,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:05,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:05,754 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:30:05,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:05,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881782299] [2023-11-17 11:30:05,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881782299] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:05,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:05,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:30:05,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021415744] [2023-11-17 11:30:05,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:05,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:30:05,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:05,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:30:05,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:30:05,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58 [2023-11-17 11:30:05,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 59 transitions, 582 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:30:05,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:05,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58 [2023-11-17 11:30:05,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:06,228 INFO L124 PetriNetUnfolderBase]: 1566/2453 cut-off events. [2023-11-17 11:30:06,228 INFO L125 PetriNetUnfolderBase]: For 10810/10810 co-relation queries the response was YES. [2023-11-17 11:30:06,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11382 conditions, 2453 events. 1566/2453 cut-off events. For 10810/10810 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12182 event pairs, 301 based on Foata normal form. 3/2456 useless extension candidates. Maximal degree in co-relation 11351. Up to 1493 conditions per place. [2023-11-17 11:30:06,253 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 55 selfloop transitions, 49 changer transitions 3/107 dead transitions. [2023-11-17 11:30:06,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 107 transitions, 1158 flow [2023-11-17 11:30:06,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:30:06,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:30:06,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2023-11-17 11:30:06,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2023-11-17 11:30:06,255 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 144 transitions. [2023-11-17 11:30:06,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 144 transitions. [2023-11-17 11:30:06,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:06,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 144 transitions. [2023-11-17 11:30:06,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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:30:06,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 58.0) internal successors, (406), 7 states have internal predecessors, (406), 0 states have call successors, (0), 0 states 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:30:06,257 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 58.0) internal successors, (406), 7 states have internal predecessors, (406), 0 states have call successors, (0), 0 states 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:30:06,257 INFO L175 Difference]: Start difference. First operand has 58 places, 59 transitions, 582 flow. Second operand 6 states and 144 transitions. [2023-11-17 11:30:06,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 107 transitions, 1158 flow [2023-11-17 11:30:06,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 107 transitions, 1137 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-17 11:30:06,279 INFO L231 Difference]: Finished difference. Result has 65 places, 84 transitions, 1046 flow [2023-11-17 11:30:06,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1046, PETRI_PLACES=65, PETRI_TRANSITIONS=84} [2023-11-17 11:30:06,281 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 33 predicate places. [2023-11-17 11:30:06,281 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 84 transitions, 1046 flow [2023-11-17 11:30:06,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:30:06,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:06,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:06,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:30:06,284 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:06,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:06,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2067314679, now seen corresponding path program 2 times [2023-11-17 11:30:06,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:06,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469448031] [2023-11-17 11:30:06,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:06,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:06,554 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:30:06,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:06,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469448031] [2023-11-17 11:30:06,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469448031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:06,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:06,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:30:06,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197332933] [2023-11-17 11:30:06,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:06,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:30:06,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:06,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:30:06,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:30:06,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 58 [2023-11-17 11:30:06,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 84 transitions, 1046 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:30:06,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:06,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 58 [2023-11-17 11:30:06,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:06,990 INFO L124 PetriNetUnfolderBase]: 1458/2345 cut-off events. [2023-11-17 11:30:06,990 INFO L125 PetriNetUnfolderBase]: For 16003/16030 co-relation queries the response was YES. [2023-11-17 11:30:06,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12980 conditions, 2345 events. 1458/2345 cut-off events. For 16003/16030 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 11907 event pairs, 204 based on Foata normal form. 26/2361 useless extension candidates. Maximal degree in co-relation 12945. Up to 1602 conditions per place. [2023-11-17 11:30:07,009 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 67 selfloop transitions, 24 changer transitions 1/102 dead transitions. [2023-11-17 11:30:07,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 102 transitions, 1330 flow [2023-11-17 11:30:07,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:30:07,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:30:07,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2023-11-17 11:30:07,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4425287356321839 [2023-11-17 11:30:07,011 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 154 transitions. [2023-11-17 11:30:07,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 154 transitions. [2023-11-17 11:30:07,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:07,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 154 transitions. [2023-11-17 11:30:07,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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:30:07,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 58.0) internal successors, (406), 7 states have internal predecessors, (406), 0 states have call successors, (0), 0 states 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:30:07,013 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 58.0) internal successors, (406), 7 states have internal predecessors, (406), 0 states have call successors, (0), 0 states 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:30:07,013 INFO L175 Difference]: Start difference. First operand has 65 places, 84 transitions, 1046 flow. Second operand 6 states and 154 transitions. [2023-11-17 11:30:07,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 102 transitions, 1330 flow [2023-11-17 11:30:07,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 102 transitions, 1307 flow, removed 11 selfloop flow, removed 1 redundant places. [2023-11-17 11:30:07,051 INFO L231 Difference]: Finished difference. Result has 69 places, 83 transitions, 1049 flow [2023-11-17 11:30:07,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1001, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1049, PETRI_PLACES=69, PETRI_TRANSITIONS=83} [2023-11-17 11:30:07,052 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 37 predicate places. [2023-11-17 11:30:07,052 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 83 transitions, 1049 flow [2023-11-17 11:30:07,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:30:07,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:07,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:07,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 11:30:07,053 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:07,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:07,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1780576697, now seen corresponding path program 3 times [2023-11-17 11:30:07,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:07,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614875281] [2023-11-17 11:30:07,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:07,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:07,748 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:30:07,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:07,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614875281] [2023-11-17 11:30:07,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614875281] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:07,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:07,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:30:07,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129024393] [2023-11-17 11:30:07,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:07,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:30:07,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:07,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:30:07,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:30:07,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58 [2023-11-17 11:30:07,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 83 transitions, 1049 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:30:07,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:07,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58 [2023-11-17 11:30:07,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:08,267 INFO L124 PetriNetUnfolderBase]: 1639/2568 cut-off events. [2023-11-17 11:30:08,268 INFO L125 PetriNetUnfolderBase]: For 16678/16678 co-relation queries the response was YES. [2023-11-17 11:30:08,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14482 conditions, 2568 events. 1639/2568 cut-off events. For 16678/16678 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 12738 event pairs, 117 based on Foata normal form. 7/2575 useless extension candidates. Maximal degree in co-relation 14446. Up to 1505 conditions per place. [2023-11-17 11:30:08,285 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 66 selfloop transitions, 59 changer transitions 6/131 dead transitions. [2023-11-17 11:30:08,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 131 transitions, 1723 flow [2023-11-17 11:30:08,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:30:08,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:30:08,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2023-11-17 11:30:08,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2023-11-17 11:30:08,287 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 168 transitions. [2023-11-17 11:30:08,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 168 transitions. [2023-11-17 11:30:08,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:08,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 168 transitions. [2023-11-17 11:30:08,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 0 states have call successors, (0), 0 states 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:30:08,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 58.0) internal successors, (464), 8 states have internal predecessors, (464), 0 states have call successors, (0), 0 states 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:30:08,289 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 58.0) internal successors, (464), 8 states have internal predecessors, (464), 0 states have call successors, (0), 0 states 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:30:08,289 INFO L175 Difference]: Start difference. First operand has 69 places, 83 transitions, 1049 flow. Second operand 7 states and 168 transitions. [2023-11-17 11:30:08,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 131 transitions, 1723 flow [2023-11-17 11:30:08,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 131 transitions, 1694 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-17 11:30:08,329 INFO L231 Difference]: Finished difference. Result has 75 places, 99 transitions, 1461 flow [2023-11-17 11:30:08,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1461, PETRI_PLACES=75, PETRI_TRANSITIONS=99} [2023-11-17 11:30:08,329 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 43 predicate places. [2023-11-17 11:30:08,329 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 99 transitions, 1461 flow [2023-11-17 11:30:08,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:30:08,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:08,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:08,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 11:30:08,330 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:08,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:08,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2066451639, now seen corresponding path program 4 times [2023-11-17 11:30:08,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:08,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209932967] [2023-11-17 11:30:08,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:08,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:08,643 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:30:08,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:08,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209932967] [2023-11-17 11:30:08,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209932967] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:08,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:08,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:30:08,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822681880] [2023-11-17 11:30:08,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:08,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:30:08,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:08,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:30:08,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:30:08,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 58 [2023-11-17 11:30:08,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 99 transitions, 1461 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:30:08,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:08,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 58 [2023-11-17 11:30:08,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:09,063 INFO L124 PetriNetUnfolderBase]: 1535/2467 cut-off events. [2023-11-17 11:30:09,063 INFO L125 PetriNetUnfolderBase]: For 24323/24345 co-relation queries the response was YES. [2023-11-17 11:30:09,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15687 conditions, 2467 events. 1535/2467 cut-off events. For 24323/24345 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 12667 event pairs, 247 based on Foata normal form. 12/2474 useless extension candidates. Maximal degree in co-relation 15648. Up to 1935 conditions per place. [2023-11-17 11:30:09,082 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 81 selfloop transitions, 25 changer transitions 2/121 dead transitions. [2023-11-17 11:30:09,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 121 transitions, 1903 flow [2023-11-17 11:30:09,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:30:09,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:30:09,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2023-11-17 11:30:09,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46206896551724136 [2023-11-17 11:30:09,084 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 134 transitions. [2023-11-17 11:30:09,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 134 transitions. [2023-11-17 11:30:09,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:09,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 134 transitions. [2023-11-17 11:30:09,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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:30:09,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 58.0) internal successors, (348), 6 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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:30:09,085 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 58.0) internal successors, (348), 6 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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:30:09,085 INFO L175 Difference]: Start difference. First operand has 75 places, 99 transitions, 1461 flow. Second operand 5 states and 134 transitions. [2023-11-17 11:30:09,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 121 transitions, 1903 flow [2023-11-17 11:30:09,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 121 transitions, 1836 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-11-17 11:30:09,134 INFO L231 Difference]: Finished difference. Result has 77 places, 103 transitions, 1536 flow [2023-11-17 11:30:09,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1398, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1536, PETRI_PLACES=77, PETRI_TRANSITIONS=103} [2023-11-17 11:30:09,135 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 45 predicate places. [2023-11-17 11:30:09,135 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 103 transitions, 1536 flow [2023-11-17 11:30:09,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:30:09,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:09,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:09,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 11:30:09,136 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:09,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:09,136 INFO L85 PathProgramCache]: Analyzing trace with hash 896836885, now seen corresponding path program 5 times [2023-11-17 11:30:09,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:09,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531493027] [2023-11-17 11:30:09,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:09,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:09,400 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:30:09,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:09,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531493027] [2023-11-17 11:30:09,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531493027] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:09,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:09,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:30:09,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352048355] [2023-11-17 11:30:09,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:09,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:30:09,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:09,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:30:09,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:30:09,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 58 [2023-11-17 11:30:09,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 103 transitions, 1536 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:30:09,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:09,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 58 [2023-11-17 11:30:09,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:09,853 INFO L124 PetriNetUnfolderBase]: 1629/2621 cut-off events. [2023-11-17 11:30:09,853 INFO L125 PetriNetUnfolderBase]: For 27847/27913 co-relation queries the response was YES. [2023-11-17 11:30:09,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16778 conditions, 2621 events. 1629/2621 cut-off events. For 27847/27913 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 13834 event pairs, 221 based on Foata normal form. 81/2699 useless extension candidates. Maximal degree in co-relation 16738. Up to 1388 conditions per place. [2023-11-17 11:30:09,876 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 78 selfloop transitions, 43 changer transitions 5/139 dead transitions. [2023-11-17 11:30:09,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 139 transitions, 2130 flow [2023-11-17 11:30:09,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:30:09,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:30:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 183 transitions. [2023-11-17 11:30:09,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45073891625615764 [2023-11-17 11:30:09,878 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 183 transitions. [2023-11-17 11:30:09,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 183 transitions. [2023-11-17 11:30:09,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:09,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 183 transitions. [2023-11-17 11:30:09,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 26.142857142857142) internal successors, (183), 7 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:30:09,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 58.0) internal successors, (464), 8 states have internal predecessors, (464), 0 states have call successors, (0), 0 states 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:30:09,880 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 58.0) internal successors, (464), 8 states have internal predecessors, (464), 0 states have call successors, (0), 0 states 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:30:09,880 INFO L175 Difference]: Start difference. First operand has 77 places, 103 transitions, 1536 flow. Second operand 7 states and 183 transitions. [2023-11-17 11:30:09,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 139 transitions, 2130 flow [2023-11-17 11:30:09,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 139 transitions, 2086 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-17 11:30:09,931 INFO L231 Difference]: Finished difference. Result has 82 places, 105 transitions, 1660 flow [2023-11-17 11:30:09,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1492, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1660, PETRI_PLACES=82, PETRI_TRANSITIONS=105} [2023-11-17 11:30:09,932 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 50 predicate places. [2023-11-17 11:30:09,933 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 105 transitions, 1660 flow [2023-11-17 11:30:09,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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:30:09,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:09,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:09,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 11:30:09,933 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:09,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:09,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1084745995, now seen corresponding path program 1 times [2023-11-17 11:30:09,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:09,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413007256] [2023-11-17 11:30:09,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:09,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:10,422 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:30:10,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:10,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413007256] [2023-11-17 11:30:10,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413007256] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:10,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:10,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:30:10,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137000264] [2023-11-17 11:30:10,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:10,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:30:10,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:10,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:30:10,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:30:10,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58 [2023-11-17 11:30:10,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 105 transitions, 1660 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:30:10,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:10,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58 [2023-11-17 11:30:10,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:10,989 INFO L124 PetriNetUnfolderBase]: 2249/3582 cut-off events. [2023-11-17 11:30:10,989 INFO L125 PetriNetUnfolderBase]: For 39063/39063 co-relation queries the response was YES. [2023-11-17 11:30:11,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22871 conditions, 3582 events. 2249/3582 cut-off events. For 39063/39063 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 19809 event pairs, 327 based on Foata normal form. 40/3622 useless extension candidates. Maximal degree in co-relation 22829. Up to 1652 conditions per place. [2023-11-17 11:30:11,016 INFO L140 encePairwiseOnDemand]: 48/58 looper letters, 97 selfloop transitions, 32 changer transitions 20/149 dead transitions. [2023-11-17 11:30:11,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 149 transitions, 2564 flow [2023-11-17 11:30:11,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:30:11,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:30:11,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2023-11-17 11:30:11,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4482758620689655 [2023-11-17 11:30:11,018 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 104 transitions. [2023-11-17 11:30:11,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 104 transitions. [2023-11-17 11:30:11,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:11,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 104 transitions. [2023-11-17 11:30:11,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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:30:11,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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:30:11,019 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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:30:11,019 INFO L175 Difference]: Start difference. First operand has 82 places, 105 transitions, 1660 flow. Second operand 4 states and 104 transitions. [2023-11-17 11:30:11,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 149 transitions, 2564 flow [2023-11-17 11:30:11,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 149 transitions, 2480 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-11-17 11:30:11,085 INFO L231 Difference]: Finished difference. Result has 83 places, 103 transitions, 1751 flow [2023-11-17 11:30:11,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1598, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1751, PETRI_PLACES=83, PETRI_TRANSITIONS=103} [2023-11-17 11:30:11,086 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 51 predicate places. [2023-11-17 11:30:11,086 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 103 transitions, 1751 flow [2023-11-17 11:30:11,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:30:11,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:11,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:11,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 11:30:11,086 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:11,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:11,087 INFO L85 PathProgramCache]: Analyzing trace with hash -364356738, now seen corresponding path program 1 times [2023-11-17 11:30:11,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:11,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016556068] [2023-11-17 11:30:11,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:11,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:11,771 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:30:11,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:11,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016556068] [2023-11-17 11:30:11,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016556068] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:11,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:11,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:30:11,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469735722] [2023-11-17 11:30:11,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:11,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:30:11,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:11,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:30:11,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:30:11,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 58 [2023-11-17 11:30:11,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 103 transitions, 1751 flow. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 0 states 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:30:11,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:11,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 58 [2023-11-17 11:30:11,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:12,260 INFO L124 PetriNetUnfolderBase]: 2058/3411 cut-off events. [2023-11-17 11:30:12,260 INFO L125 PetriNetUnfolderBase]: For 48463/48556 co-relation queries the response was YES. [2023-11-17 11:30:12,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22584 conditions, 3411 events. 2058/3411 cut-off events. For 48463/48556 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 20098 event pairs, 582 based on Foata normal form. 85/3464 useless extension candidates. Maximal degree in co-relation 22539. Up to 2779 conditions per place. [2023-11-17 11:30:12,288 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 98 selfloop transitions, 18 changer transitions 9/133 dead transitions. [2023-11-17 11:30:12,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 133 transitions, 2389 flow [2023-11-17 11:30:12,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:30:12,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:30:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2023-11-17 11:30:12,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46551724137931033 [2023-11-17 11:30:12,290 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 135 transitions. [2023-11-17 11:30:12,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 135 transitions. [2023-11-17 11:30:12,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:12,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 135 transitions. [2023-11-17 11:30:12,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states 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:30:12,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 58.0) internal successors, (348), 6 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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:30:12,292 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 58.0) internal successors, (348), 6 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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:30:12,292 INFO L175 Difference]: Start difference. First operand has 83 places, 103 transitions, 1751 flow. Second operand 5 states and 135 transitions. [2023-11-17 11:30:12,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 133 transitions, 2389 flow [2023-11-17 11:30:12,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 133 transitions, 2381 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-11-17 11:30:12,392 INFO L231 Difference]: Finished difference. Result has 88 places, 105 transitions, 1861 flow [2023-11-17 11:30:12,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1745, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1861, PETRI_PLACES=88, PETRI_TRANSITIONS=105} [2023-11-17 11:30:12,392 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 56 predicate places. [2023-11-17 11:30:12,392 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 105 transitions, 1861 flow [2023-11-17 11:30:12,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 0 states 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:30:12,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:12,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:12,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-17 11:30:12,393 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:12,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:12,393 INFO L85 PathProgramCache]: Analyzing trace with hash 636523634, now seen corresponding path program 2 times [2023-11-17 11:30:12,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:12,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376291785] [2023-11-17 11:30:12,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:12,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:12,872 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:30:12,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:12,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376291785] [2023-11-17 11:30:12,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376291785] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:12,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:12,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:30:12,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272323334] [2023-11-17 11:30:12,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:12,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:30:12,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:12,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:30:12,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:30:12,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 58 [2023-11-17 11:30:12,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 105 transitions, 1861 flow. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 0 states 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:30:12,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:12,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 58 [2023-11-17 11:30:12,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:13,328 INFO L124 PetriNetUnfolderBase]: 1977/3263 cut-off events. [2023-11-17 11:30:13,329 INFO L125 PetriNetUnfolderBase]: For 48205/48302 co-relation queries the response was YES. [2023-11-17 11:30:13,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21948 conditions, 3263 events. 1977/3263 cut-off events. For 48205/48302 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 18910 event pairs, 335 based on Foata normal form. 83/3312 useless extension candidates. Maximal degree in co-relation 21900. Up to 1827 conditions per place. [2023-11-17 11:30:13,346 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 77 selfloop transitions, 27 changer transitions 29/139 dead transitions. [2023-11-17 11:30:13,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 139 transitions, 2564 flow [2023-11-17 11:30:13,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:30:13,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:30:13,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2023-11-17 11:30:13,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46551724137931033 [2023-11-17 11:30:13,350 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 135 transitions. [2023-11-17 11:30:13,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 135 transitions. [2023-11-17 11:30:13,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:13,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 135 transitions. [2023-11-17 11:30:13,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states 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:30:13,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 58.0) internal successors, (348), 6 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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:30:13,356 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 58.0) internal successors, (348), 6 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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:30:13,356 INFO L175 Difference]: Start difference. First operand has 88 places, 105 transitions, 1861 flow. Second operand 5 states and 135 transitions. [2023-11-17 11:30:13,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 139 transitions, 2564 flow [2023-11-17 11:30:13,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 139 transitions, 2526 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-17 11:30:13,459 INFO L231 Difference]: Finished difference. Result has 90 places, 90 transitions, 1630 flow [2023-11-17 11:30:13,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1823, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1630, PETRI_PLACES=90, PETRI_TRANSITIONS=90} [2023-11-17 11:30:13,460 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 58 predicate places. [2023-11-17 11:30:13,460 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 90 transitions, 1630 flow [2023-11-17 11:30:13,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 0 states 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:30:13,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:13,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:13,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-17 11:30:13,460 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:13,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:13,461 INFO L85 PathProgramCache]: Analyzing trace with hash 356227692, now seen corresponding path program 1 times [2023-11-17 11:30:13,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:13,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716575270] [2023-11-17 11:30:13,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:13,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:13,567 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:30:13,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:13,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716575270] [2023-11-17 11:30:13,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716575270] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:13,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:13,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:30:13,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057160581] [2023-11-17 11:30:13,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:13,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:30:13,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:13,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:30:13,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:30:13,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2023-11-17 11:30:13,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 90 transitions, 1630 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:30:13,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:13,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2023-11-17 11:30:13,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:13,786 INFO L124 PetriNetUnfolderBase]: 635/1168 cut-off events. [2023-11-17 11:30:13,786 INFO L125 PetriNetUnfolderBase]: For 21786/21852 co-relation queries the response was YES. [2023-11-17 11:30:13,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7718 conditions, 1168 events. 635/1168 cut-off events. For 21786/21852 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6593 event pairs, 59 based on Foata normal form. 202/1362 useless extension candidates. Maximal degree in co-relation 7669. Up to 521 conditions per place. [2023-11-17 11:30:13,794 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 97 selfloop transitions, 5 changer transitions 8/119 dead transitions. [2023-11-17 11:30:13,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 119 transitions, 2367 flow [2023-11-17 11:30:13,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:30:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:30:13,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2023-11-17 11:30:13,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4353448275862069 [2023-11-17 11:30:13,796 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 101 transitions. [2023-11-17 11:30:13,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 101 transitions. [2023-11-17 11:30:13,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:13,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 101 transitions. [2023-11-17 11:30:13,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states 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:30:13,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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:30:13,799 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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:30:13,799 INFO L175 Difference]: Start difference. First operand has 90 places, 90 transitions, 1630 flow. Second operand 4 states and 101 transitions. [2023-11-17 11:30:13,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 119 transitions, 2367 flow [2023-11-17 11:30:13,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 119 transitions, 1885 flow, removed 43 selfloop flow, removed 16 redundant places. [2023-11-17 11:30:13,826 INFO L231 Difference]: Finished difference. Result has 79 places, 70 transitions, 981 flow [2023-11-17 11:30:13,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=981, PETRI_PLACES=79, PETRI_TRANSITIONS=70} [2023-11-17 11:30:13,827 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 47 predicate places. [2023-11-17 11:30:13,827 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 70 transitions, 981 flow [2023-11-17 11:30:13,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:30:13,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:13,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:13,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-17 11:30:13,828 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:13,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:13,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1063082735, now seen corresponding path program 1 times [2023-11-17 11:30:13,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:13,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74610337] [2023-11-17 11:30:13,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:13,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:13,966 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:30:13,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:13,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74610337] [2023-11-17 11:30:13,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74610337] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:13,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:13,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:30:13,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857980699] [2023-11-17 11:30:13,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:13,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:30:13,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:13,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:30:13,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:30:13,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2023-11-17 11:30:13,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 70 transitions, 981 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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:30:13,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:13,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2023-11-17 11:30:13,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:14,140 INFO L124 PetriNetUnfolderBase]: 480/927 cut-off events. [2023-11-17 11:30:14,140 INFO L125 PetriNetUnfolderBase]: For 10820/10878 co-relation queries the response was YES. [2023-11-17 11:30:14,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5886 conditions, 927 events. 480/927 cut-off events. For 10820/10878 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5185 event pairs, 53 based on Foata normal form. 150/1069 useless extension candidates. Maximal degree in co-relation 5845. Up to 353 conditions per place. [2023-11-17 11:30:14,145 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 87 selfloop transitions, 8 changer transitions 17/120 dead transitions. [2023-11-17 11:30:14,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 120 transitions, 1870 flow [2023-11-17 11:30:14,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:30:14,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:30:14,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2023-11-17 11:30:14,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42758620689655175 [2023-11-17 11:30:14,146 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 124 transitions. [2023-11-17 11:30:14,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 124 transitions. [2023-11-17 11:30:14,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:14,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 124 transitions. [2023-11-17 11:30:14,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states 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:30:14,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 58.0) internal successors, (348), 6 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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:30:14,147 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 58.0) internal successors, (348), 6 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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:30:14,148 INFO L175 Difference]: Start difference. First operand has 79 places, 70 transitions, 981 flow. Second operand 5 states and 124 transitions. [2023-11-17 11:30:14,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 120 transitions, 1870 flow [2023-11-17 11:30:14,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 120 transitions, 1823 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-11-17 11:30:14,162 INFO L231 Difference]: Finished difference. Result has 81 places, 68 transitions, 908 flow [2023-11-17 11:30:14,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=908, PETRI_PLACES=81, PETRI_TRANSITIONS=68} [2023-11-17 11:30:14,162 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 49 predicate places. [2023-11-17 11:30:14,163 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 68 transitions, 908 flow [2023-11-17 11:30:14,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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:30:14,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:14,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:14,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-17 11:30:14,163 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:14,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:14,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2087438741, now seen corresponding path program 1 times [2023-11-17 11:30:14,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:14,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874798935] [2023-11-17 11:30:14,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:14,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:14,290 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:30:14,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:14,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874798935] [2023-11-17 11:30:14,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874798935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:14,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:14,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:30:14,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237362646] [2023-11-17 11:30:14,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:14,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:30:14,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:14,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:30:14,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:30:14,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2023-11-17 11:30:14,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 68 transitions, 908 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:30:14,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:14,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2023-11-17 11:30:14,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:14,442 INFO L124 PetriNetUnfolderBase]: 305/621 cut-off events. [2023-11-17 11:30:14,442 INFO L125 PetriNetUnfolderBase]: For 6168/6196 co-relation queries the response was YES. [2023-11-17 11:30:14,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4074 conditions, 621 events. 305/621 cut-off events. For 6168/6196 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3279 event pairs, 50 based on Foata normal form. 54/669 useless extension candidates. Maximal degree in co-relation 4033. Up to 227 conditions per place. [2023-11-17 11:30:14,445 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 35 selfloop transitions, 11 changer transitions 46/95 dead transitions. [2023-11-17 11:30:14,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 95 transitions, 1454 flow [2023-11-17 11:30:14,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:30:14,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:30:14,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2023-11-17 11:30:14,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3764367816091954 [2023-11-17 11:30:14,447 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 131 transitions. [2023-11-17 11:30:14,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 131 transitions. [2023-11-17 11:30:14,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:14,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 131 transitions. [2023-11-17 11:30:14,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states 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:30:14,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 58.0) internal successors, (406), 7 states have internal predecessors, (406), 0 states have call successors, (0), 0 states 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:30:14,450 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 58.0) internal successors, (406), 7 states have internal predecessors, (406), 0 states have call successors, (0), 0 states 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:30:14,450 INFO L175 Difference]: Start difference. First operand has 81 places, 68 transitions, 908 flow. Second operand 6 states and 131 transitions. [2023-11-17 11:30:14,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 95 transitions, 1454 flow [2023-11-17 11:30:14,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 95 transitions, 1360 flow, removed 18 selfloop flow, removed 6 redundant places. [2023-11-17 11:30:14,465 INFO L231 Difference]: Finished difference. Result has 82 places, 34 transitions, 356 flow [2023-11-17 11:30:14,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=356, PETRI_PLACES=82, PETRI_TRANSITIONS=34} [2023-11-17 11:30:14,465 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 50 predicate places. [2023-11-17 11:30:14,466 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 34 transitions, 356 flow [2023-11-17 11:30:14,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:30:14,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:14,466 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] [2023-11-17 11:30:14,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-17 11:30:14,466 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:14,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:14,467 INFO L85 PathProgramCache]: Analyzing trace with hash 247690442, now seen corresponding path program 1 times [2023-11-17 11:30:14,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:14,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985030443] [2023-11-17 11:30:14,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:14,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:30:14,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:30:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:30:14,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:30:14,577 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:30:14,577 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-17 11:30:14,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-17 11:30:14,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-17 11:30:14,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-17 11:30:14,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-17 11:30:14,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 11:30:14,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-17 11:30:14,580 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:14,586 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:30:14,586 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:30:14,630 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-17 11:30:14,633 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 11:30:14,634 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 11:30:14,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:30:14 BasicIcfg [2023-11-17 11:30:14,651 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:30:14,652 INFO L158 Benchmark]: Toolchain (without parser) took 19276.28ms. Allocated memory was 242.2MB in the beginning and 842.0MB in the end (delta: 599.8MB). Free memory was 194.3MB in the beginning and 552.8MB in the end (delta: -358.5MB). Peak memory consumption was 242.9MB. Max. memory is 8.0GB. [2023-11-17 11:30:14,652 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 195.0MB. Free memory is still 151.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:30:14,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.45ms. Allocated memory is still 242.2MB. Free memory was 193.9MB in the beginning and 171.2MB in the end (delta: 22.6MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-11-17 11:30:14,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.00ms. Allocated memory is still 242.2MB. Free memory was 171.2MB in the beginning and 168.3MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 11:30:14,652 INFO L158 Benchmark]: Boogie Preprocessor took 61.31ms. Allocated memory is still 242.2MB. Free memory was 168.3MB in the beginning and 166.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:30:14,653 INFO L158 Benchmark]: RCFGBuilder took 730.09ms. Allocated memory is still 242.2MB. Free memory was 166.6MB in the beginning and 193.9MB in the end (delta: -27.3MB). Peak memory consumption was 31.8MB. Max. memory is 8.0GB. [2023-11-17 11:30:14,653 INFO L158 Benchmark]: TraceAbstraction took 17837.43ms. Allocated memory was 242.2MB in the beginning and 842.0MB in the end (delta: 599.8MB). Free memory was 193.4MB in the beginning and 552.8MB in the end (delta: -359.4MB). Peak memory consumption was 240.4MB. Max. memory is 8.0GB. [2023-11-17 11:30:14,654 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.16ms. Allocated memory is still 195.0MB. Free memory is still 151.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 562.45ms. Allocated memory is still 242.2MB. Free memory was 193.9MB in the beginning and 171.2MB in the end (delta: 22.6MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 78.00ms. Allocated memory is still 242.2MB. Free memory was 171.2MB in the beginning and 168.3MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 61.31ms. Allocated memory is still 242.2MB. Free memory was 168.3MB in the beginning and 166.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 730.09ms. Allocated memory is still 242.2MB. Free memory was 166.6MB in the beginning and 193.9MB in the end (delta: -27.3MB). Peak memory consumption was 31.8MB. Max. memory is 8.0GB. * TraceAbstraction took 17837.43ms. Allocated memory was 242.2MB in the beginning and 842.0MB in the end (delta: 599.8MB). Free memory was 193.4MB in the beginning and 552.8MB in the end (delta: -359.4MB). Peak memory consumption was 240.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 45 PlacesBefore, 32 PlacesAfterwards, 36 TransitionsBefore, 22 TransitionsAfterwards, 730 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 16 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 19 TotalNumberOfCompositions, 1821 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 772, independent: 690, independent conditional: 0, independent unconditional: 690, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 504, independent: 463, independent conditional: 0, independent unconditional: 463, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 504, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 291, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 274, dependent conditional: 0, dependent unconditional: 274, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 772, independent: 227, independent conditional: 0, independent unconditional: 227, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 504, unknown conditional: 0, unknown unconditional: 504] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 88, Positive conditional cache size: 0, Positive unconditional cache size: 88, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 64 locations, 6 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: 17.7s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 495 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 495 mSDsluCounter, 55 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1441 IncrementalHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 30 mSDtfsCounter, 1441 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1861occurred 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 2396 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 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 proved your program to be incorrect! [2023-11-17 11:30:14,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...