/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:18:14,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:18:14,635 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 15:18:14,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:18:14,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:18:14,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:18:14,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:18:14,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:18:14,676 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:18:14,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:18:14,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:18:14,680 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:18:14,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:18:14,682 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:18:14,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:18:14,682 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:18:14,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:18:14,682 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:18:14,683 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:18:14,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:18:14,683 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:18:14,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:18:14,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:18:14,684 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:18:14,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:18:14,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:18:14,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:18:14,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:18:14,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:18:14,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:18:14,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:18:14,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:18:14,688 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 [2023-11-17 15:18:14,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:18:14,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:18:14,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:18:14,964 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:18:14,965 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:18:14,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i [2023-11-17 15:18:16,153 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:18:16,430 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:18:16,431 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i [2023-11-17 15:18:16,450 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f10f3f8c/dfb145f234214b52b080d32312441328/FLAG9d511b229 [2023-11-17 15:18:16,470 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f10f3f8c/dfb145f234214b52b080d32312441328 [2023-11-17 15:18:16,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:18:16,474 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:18:16,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:18:16,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:18:16,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:18:16,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:18:16" (1/1) ... [2023-11-17 15:18:16,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3b176d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:16, skipping insertion in model container [2023-11-17 15:18:16,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:18:16" (1/1) ... [2023-11-17 15:18:16,544 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:18:16,713 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/safe011_power.opt_pso.opt.i[959,972] [2023-11-17 15:18:16,939 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:18:16,954 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:18:16,969 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/safe011_power.opt_pso.opt.i[959,972] [2023-11-17 15:18:17,038 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:18:17,071 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:18:17,071 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:18:17,077 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:18:17,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:17 WrapperNode [2023-11-17 15:18:17,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:18:17,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:18:17,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:18:17,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:18:17,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:17" (1/1) ... [2023-11-17 15:18:17,120 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:17" (1/1) ... [2023-11-17 15:18:17,154 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-11-17 15:18:17,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:18:17,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:18:17,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:18:17,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:18:17,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:17" (1/1) ... [2023-11-17 15:18:17,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:17" (1/1) ... [2023-11-17 15:18:17,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:17" (1/1) ... [2023-11-17 15:18:17,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:17" (1/1) ... [2023-11-17 15:18:17,172 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:17" (1/1) ... [2023-11-17 15:18:17,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:17" (1/1) ... [2023-11-17 15:18:17,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:17" (1/1) ... [2023-11-17 15:18:17,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:17" (1/1) ... [2023-11-17 15:18:17,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:18:17,181 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:18:17,181 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:18:17,181 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:18:17,182 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:17" (1/1) ... [2023-11-17 15:18:17,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:18:17,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:18:17,216 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 15:18:17,231 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 15:18:17,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:18:17,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:18:17,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:18:17,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:18:17,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:18:17,246 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:18:17,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:18:17,246 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:18:17,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:18:17,246 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:18:17,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:18:17,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:18:17,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:18:17,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:18:17,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:18:17,247 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 15:18:17,406 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:18:17,408 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:18:17,721 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:18:17,826 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:18:17,826 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:18:17,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:18:17 BoogieIcfgContainer [2023-11-17 15:18:17,828 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:18:17,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:18:17,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:18:17,832 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:18:17,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:18:16" (1/3) ... [2023-11-17 15:18:17,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69af5b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:18:17, skipping insertion in model container [2023-11-17 15:18:17,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:17" (2/3) ... [2023-11-17 15:18:17,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69af5b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:18:17, skipping insertion in model container [2023-11-17 15:18:17,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:18:17" (3/3) ... [2023-11-17 15:18:17,835 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.opt_pso.opt.i [2023-11-17 15:18:17,850 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:18:17,850 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:18:17,851 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:18:17,905 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:18:17,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 111 transitions, 234 flow [2023-11-17 15:18:17,992 INFO L124 PetriNetUnfolderBase]: 3/108 cut-off events. [2023-11-17 15:18:17,992 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:18:17,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 3/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2023-11-17 15:18:18,000 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 111 transitions, 234 flow [2023-11-17 15:18:18,003 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 108 transitions, 225 flow [2023-11-17 15:18:18,006 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:18:18,020 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 108 transitions, 225 flow [2023-11-17 15:18:18,023 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 108 transitions, 225 flow [2023-11-17 15:18:18,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 108 transitions, 225 flow [2023-11-17 15:18:18,063 INFO L124 PetriNetUnfolderBase]: 3/108 cut-off events. [2023-11-17 15:18:18,063 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:18:18,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 3/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2023-11-17 15:18:18,067 INFO L119 LiptonReduction]: Number of co-enabled transitions 2190 [2023-11-17 15:18:21,805 INFO L134 LiptonReduction]: Checked pairs total: 4899 [2023-11-17 15:18:21,806 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-11-17 15:18:21,825 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:18:21,831 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;@7661ec51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:18:21,832 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 15:18:21,835 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:18:21,835 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-11-17 15:18:21,836 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:18:21,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:21,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 15:18:21,837 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:18:21,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:21,841 INFO L85 PathProgramCache]: Analyzing trace with hash 464699233, now seen corresponding path program 1 times [2023-11-17 15:18:21,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:21,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510930596] [2023-11-17 15:18:21,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:21,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:22,234 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 15:18:22,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:22,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510930596] [2023-11-17 15:18:22,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510930596] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:22,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:22,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:18:22,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180643933] [2023-11-17 15:18:22,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:22,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:18:22,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:22,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:18:22,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:18:22,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 208 [2023-11-17 15:18:22,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states 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 15:18:22,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:22,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 208 [2023-11-17 15:18:22,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:22,563 INFO L124 PetriNetUnfolderBase]: 855/1394 cut-off events. [2023-11-17 15:18:22,563 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-17 15:18:22,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2721 conditions, 1394 events. 855/1394 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7319 event pairs, 141 based on Foata normal form. 0/1325 useless extension candidates. Maximal degree in co-relation 2710. Up to 1027 conditions per place. [2023-11-17 15:18:22,573 INFO L140 encePairwiseOnDemand]: 204/208 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-11-17 15:18:22,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 150 flow [2023-11-17 15:18:22,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:18:22,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:18:22,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-11-17 15:18:22,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2023-11-17 15:18:22,586 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-11-17 15:18:22,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-11-17 15:18:22,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:22,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-11-17 15:18:22,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states 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 15:18:22,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states 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 15:18:22,598 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states 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 15:18:22,600 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 324 transitions. [2023-11-17 15:18:22,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 150 flow [2023-11-17 15:18:22,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 15:18:22,604 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-11-17 15:18:22,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-11-17 15:18:22,608 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-11-17 15:18:22,608 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-11-17 15:18:22,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states 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 15:18:22,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:22,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:22,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:18:22,609 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:18:22,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:22,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1421784862, now seen corresponding path program 1 times [2023-11-17 15:18:22,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:22,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974472243] [2023-11-17 15:18:22,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:22,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:22,861 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 15:18:22,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:22,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974472243] [2023-11-17 15:18:22,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974472243] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:22,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:22,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:18:22,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182807252] [2023-11-17 15:18:22,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:22,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:18:22,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:22,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:18:22,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:18:22,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 208 [2023-11-17 15:18:22,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states 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 15:18:22,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:22,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 208 [2023-11-17 15:18:22,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:23,139 INFO L124 PetriNetUnfolderBase]: 963/1512 cut-off events. [2023-11-17 15:18:23,139 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2023-11-17 15:18:23,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3150 conditions, 1512 events. 963/1512 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7342 event pairs, 293 based on Foata normal form. 80/1591 useless extension candidates. Maximal degree in co-relation 3140. Up to 1213 conditions per place. [2023-11-17 15:18:23,148 INFO L140 encePairwiseOnDemand]: 203/208 looper letters, 29 selfloop transitions, 3 changer transitions 17/51 dead transitions. [2023-11-17 15:18:23,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 51 transitions, 220 flow [2023-11-17 15:18:23,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:18:23,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:18:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 506 transitions. [2023-11-17 15:18:23,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48653846153846153 [2023-11-17 15:18:23,152 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 506 transitions. [2023-11-17 15:18:23,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 506 transitions. [2023-11-17 15:18:23,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:23,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 506 transitions. [2023-11-17 15:18:23,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states 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 15:18:23,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states 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 15:18:23,158 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states 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 15:18:23,158 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 5 states and 506 transitions. [2023-11-17 15:18:23,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 51 transitions, 220 flow [2023-11-17 15:18:23,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 51 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:18:23,159 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 77 flow [2023-11-17 15:18:23,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=77, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2023-11-17 15:18:23,160 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2023-11-17 15:18:23,160 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 77 flow [2023-11-17 15:18:23,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states 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 15:18:23,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:23,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:23,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:18:23,162 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:18:23,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:23,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1125642130, now seen corresponding path program 1 times [2023-11-17 15:18:23,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:23,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059486026] [2023-11-17 15:18:23,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:23,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:23,296 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 15:18:23,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:23,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059486026] [2023-11-17 15:18:23,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059486026] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:23,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:23,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:18:23,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87942939] [2023-11-17 15:18:23,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:23,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:18:23,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:23,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:18:23,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:18:23,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 208 [2023-11-17 15:18:23,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 77 flow. Second operand has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states 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 15:18:23,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:23,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 208 [2023-11-17 15:18:23,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:23,544 INFO L124 PetriNetUnfolderBase]: 769/1235 cut-off events. [2023-11-17 15:18:23,544 INFO L125 PetriNetUnfolderBase]: For 513/513 co-relation queries the response was YES. [2023-11-17 15:18:23,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2978 conditions, 1235 events. 769/1235 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5856 event pairs, 199 based on Foata normal form. 60/1291 useless extension candidates. Maximal degree in co-relation 2965. Up to 831 conditions per place. [2023-11-17 15:18:23,556 INFO L140 encePairwiseOnDemand]: 204/208 looper letters, 26 selfloop transitions, 2 changer transitions 14/46 dead transitions. [2023-11-17 15:18:23,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 210 flow [2023-11-17 15:18:23,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:18:23,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:18:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2023-11-17 15:18:23,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48365384615384616 [2023-11-17 15:18:23,559 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 503 transitions. [2023-11-17 15:18:23,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 503 transitions. [2023-11-17 15:18:23,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:23,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 503 transitions. [2023-11-17 15:18:23,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states 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 15:18:23,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states 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 15:18:23,564 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states 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 15:18:23,564 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 77 flow. Second operand 5 states and 503 transitions. [2023-11-17 15:18:23,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 210 flow [2023-11-17 15:18:23,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 46 transitions, 204 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 15:18:23,569 INFO L231 Difference]: Finished difference. Result has 39 places, 24 transitions, 84 flow [2023-11-17 15:18:23,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2023-11-17 15:18:23,573 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2023-11-17 15:18:23,573 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 84 flow [2023-11-17 15:18:23,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states 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 15:18:23,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:23,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:23,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:18:23,578 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:18:23,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:23,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1364115869, now seen corresponding path program 1 times [2023-11-17 15:18:23,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:23,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355026149] [2023-11-17 15:18:23,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:23,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:23,993 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 15:18:23,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:23,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355026149] [2023-11-17 15:18:23,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355026149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:23,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:23,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:18:23,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476346260] [2023-11-17 15:18:23,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:23,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:18:23,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:23,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:18:23,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:18:23,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 208 [2023-11-17 15:18:23,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states 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 15:18:23,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:23,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 208 [2023-11-17 15:18:23,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:24,665 INFO L124 PetriNetUnfolderBase]: 1875/2786 cut-off events. [2023-11-17 15:18:24,665 INFO L125 PetriNetUnfolderBase]: For 2275/2275 co-relation queries the response was YES. [2023-11-17 15:18:24,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7020 conditions, 2786 events. 1875/2786 cut-off events. For 2275/2275 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 13093 event pairs, 219 based on Foata normal form. 129/2915 useless extension candidates. Maximal degree in co-relation 7004. Up to 1310 conditions per place. [2023-11-17 15:18:24,682 INFO L140 encePairwiseOnDemand]: 196/208 looper letters, 51 selfloop transitions, 20 changer transitions 36/107 dead transitions. [2023-11-17 15:18:24,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 107 transitions, 574 flow [2023-11-17 15:18:24,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 15:18:24,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 15:18:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 814 transitions. [2023-11-17 15:18:24,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43482905982905984 [2023-11-17 15:18:24,686 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 814 transitions. [2023-11-17 15:18:24,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 814 transitions. [2023-11-17 15:18:24,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:24,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 814 transitions. [2023-11-17 15:18:24,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 90.44444444444444) internal successors, (814), 9 states have internal predecessors, (814), 0 states have call successors, (0), 0 states 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 15:18:24,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 208.0) internal successors, (2080), 10 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states 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 15:18:24,692 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 208.0) internal successors, (2080), 10 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states 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 15:18:24,692 INFO L175 Difference]: Start difference. First operand has 39 places, 24 transitions, 84 flow. Second operand 9 states and 814 transitions. [2023-11-17 15:18:24,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 107 transitions, 574 flow [2023-11-17 15:18:24,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 107 transitions, 550 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-11-17 15:18:24,705 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 283 flow [2023-11-17 15:18:24,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=283, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-11-17 15:18:24,706 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2023-11-17 15:18:24,706 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 283 flow [2023-11-17 15:18:24,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states 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 15:18:24,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:24,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:24,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:18:24,707 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:18:24,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:24,708 INFO L85 PathProgramCache]: Analyzing trace with hash -791891909, now seen corresponding path program 2 times [2023-11-17 15:18:24,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:24,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820110105] [2023-11-17 15:18:24,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:24,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:24,827 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 15:18:24,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:24,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820110105] [2023-11-17 15:18:24,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820110105] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:24,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:24,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:18:24,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043253403] [2023-11-17 15:18:24,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:24,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:18:24,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:24,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:18:24,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:18:24,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 208 [2023-11-17 15:18:24,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 283 flow. Second operand has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 0 states have call successors, (0), 0 states 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 15:18:24,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:24,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 208 [2023-11-17 15:18:24,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:25,246 INFO L124 PetriNetUnfolderBase]: 1529/2342 cut-off events. [2023-11-17 15:18:25,249 INFO L125 PetriNetUnfolderBase]: For 7767/7767 co-relation queries the response was YES. [2023-11-17 15:18:25,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9718 conditions, 2342 events. 1529/2342 cut-off events. For 7767/7767 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11575 event pairs, 193 based on Foata normal form. 90/2404 useless extension candidates. Maximal degree in co-relation 9696. Up to 1094 conditions per place. [2023-11-17 15:18:25,271 INFO L140 encePairwiseOnDemand]: 203/208 looper letters, 40 selfloop transitions, 3 changer transitions 45/91 dead transitions. [2023-11-17 15:18:25,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 91 transitions, 770 flow [2023-11-17 15:18:25,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:18:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:18:25,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 597 transitions. [2023-11-17 15:18:25,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47836538461538464 [2023-11-17 15:18:25,274 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 597 transitions. [2023-11-17 15:18:25,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 597 transitions. [2023-11-17 15:18:25,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:25,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 597 transitions. [2023-11-17 15:18:25,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 0 states 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 15:18:25,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 208.0) internal successors, (1456), 7 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states 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 15:18:25,280 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 208.0) internal successors, (1456), 7 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states 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 15:18:25,281 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 283 flow. Second operand 6 states and 597 transitions. [2023-11-17 15:18:25,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 91 transitions, 770 flow [2023-11-17 15:18:25,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 91 transitions, 762 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-17 15:18:25,298 INFO L231 Difference]: Finished difference. Result has 52 places, 32 transitions, 214 flow [2023-11-17 15:18:25,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=52, PETRI_TRANSITIONS=32} [2023-11-17 15:18:25,301 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2023-11-17 15:18:25,301 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 32 transitions, 214 flow [2023-11-17 15:18:25,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 0 states have call successors, (0), 0 states 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 15:18:25,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:25,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:25,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:18:25,302 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:18:25,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:25,302 INFO L85 PathProgramCache]: Analyzing trace with hash -414600776, now seen corresponding path program 1 times [2023-11-17 15:18:25,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:25,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486925537] [2023-11-17 15:18:25,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:25,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:25,917 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 15:18:25,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:25,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486925537] [2023-11-17 15:18:25,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486925537] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:25,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:25,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:18:25,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349070487] [2023-11-17 15:18:25,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:25,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:18:25,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:25,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:18:25,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:18:25,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 208 [2023-11-17 15:18:25,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 32 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 83.85714285714286) internal successors, (587), 7 states have internal predecessors, (587), 0 states have call successors, (0), 0 states 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 15:18:25,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:25,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 208 [2023-11-17 15:18:25,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:26,291 INFO L124 PetriNetUnfolderBase]: 1002/1548 cut-off events. [2023-11-17 15:18:26,291 INFO L125 PetriNetUnfolderBase]: For 5645/5648 co-relation queries the response was YES. [2023-11-17 15:18:26,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6315 conditions, 1548 events. 1002/1548 cut-off events. For 5645/5648 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6613 event pairs, 306 based on Foata normal form. 70/1616 useless extension candidates. Maximal degree in co-relation 6289. Up to 1273 conditions per place. [2023-11-17 15:18:26,305 INFO L140 encePairwiseOnDemand]: 199/208 looper letters, 51 selfloop transitions, 15 changer transitions 28/95 dead transitions. [2023-11-17 15:18:26,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 95 transitions, 828 flow [2023-11-17 15:18:26,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:18:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:18:26,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 643 transitions. [2023-11-17 15:18:26,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4416208791208791 [2023-11-17 15:18:26,308 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 643 transitions. [2023-11-17 15:18:26,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 643 transitions. [2023-11-17 15:18:26,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:26,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 643 transitions. [2023-11-17 15:18:26,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:18:26,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states 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 15:18:26,312 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states 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 15:18:26,312 INFO L175 Difference]: Start difference. First operand has 52 places, 32 transitions, 214 flow. Second operand 7 states and 643 transitions. [2023-11-17 15:18:26,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 95 transitions, 828 flow [2023-11-17 15:18:26,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 95 transitions, 720 flow, removed 13 selfloop flow, removed 10 redundant places. [2023-11-17 15:18:26,322 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 328 flow [2023-11-17 15:18:26,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=328, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2023-11-17 15:18:26,322 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2023-11-17 15:18:26,323 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 328 flow [2023-11-17 15:18:26,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.85714285714286) internal successors, (587), 7 states have internal predecessors, (587), 0 states have call successors, (0), 0 states 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 15:18:26,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:26,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:26,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:18:26,324 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:18:26,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:26,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1502532405, now seen corresponding path program 1 times [2023-11-17 15:18:26,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:26,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154149514] [2023-11-17 15:18:26,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:26,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:26,749 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 15:18:26,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:26,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154149514] [2023-11-17 15:18:26,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154149514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:26,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:26,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:18:26,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369150457] [2023-11-17 15:18:26,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:26,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:18:26,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:26,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:18:26,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:18:26,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 208 [2023-11-17 15:18:26,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 328 flow. Second operand has 7 states, 7 states have (on average 89.0) internal successors, (623), 7 states have internal predecessors, (623), 0 states have call successors, (0), 0 states 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 15:18:26,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:26,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 208 [2023-11-17 15:18:26,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:27,126 INFO L124 PetriNetUnfolderBase]: 1091/1725 cut-off events. [2023-11-17 15:18:27,127 INFO L125 PetriNetUnfolderBase]: For 9062/9101 co-relation queries the response was YES. [2023-11-17 15:18:27,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7896 conditions, 1725 events. 1091/1725 cut-off events. For 9062/9101 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7920 event pairs, 185 based on Foata normal form. 94/1819 useless extension candidates. Maximal degree in co-relation 7872. Up to 1202 conditions per place. [2023-11-17 15:18:27,141 INFO L140 encePairwiseOnDemand]: 200/208 looper letters, 57 selfloop transitions, 19 changer transitions 19/98 dead transitions. [2023-11-17 15:18:27,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 98 transitions, 850 flow [2023-11-17 15:18:27,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:18:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:18:27,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 758 transitions. [2023-11-17 15:18:27,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45552884615384615 [2023-11-17 15:18:27,145 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 758 transitions. [2023-11-17 15:18:27,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 758 transitions. [2023-11-17 15:18:27,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:27,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 758 transitions. [2023-11-17 15:18:27,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.75) internal successors, (758), 8 states have internal predecessors, (758), 0 states have call successors, (0), 0 states 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 15:18:27,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 208.0) internal successors, (1872), 9 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states 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 15:18:27,149 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 208.0) internal successors, (1872), 9 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states 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 15:18:27,149 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 328 flow. Second operand 8 states and 758 transitions. [2023-11-17 15:18:27,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 98 transitions, 850 flow [2023-11-17 15:18:27,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 98 transitions, 838 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-17 15:18:27,159 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 482 flow [2023-11-17 15:18:27,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=482, PETRI_PLACES=57, PETRI_TRANSITIONS=55} [2023-11-17 15:18:27,159 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2023-11-17 15:18:27,160 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 482 flow [2023-11-17 15:18:27,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.0) internal successors, (623), 7 states have internal predecessors, (623), 0 states have call successors, (0), 0 states 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 15:18:27,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:27,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:27,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:18:27,164 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:18:27,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:27,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1121753465, now seen corresponding path program 1 times [2023-11-17 15:18:27,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:27,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208210125] [2023-11-17 15:18:27,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:27,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:27,311 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 15:18:27,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:27,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208210125] [2023-11-17 15:18:27,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208210125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:27,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:27,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:18:27,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259447581] [2023-11-17 15:18:27,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:27,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:18:27,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:27,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:18:27,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:18:27,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 208 [2023-11-17 15:18:27,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 482 flow. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 states 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 15:18:27,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:27,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 208 [2023-11-17 15:18:27,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:27,567 INFO L124 PetriNetUnfolderBase]: 693/1131 cut-off events. [2023-11-17 15:18:27,567 INFO L125 PetriNetUnfolderBase]: For 9533/9630 co-relation queries the response was YES. [2023-11-17 15:18:27,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6134 conditions, 1131 events. 693/1131 cut-off events. For 9533/9630 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5181 event pairs, 93 based on Foata normal form. 186/1309 useless extension candidates. Maximal degree in co-relation 6106. Up to 670 conditions per place. [2023-11-17 15:18:27,582 INFO L140 encePairwiseOnDemand]: 202/208 looper letters, 70 selfloop transitions, 5 changer transitions 51/132 dead transitions. [2023-11-17 15:18:27,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 132 transitions, 1469 flow [2023-11-17 15:18:27,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:18:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:18:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 498 transitions. [2023-11-17 15:18:27,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47884615384615387 [2023-11-17 15:18:27,585 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 498 transitions. [2023-11-17 15:18:27,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 498 transitions. [2023-11-17 15:18:27,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:27,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 498 transitions. [2023-11-17 15:18:27,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 0 states have call successors, (0), 0 states 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 15:18:27,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states 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 15:18:27,589 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states 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 15:18:27,589 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 482 flow. Second operand 5 states and 498 transitions. [2023-11-17 15:18:27,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 132 transitions, 1469 flow [2023-11-17 15:18:27,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 132 transitions, 1454 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-11-17 15:18:27,597 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 499 flow [2023-11-17 15:18:27,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=499, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2023-11-17 15:18:27,600 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 26 predicate places. [2023-11-17 15:18:27,600 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 499 flow [2023-11-17 15:18:27,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 states 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 15:18:27,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:27,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:27,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:18:27,601 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:18:27,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:27,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1852476425, now seen corresponding path program 1 times [2023-11-17 15:18:27,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:27,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17279962] [2023-11-17 15:18:27,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:27,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:27,752 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 15:18:27,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:27,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17279962] [2023-11-17 15:18:27,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17279962] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:27,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:27,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:18:27,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183427270] [2023-11-17 15:18:27,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:27,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:18:27,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:27,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:18:27,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:18:27,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 208 [2023-11-17 15:18:27,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 499 flow. Second operand has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states 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 15:18:27,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:27,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 208 [2023-11-17 15:18:27,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:27,964 INFO L124 PetriNetUnfolderBase]: 403/693 cut-off events. [2023-11-17 15:18:27,964 INFO L125 PetriNetUnfolderBase]: For 5935/6009 co-relation queries the response was YES. [2023-11-17 15:18:27,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3926 conditions, 693 events. 403/693 cut-off events. For 5935/6009 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3019 event pairs, 35 based on Foata normal form. 121/807 useless extension candidates. Maximal degree in co-relation 3895. Up to 335 conditions per place. [2023-11-17 15:18:27,970 INFO L140 encePairwiseOnDemand]: 202/208 looper letters, 79 selfloop transitions, 8 changer transitions 59/152 dead transitions. [2023-11-17 15:18:27,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 152 transitions, 1770 flow [2023-11-17 15:18:27,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:18:27,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:18:27,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 692 transitions. [2023-11-17 15:18:27,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47527472527472525 [2023-11-17 15:18:27,973 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 692 transitions. [2023-11-17 15:18:27,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 692 transitions. [2023-11-17 15:18:27,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:27,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 692 transitions. [2023-11-17 15:18:27,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 states 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 15:18:27,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states 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 15:18:27,977 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states 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 15:18:27,977 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 499 flow. Second operand 7 states and 692 transitions. [2023-11-17 15:18:27,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 152 transitions, 1770 flow [2023-11-17 15:18:27,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 152 transitions, 1758 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-17 15:18:28,001 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 551 flow [2023-11-17 15:18:28,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=551, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2023-11-17 15:18:28,002 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 32 predicate places. [2023-11-17 15:18:28,002 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 551 flow [2023-11-17 15:18:28,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states 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 15:18:28,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:28,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:28,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:18:28,005 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:18:28,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:28,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1614130400, now seen corresponding path program 1 times [2023-11-17 15:18:28,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:28,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273945563] [2023-11-17 15:18:28,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:28,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:28,169 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 15:18:28,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:28,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273945563] [2023-11-17 15:18:28,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273945563] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:28,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:28,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:18:28,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668548667] [2023-11-17 15:18:28,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:28,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:18:28,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:28,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:18:28,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:18:28,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 208 [2023-11-17 15:18:28,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 551 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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 15:18:28,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:28,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 208 [2023-11-17 15:18:28,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:28,345 INFO L124 PetriNetUnfolderBase]: 420/768 cut-off events. [2023-11-17 15:18:28,345 INFO L125 PetriNetUnfolderBase]: For 6216/6249 co-relation queries the response was YES. [2023-11-17 15:18:28,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4701 conditions, 768 events. 420/768 cut-off events. For 6216/6249 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3449 event pairs, 128 based on Foata normal form. 40/800 useless extension candidates. Maximal degree in co-relation 4667. Up to 453 conditions per place. [2023-11-17 15:18:28,351 INFO L140 encePairwiseOnDemand]: 204/208 looper letters, 52 selfloop transitions, 4 changer transitions 29/89 dead transitions. [2023-11-17 15:18:28,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 89 transitions, 1080 flow [2023-11-17 15:18:28,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:18:28,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:18:28,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 497 transitions. [2023-11-17 15:18:28,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4778846153846154 [2023-11-17 15:18:28,353 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 497 transitions. [2023-11-17 15:18:28,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 497 transitions. [2023-11-17 15:18:28,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:28,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 497 transitions. [2023-11-17 15:18:28,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states 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 15:18:28,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states 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 15:18:28,357 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states 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 15:18:28,357 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 551 flow. Second operand 5 states and 497 transitions. [2023-11-17 15:18:28,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 89 transitions, 1080 flow [2023-11-17 15:18:28,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 89 transitions, 1002 flow, removed 31 selfloop flow, removed 4 redundant places. [2023-11-17 15:18:28,369 INFO L231 Difference]: Finished difference. Result has 67 places, 50 transitions, 441 flow [2023-11-17 15:18:28,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=67, PETRI_TRANSITIONS=50} [2023-11-17 15:18:28,370 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 33 predicate places. [2023-11-17 15:18:28,370 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 50 transitions, 441 flow [2023-11-17 15:18:28,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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 15:18:28,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:28,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:28,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:18:28,371 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:18:28,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:28,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1017004955, now seen corresponding path program 1 times [2023-11-17 15:18:28,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:28,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484874874] [2023-11-17 15:18:28,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:28,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:18:28,544 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 15:18:28,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:18:28,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484874874] [2023-11-17 15:18:28,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484874874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:18:28,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:18:28,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:18:28,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153645556] [2023-11-17 15:18:28,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:18:28,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:18:28,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:18:28,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:18:28,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:18:28,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 208 [2023-11-17 15:18:28,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 50 transitions, 441 flow. Second operand has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 0 states have call successors, (0), 0 states 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 15:18:28,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:18:28,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 208 [2023-11-17 15:18:28,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:18:28,724 INFO L124 PetriNetUnfolderBase]: 311/574 cut-off events. [2023-11-17 15:18:28,725 INFO L125 PetriNetUnfolderBase]: For 4536/4562 co-relation queries the response was YES. [2023-11-17 15:18:28,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3263 conditions, 574 events. 311/574 cut-off events. For 4536/4562 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2597 event pairs, 31 based on Foata normal form. 40/607 useless extension candidates. Maximal degree in co-relation 3230. Up to 255 conditions per place. [2023-11-17 15:18:28,728 INFO L140 encePairwiseOnDemand]: 202/208 looper letters, 44 selfloop transitions, 10 changer transitions 52/110 dead transitions. [2023-11-17 15:18:28,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 110 transitions, 1279 flow [2023-11-17 15:18:28,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:18:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:18:28,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 772 transitions. [2023-11-17 15:18:28,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4639423076923077 [2023-11-17 15:18:28,731 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 772 transitions. [2023-11-17 15:18:28,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 772 transitions. [2023-11-17 15:18:28,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:18:28,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 772 transitions. [2023-11-17 15:18:28,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 96.5) internal successors, (772), 8 states have internal predecessors, (772), 0 states have call successors, (0), 0 states 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 15:18:28,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 208.0) internal successors, (1872), 9 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states 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 15:18:28,736 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 208.0) internal successors, (1872), 9 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states 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 15:18:28,736 INFO L175 Difference]: Start difference. First operand has 67 places, 50 transitions, 441 flow. Second operand 8 states and 772 transitions. [2023-11-17 15:18:28,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 110 transitions, 1279 flow [2023-11-17 15:18:28,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 110 transitions, 1117 flow, removed 72 selfloop flow, removed 7 redundant places. [2023-11-17 15:18:28,744 INFO L231 Difference]: Finished difference. Result has 68 places, 41 transitions, 331 flow [2023-11-17 15:18:28,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=331, PETRI_PLACES=68, PETRI_TRANSITIONS=41} [2023-11-17 15:18:28,745 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2023-11-17 15:18:28,745 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 41 transitions, 331 flow [2023-11-17 15:18:28,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 0 states have call successors, (0), 0 states 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 15:18:28,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:18:28,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:28,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:18:28,746 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:18:28,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:18:28,746 INFO L85 PathProgramCache]: Analyzing trace with hash 545072424, now seen corresponding path program 1 times [2023-11-17 15:18:28,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:18:28,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384373244] [2023-11-17 15:18:28,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:18:28,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:18:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:18:28,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:18:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:18:28,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:18:28,842 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:18:28,843 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-17 15:18:28,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-17 15:18:28,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-17 15:18:28,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-17 15:18:28,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-17 15:18:28,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 15:18:28,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 15:18:28,845 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:18:28,850 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:18:28,850 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:18:28,888 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-17 15:18:28,889 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 15:18:28,890 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:18:28,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:18:28 BasicIcfg [2023-11-17 15:18:28,911 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:18:28,912 INFO L158 Benchmark]: Toolchain (without parser) took 12438.16ms. Allocated memory was 173.0MB in the beginning and 336.6MB in the end (delta: 163.6MB). Free memory was 127.7MB in the beginning and 201.3MB in the end (delta: -73.7MB). Peak memory consumption was 90.7MB. Max. memory is 8.0GB. [2023-11-17 15:18:28,912 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 173.0MB. Free memory is still 131.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:18:28,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 601.87ms. Allocated memory is still 173.0MB. Free memory was 127.3MB in the beginning and 104.1MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 15:18:28,912 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.27ms. Allocated memory is still 173.0MB. Free memory was 104.1MB in the beginning and 101.4MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 15:18:28,912 INFO L158 Benchmark]: Boogie Preprocessor took 25.49ms. Allocated memory is still 173.0MB. Free memory was 101.4MB in the beginning and 99.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:18:28,913 INFO L158 Benchmark]: RCFGBuilder took 646.67ms. Allocated memory is still 173.0MB. Free memory was 99.3MB in the beginning and 119.0MB in the end (delta: -19.6MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. [2023-11-17 15:18:28,913 INFO L158 Benchmark]: TraceAbstraction took 11081.49ms. Allocated memory was 173.0MB in the beginning and 336.6MB in the end (delta: 163.6MB). Free memory was 117.9MB in the beginning and 201.3MB in the end (delta: -83.4MB). Peak memory consumption was 80.2MB. Max. memory is 8.0GB. [2023-11-17 15:18:28,914 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 173.0MB. Free memory is still 131.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 601.87ms. Allocated memory is still 173.0MB. Free memory was 127.3MB in the beginning and 104.1MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 75.27ms. Allocated memory is still 173.0MB. Free memory was 104.1MB in the beginning and 101.4MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.49ms. Allocated memory is still 173.0MB. Free memory was 101.4MB in the beginning and 99.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 646.67ms. Allocated memory is still 173.0MB. Free memory was 99.3MB in the beginning and 119.0MB in the end (delta: -19.6MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. * TraceAbstraction took 11081.49ms. Allocated memory was 173.0MB in the beginning and 336.6MB in the end (delta: 163.6MB). Free memory was 117.9MB in the beginning and 201.3MB in the end (delta: -83.4MB). Peak memory consumption was 80.2MB. 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: 3.8s, 115 PlacesBefore, 34 PlacesAfterwards, 108 TransitionsBefore, 25 TransitionsAfterwards, 2190 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 97 TotalNumberOfCompositions, 4899 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2414, independent: 2271, independent conditional: 0, independent unconditional: 2271, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1476, independent: 1434, independent conditional: 0, independent unconditional: 1434, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1476, independent: 1414, independent conditional: 0, independent unconditional: 1414, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 344, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 318, dependent conditional: 0, dependent unconditional: 318, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2414, independent: 837, independent conditional: 0, independent unconditional: 837, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 1476, unknown conditional: 0, unknown unconditional: 1476] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 104, Positive conditional cache size: 0, Positive unconditional cache size: 104, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$r_buff1_thd3; [L726] 0 _Bool x$read_delayed; [L727] 0 int *x$read_delayed_var; [L728] 0 int x$w_buff0; [L729] 0 _Bool x$w_buff0_used; [L730] 0 int x$w_buff1; [L731] 0 _Bool x$w_buff1_used; [L733] 0 int y = 0; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2028; [L819] FCALL, FORK 0 pthread_create(&t2028, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2028={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L820] 0 pthread_t t2029; [L821] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L822] 0 pthread_t t2030; [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L823] FCALL, FORK 0 pthread_create(&t2030, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L851] 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, __unbuffered_p2_EAX=1, 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$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, 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: 821]: 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: 823]: 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: 819]: 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, 137 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: 10.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 361 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 361 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 986 IncrementalHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 18 mSDtfsCounter, 986 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=551occurred in iteration=9, InterpolantAutomatonStates: 68, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 747 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 15:18:28,939 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...