/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/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:17:28,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:17:28,911 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:17:28,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:17:28,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:17:28,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:17:28,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:17:28,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:17:28,946 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:17:28,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:17:28,951 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:17:28,951 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:17:28,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:17:28,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:17:28,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:17:28,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:17:28,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:17:28,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:17:28,954 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:17:28,954 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:17:28,954 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:17:28,955 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:17:28,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:17:28,955 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:17:28,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:17:28,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:17:28,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:17:28,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:17:28,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:17:28,957 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:17:28,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:17:28,958 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:17:28,958 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:17:29,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:17:29,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:17:29,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:17:29,220 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:17:29,220 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:17:29,222 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-11-17 15:17:30,434 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:17:30,649 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:17:30,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-11-17 15:17:30,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1e9fad50/df29477f2b2f411bb4310387b7af5aea/FLAG4a905aa3d [2023-11-17 15:17:30,695 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1e9fad50/df29477f2b2f411bb4310387b7af5aea [2023-11-17 15:17:30,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:17:30,698 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:17:30,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:17:30,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:17:30,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:17:30,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:17:30" (1/1) ... [2023-11-17 15:17:30,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54972d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:30, skipping insertion in model container [2023-11-17 15:17:30,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:17:30" (1/1) ... [2023-11-17 15:17:30,747 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:17:30,896 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/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2023-11-17 15:17:31,116 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:17:31,133 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:17:31,146 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/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2023-11-17 15:17:31,197 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:17:31,236 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:17:31,236 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:17:31,243 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:17:31,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:31 WrapperNode [2023-11-17 15:17:31,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:17:31,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:17:31,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:17:31,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:17:31,251 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:17:31" (1/1) ... [2023-11-17 15:17:31,276 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:17:31" (1/1) ... [2023-11-17 15:17:31,320 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2023-11-17 15:17:31,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:17:31,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:17:31,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:17:31,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:17:31,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:31" (1/1) ... [2023-11-17 15:17:31,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:31" (1/1) ... [2023-11-17 15:17:31,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:31" (1/1) ... [2023-11-17 15:17:31,348 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:31" (1/1) ... [2023-11-17 15:17:31,354 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:31" (1/1) ... [2023-11-17 15:17:31,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:31" (1/1) ... [2023-11-17 15:17:31,358 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:31" (1/1) ... [2023-11-17 15:17:31,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:31" (1/1) ... [2023-11-17 15:17:31,363 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:17:31,363 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:17:31,364 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:17:31,364 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:17:31,365 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:31" (1/1) ... [2023-11-17 15:17:31,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:17:31,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:17:31,424 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:17:31,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:17:31,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:17:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:17:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:17:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:17:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:17:31,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:17:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:17:31,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:17:31,447 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:17:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:17:31,465 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:17:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:17:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:17:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:17:31,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:17:31,467 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:17:31,607 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:17:31,609 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:17:31,871 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:17:31,985 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:17:31,985 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:17:31,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:17:31 BoogieIcfgContainer [2023-11-17 15:17:31,987 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:17:31,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:17:31,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:17:31,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:17:31,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:17:30" (1/3) ... [2023-11-17 15:17:31,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51796c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:17:31, skipping insertion in model container [2023-11-17 15:17:31,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:17:31" (2/3) ... [2023-11-17 15:17:31,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51796c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:17:31, skipping insertion in model container [2023-11-17 15:17:31,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:17:31" (3/3) ... [2023-11-17 15:17:31,994 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-11-17 15:17:32,014 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:17:32,015 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:17:32,015 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:17:32,077 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:17:32,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 234 flow [2023-11-17 15:17:32,193 INFO L124 PetriNetUnfolderBase]: 2/108 cut-off events. [2023-11-17 15:17:32,194 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:17:32,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-11-17 15:17:32,199 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 111 transitions, 234 flow [2023-11-17 15:17:32,203 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 108 transitions, 225 flow [2023-11-17 15:17:32,207 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:17:32,219 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 108 transitions, 225 flow [2023-11-17 15:17:32,221 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 108 transitions, 225 flow [2023-11-17 15:17:32,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 225 flow [2023-11-17 15:17:32,244 INFO L124 PetriNetUnfolderBase]: 2/108 cut-off events. [2023-11-17 15:17:32,245 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:17:32,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-11-17 15:17:32,247 INFO L119 LiptonReduction]: Number of co-enabled transitions 2082 [2023-11-17 15:17:36,135 INFO L134 LiptonReduction]: Checked pairs total: 4929 [2023-11-17 15:17:36,135 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-11-17 15:17:36,150 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:17:36,156 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;@4a60a39f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:17:36,156 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 15:17:36,159 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:17:36,159 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-11-17 15:17:36,159 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:17:36,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:36,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 15:17:36,160 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:17:36,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:36,165 INFO L85 PathProgramCache]: Analyzing trace with hash 457991198, now seen corresponding path program 1 times [2023-11-17 15:17:36,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:36,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216322632] [2023-11-17 15:17:36,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:36,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:36,605 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:17:36,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:36,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216322632] [2023-11-17 15:17:36,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216322632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:36,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:36,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:17:36,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926580215] [2023-11-17 15:17:36,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:36,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:17:36,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:36,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:17:36,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:17:36,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 210 [2023-11-17 15:17:36,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states 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:17:36,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:36,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 210 [2023-11-17 15:17:36,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:36,932 INFO L124 PetriNetUnfolderBase]: 711/1164 cut-off events. [2023-11-17 15:17:36,933 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-17 15:17:36,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2283 conditions, 1164 events. 711/1164 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5667 event pairs, 117 based on Foata normal form. 0/1096 useless extension candidates. Maximal degree in co-relation 2272. Up to 859 conditions per place. [2023-11-17 15:17:36,948 INFO L140 encePairwiseOnDemand]: 206/210 looper letters, 27 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2023-11-17 15:17:36,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 140 flow [2023-11-17 15:17:36,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:17:36,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:17:36,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2023-11-17 15:17:36,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5206349206349207 [2023-11-17 15:17:36,968 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2023-11-17 15:17:36,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2023-11-17 15:17:36,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:36,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2023-11-17 15:17:36,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states 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:17:36,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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:17:36,986 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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:17:36,987 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 55 flow. Second operand 3 states and 328 transitions. [2023-11-17 15:17:36,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 140 flow [2023-11-17 15:17:36,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 136 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 15:17:36,992 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-11-17 15:17:36,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-11-17 15:17:36,997 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-11-17 15:17:36,998 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-11-17 15:17:36,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states 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:17:36,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:36,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:36,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:17:36,999 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:17:37,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:37,001 INFO L85 PathProgramCache]: Analyzing trace with hash 459168599, now seen corresponding path program 1 times [2023-11-17 15:17:37,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:37,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340195870] [2023-11-17 15:17:37,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:37,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:37,256 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:17:37,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:37,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340195870] [2023-11-17 15:17:37,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340195870] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:37,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:37,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:17:37,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87277518] [2023-11-17 15:17:37,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:37,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:17:37,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:37,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:17:37,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:17:37,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 210 [2023-11-17 15:17:37,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states 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:17:37,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:37,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 210 [2023-11-17 15:17:37,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:37,411 INFO L124 PetriNetUnfolderBase]: 527/860 cut-off events. [2023-11-17 15:17:37,411 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-17 15:17:37,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1782 conditions, 860 events. 527/860 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3762 event pairs, 143 based on Foata normal form. 16/872 useless extension candidates. Maximal degree in co-relation 1772. Up to 609 conditions per place. [2023-11-17 15:17:37,416 INFO L140 encePairwiseOnDemand]: 207/210 looper letters, 24 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2023-11-17 15:17:37,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 120 flow [2023-11-17 15:17:37,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:17:37,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:17:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2023-11-17 15:17:37,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-17 15:17:37,420 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2023-11-17 15:17:37,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2023-11-17 15:17:37,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:37,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2023-11-17 15:17:37,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states 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:17:37,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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:17:37,425 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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:17:37,425 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states and 315 transitions. [2023-11-17 15:17:37,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 120 flow [2023-11-17 15:17:37,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:17:37,428 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 54 flow [2023-11-17 15:17:37,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-11-17 15:17:37,429 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-11-17 15:17:37,430 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2023-11-17 15:17:37,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states 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:17:37,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:37,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:37,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:17:37,432 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:17:37,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:37,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1349323449, now seen corresponding path program 1 times [2023-11-17 15:17:37,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:37,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510479496] [2023-11-17 15:17:37,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:37,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:37,612 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:17:37,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:37,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510479496] [2023-11-17 15:17:37,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510479496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:37,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:37,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:17:37,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123014900] [2023-11-17 15:17:37,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:37,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:17:37,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:37,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:17:37,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:17:37,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 210 [2023-11-17 15:17:37,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 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:17:37,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:37,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 210 [2023-11-17 15:17:37,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:37,890 INFO L124 PetriNetUnfolderBase]: 1188/1822 cut-off events. [2023-11-17 15:17:37,891 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2023-11-17 15:17:37,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3960 conditions, 1822 events. 1188/1822 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8177 event pairs, 138 based on Foata normal form. 56/1878 useless extension candidates. Maximal degree in co-relation 3949. Up to 1052 conditions per place. [2023-11-17 15:17:37,900 INFO L140 encePairwiseOnDemand]: 203/210 looper letters, 36 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2023-11-17 15:17:37,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 44 transitions, 200 flow [2023-11-17 15:17:37,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:17:37,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:17:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 406 transitions. [2023-11-17 15:17:37,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2023-11-17 15:17:37,902 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 406 transitions. [2023-11-17 15:17:37,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 406 transitions. [2023-11-17 15:17:37,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:37,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 406 transitions. [2023-11-17 15:17:37,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:37,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states 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:17:37,906 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states 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:17:37,906 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 4 states and 406 transitions. [2023-11-17 15:17:37,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 44 transitions, 200 flow [2023-11-17 15:17:37,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 44 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:17:37,907 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 107 flow [2023-11-17 15:17:37,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-11-17 15:17:37,909 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2023-11-17 15:17:37,909 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 107 flow [2023-11-17 15:17:37,909 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:17:37,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:37,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:37,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:17:37,910 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:17:37,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:37,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1154293216, now seen corresponding path program 1 times [2023-11-17 15:17:37,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:37,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127614920] [2023-11-17 15:17:37,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:37,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:38,047 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:17:38,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:38,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127614920] [2023-11-17 15:17:38,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127614920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:38,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:38,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:17:38,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517446492] [2023-11-17 15:17:38,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:38,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:17:38,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:38,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:17:38,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:17:38,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 210 [2023-11-17 15:17:38,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states 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:17:38,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:38,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 210 [2023-11-17 15:17:38,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:38,273 INFO L124 PetriNetUnfolderBase]: 950/1493 cut-off events. [2023-11-17 15:17:38,273 INFO L125 PetriNetUnfolderBase]: For 923/933 co-relation queries the response was YES. [2023-11-17 15:17:38,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3847 conditions, 1493 events. 950/1493 cut-off events. For 923/933 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7188 event pairs, 344 based on Foata normal form. 18/1456 useless extension candidates. Maximal degree in co-relation 3833. Up to 1256 conditions per place. [2023-11-17 15:17:38,280 INFO L140 encePairwiseOnDemand]: 207/210 looper letters, 30 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2023-11-17 15:17:38,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 204 flow [2023-11-17 15:17:38,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:17:38,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:17:38,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2023-11-17 15:17:38,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063492063492063 [2023-11-17 15:17:38,282 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2023-11-17 15:17:38,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2023-11-17 15:17:38,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:38,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2023-11-17 15:17:38,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states 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:17:38,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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:17:38,285 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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:17:38,285 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 107 flow. Second operand 3 states and 319 transitions. [2023-11-17 15:17:38,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 204 flow [2023-11-17 15:17:38,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 204 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 15:17:38,288 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 118 flow [2023-11-17 15:17:38,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2023-11-17 15:17:38,290 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2023-11-17 15:17:38,290 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 118 flow [2023-11-17 15:17:38,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states 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:17:38,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:38,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:38,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:17:38,291 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:17:38,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:38,291 INFO L85 PathProgramCache]: Analyzing trace with hash -428659931, now seen corresponding path program 1 times [2023-11-17 15:17:38,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:38,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738997617] [2023-11-17 15:17:38,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:38,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:38,428 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:17:38,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:38,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738997617] [2023-11-17 15:17:38,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738997617] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:38,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:38,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:17:38,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626417865] [2023-11-17 15:17:38,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:38,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:17:38,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:38,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:17:38,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:17:38,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 210 [2023-11-17 15:17:38,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 118 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:17:38,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:38,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 210 [2023-11-17 15:17:38,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:38,765 INFO L124 PetriNetUnfolderBase]: 1388/2124 cut-off events. [2023-11-17 15:17:38,767 INFO L125 PetriNetUnfolderBase]: For 1896/1896 co-relation queries the response was YES. [2023-11-17 15:17:38,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5828 conditions, 2124 events. 1388/2124 cut-off events. For 1896/1896 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9726 event pairs, 308 based on Foata normal form. 54/2178 useless extension candidates. Maximal degree in co-relation 5811. Up to 1293 conditions per place. [2023-11-17 15:17:38,777 INFO L140 encePairwiseOnDemand]: 203/210 looper letters, 37 selfloop transitions, 7 changer transitions 9/53 dead transitions. [2023-11-17 15:17:38,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 314 flow [2023-11-17 15:17:38,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:17:38,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:17:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 500 transitions. [2023-11-17 15:17:38,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2023-11-17 15:17:38,780 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 500 transitions. [2023-11-17 15:17:38,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 500 transitions. [2023-11-17 15:17:38,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:38,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 500 transitions. [2023-11-17 15:17:38,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.0) internal successors, (500), 5 states have internal predecessors, (500), 0 states have call successors, (0), 0 states 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:17:38,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states 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:17:38,785 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states 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:17:38,785 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 118 flow. Second operand 5 states and 500 transitions. [2023-11-17 15:17:38,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 314 flow [2023-11-17 15:17:38,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 302 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:17:38,792 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 141 flow [2023-11-17 15:17:38,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2023-11-17 15:17:38,794 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2023-11-17 15:17:38,794 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 141 flow [2023-11-17 15:17:38,795 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:17:38,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:38,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:38,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:17:38,795 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:17:38,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:38,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1372769662, now seen corresponding path program 1 times [2023-11-17 15:17:38,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:38,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356355543] [2023-11-17 15:17:38,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:38,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:38,960 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:17:38,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:38,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356355543] [2023-11-17 15:17:38,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356355543] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:38,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:38,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:17:38,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038440972] [2023-11-17 15:17:38,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:38,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:17:38,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:38,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:17:38,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:17:38,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 210 [2023-11-17 15:17:38,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states 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:17:38,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:38,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 210 [2023-11-17 15:17:38,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:39,144 INFO L124 PetriNetUnfolderBase]: 628/980 cut-off events. [2023-11-17 15:17:39,145 INFO L125 PetriNetUnfolderBase]: For 1176/1176 co-relation queries the response was YES. [2023-11-17 15:17:39,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3022 conditions, 980 events. 628/980 cut-off events. For 1176/1176 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3781 event pairs, 166 based on Foata normal form. 9/989 useless extension candidates. Maximal degree in co-relation 3003. Up to 523 conditions per place. [2023-11-17 15:17:39,152 INFO L140 encePairwiseOnDemand]: 205/210 looper letters, 37 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2023-11-17 15:17:39,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 279 flow [2023-11-17 15:17:39,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:17:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:17:39,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 399 transitions. [2023-11-17 15:17:39,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2023-11-17 15:17:39,154 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 399 transitions. [2023-11-17 15:17:39,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 399 transitions. [2023-11-17 15:17:39,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:39,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 399 transitions. [2023-11-17 15:17:39,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states 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:17:39,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states 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:17:39,157 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states 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:17:39,158 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 141 flow. Second operand 4 states and 399 transitions. [2023-11-17 15:17:39,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 279 flow [2023-11-17 15:17:39,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 258 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-11-17 15:17:39,161 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 157 flow [2023-11-17 15:17:39,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-11-17 15:17:39,162 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2023-11-17 15:17:39,162 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 157 flow [2023-11-17 15:17:39,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states 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:17:39,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:39,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:39,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:17:39,163 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:17:39,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:39,163 INFO L85 PathProgramCache]: Analyzing trace with hash -350052063, now seen corresponding path program 1 times [2023-11-17 15:17:39,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:39,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132648040] [2023-11-17 15:17:39,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:39,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:39,283 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:17:39,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:39,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132648040] [2023-11-17 15:17:39,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132648040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:39,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:39,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:17:39,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566327875] [2023-11-17 15:17:39,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:39,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:17:39,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:39,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:17:39,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:17:39,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 210 [2023-11-17 15:17:39,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:39,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:39,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 210 [2023-11-17 15:17:39,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:39,531 INFO L124 PetriNetUnfolderBase]: 897/1405 cut-off events. [2023-11-17 15:17:39,531 INFO L125 PetriNetUnfolderBase]: For 1398/1398 co-relation queries the response was YES. [2023-11-17 15:17:39,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4236 conditions, 1405 events. 897/1405 cut-off events. For 1398/1398 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5923 event pairs, 267 based on Foata normal form. 27/1432 useless extension candidates. Maximal degree in co-relation 4218. Up to 674 conditions per place. [2023-11-17 15:17:39,538 INFO L140 encePairwiseOnDemand]: 203/210 looper letters, 35 selfloop transitions, 8 changer transitions 10/53 dead transitions. [2023-11-17 15:17:39,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 53 transitions, 349 flow [2023-11-17 15:17:39,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:17:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:17:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 497 transitions. [2023-11-17 15:17:39,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2023-11-17 15:17:39,541 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 497 transitions. [2023-11-17 15:17:39,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 497 transitions. [2023-11-17 15:17:39,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:39,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 497 transitions. [2023-11-17 15:17:39,542 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:17:39,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states 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:17:39,544 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states 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:17:39,544 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 157 flow. Second operand 5 states and 497 transitions. [2023-11-17 15:17:39,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 53 transitions, 349 flow [2023-11-17 15:17:39,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 341 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-17 15:17:39,550 INFO L231 Difference]: Finished difference. Result has 46 places, 26 transitions, 167 flow [2023-11-17 15:17:39,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=46, PETRI_TRANSITIONS=26} [2023-11-17 15:17:39,552 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2023-11-17 15:17:39,552 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 26 transitions, 167 flow [2023-11-17 15:17:39,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:39,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:39,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:39,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:17:39,553 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:17:39,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:39,553 INFO L85 PathProgramCache]: Analyzing trace with hash -393844833, now seen corresponding path program 2 times [2023-11-17 15:17:39,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:39,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235233073] [2023-11-17 15:17:39,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:39,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:39,695 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:17:39,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:39,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235233073] [2023-11-17 15:17:39,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235233073] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:39,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:39,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:17:39,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548035967] [2023-11-17 15:17:39,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:39,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:17:39,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:39,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:17:39,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:17:39,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 210 [2023-11-17 15:17:39,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 26 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:39,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:39,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 210 [2023-11-17 15:17:39,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:39,897 INFO L124 PetriNetUnfolderBase]: 625/977 cut-off events. [2023-11-17 15:17:39,898 INFO L125 PetriNetUnfolderBase]: For 1455/1455 co-relation queries the response was YES. [2023-11-17 15:17:39,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3054 conditions, 977 events. 625/977 cut-off events. For 1455/1455 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3854 event pairs, 109 based on Foata normal form. 27/1004 useless extension candidates. Maximal degree in co-relation 3032. Up to 388 conditions per place. [2023-11-17 15:17:39,903 INFO L140 encePairwiseOnDemand]: 205/210 looper letters, 25 selfloop transitions, 3 changer transitions 22/50 dead transitions. [2023-11-17 15:17:39,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 50 transitions, 323 flow [2023-11-17 15:17:39,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:17:39,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:17:39,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 588 transitions. [2023-11-17 15:17:39,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-11-17 15:17:39,906 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 588 transitions. [2023-11-17 15:17:39,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 588 transitions. [2023-11-17 15:17:39,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:39,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 588 transitions. [2023-11-17 15:17:39,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states 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:17:39,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states 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:17:39,910 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states 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:17:39,910 INFO L175 Difference]: Start difference. First operand has 46 places, 26 transitions, 167 flow. Second operand 6 states and 588 transitions. [2023-11-17 15:17:39,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 50 transitions, 323 flow [2023-11-17 15:17:39,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 301 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-11-17 15:17:39,913 INFO L231 Difference]: Finished difference. Result has 46 places, 20 transitions, 92 flow [2023-11-17 15:17:39,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=46, PETRI_TRANSITIONS=20} [2023-11-17 15:17:39,915 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2023-11-17 15:17:39,915 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 20 transitions, 92 flow [2023-11-17 15:17:39,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:17:39,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:39,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:39,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:17:39,916 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:17:39,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:39,917 INFO L85 PathProgramCache]: Analyzing trace with hash -393855063, now seen corresponding path program 3 times [2023-11-17 15:17:39,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:39,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506089444] [2023-11-17 15:17:39,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:39,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:40,090 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:17:40,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:40,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506089444] [2023-11-17 15:17:40,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506089444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:40,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:40,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:17:40,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064232695] [2023-11-17 15:17:40,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:40,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:17:40,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:40,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:17:40,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:17:40,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 210 [2023-11-17 15:17:40,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 20 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states 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:17:40,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:40,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 210 [2023-11-17 15:17:40,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:40,208 INFO L124 PetriNetUnfolderBase]: 214/378 cut-off events. [2023-11-17 15:17:40,208 INFO L125 PetriNetUnfolderBase]: For 337/339 co-relation queries the response was YES. [2023-11-17 15:17:40,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 378 events. 214/378 cut-off events. For 337/339 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1449 event pairs, 42 based on Foata normal form. 41/418 useless extension candidates. Maximal degree in co-relation 1014. Up to 241 conditions per place. [2023-11-17 15:17:40,210 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 24 selfloop transitions, 4 changer transitions 18/48 dead transitions. [2023-11-17 15:17:40,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 278 flow [2023-11-17 15:17:40,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:17:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:17:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2023-11-17 15:17:40,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47904761904761906 [2023-11-17 15:17:40,213 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 503 transitions. [2023-11-17 15:17:40,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 503 transitions. [2023-11-17 15:17:40,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:40,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 503 transitions. [2023-11-17 15:17:40,214 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:17:40,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states 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:17:40,216 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states 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:17:40,216 INFO L175 Difference]: Start difference. First operand has 46 places, 20 transitions, 92 flow. Second operand 5 states and 503 transitions. [2023-11-17 15:17:40,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 278 flow [2023-11-17 15:17:40,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 48 transitions, 228 flow, removed 8 selfloop flow, removed 13 redundant places. [2023-11-17 15:17:40,218 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 96 flow [2023-11-17 15:17:40,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2023-11-17 15:17:40,219 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2023-11-17 15:17:40,219 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 96 flow [2023-11-17 15:17:40,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states 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:17:40,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:40,220 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:17:40,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:17:40,220 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:17:40,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:40,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2100801217, now seen corresponding path program 1 times [2023-11-17 15:17:40,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:40,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16644758] [2023-11-17 15:17:40,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:40,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:40,348 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:17:40,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:40,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16644758] [2023-11-17 15:17:40,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16644758] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:40,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:40,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:17:40,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758032213] [2023-11-17 15:17:40,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:40,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:17:40,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:40,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:17:40,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:17:40,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 210 [2023-11-17 15:17:40,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 states 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:17:40,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:40,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 210 [2023-11-17 15:17:40,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:40,481 INFO L124 PetriNetUnfolderBase]: 100/203 cut-off events. [2023-11-17 15:17:40,482 INFO L125 PetriNetUnfolderBase]: For 127/128 co-relation queries the response was YES. [2023-11-17 15:17:40,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 203 events. 100/203 cut-off events. For 127/128 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 664 event pairs, 17 based on Foata normal form. 25/227 useless extension candidates. Maximal degree in co-relation 642. Up to 88 conditions per place. [2023-11-17 15:17:40,483 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 28 selfloop transitions, 7 changer transitions 16/53 dead transitions. [2023-11-17 15:17:40,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 53 transitions, 320 flow [2023-11-17 15:17:40,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:17:40,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:17:40,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 599 transitions. [2023-11-17 15:17:40,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4753968253968254 [2023-11-17 15:17:40,485 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 599 transitions. [2023-11-17 15:17:40,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 599 transitions. [2023-11-17 15:17:40,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:40,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 599 transitions. [2023-11-17 15:17:40,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 0 states 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:17:40,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states 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:17:40,493 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states 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:17:40,494 INFO L175 Difference]: Start difference. First operand has 37 places, 23 transitions, 96 flow. Second operand 6 states and 599 transitions. [2023-11-17 15:17:40,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 53 transitions, 320 flow [2023-11-17 15:17:40,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 53 transitions, 314 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 15:17:40,496 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 146 flow [2023-11-17 15:17:40,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2023-11-17 15:17:40,497 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2023-11-17 15:17:40,497 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 146 flow [2023-11-17 15:17:40,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 states 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:17:40,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:40,498 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:17:40,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:17:40,498 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:17:40,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:40,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2024216572, now seen corresponding path program 1 times [2023-11-17 15:17:40,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:40,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485511675] [2023-11-17 15:17:40,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:40,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:40,675 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:17:40,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:40,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485511675] [2023-11-17 15:17:40,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485511675] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:40,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:40,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:17:40,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415979589] [2023-11-17 15:17:40,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:40,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:17:40,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:40,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:17:40,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:17:40,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 210 [2023-11-17 15:17:40,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 states 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:17:40,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:40,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 210 [2023-11-17 15:17:40,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:40,789 INFO L124 PetriNetUnfolderBase]: 54/120 cut-off events. [2023-11-17 15:17:40,789 INFO L125 PetriNetUnfolderBase]: For 160/161 co-relation queries the response was YES. [2023-11-17 15:17:40,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 120 events. 54/120 cut-off events. For 160/161 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 304 event pairs, 14 based on Foata normal form. 8/127 useless extension candidates. Maximal degree in co-relation 417. Up to 48 conditions per place. [2023-11-17 15:17:40,790 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 25 selfloop transitions, 10 changer transitions 8/45 dead transitions. [2023-11-17 15:17:40,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 316 flow [2023-11-17 15:17:40,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:17:40,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:17:40,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 682 transitions. [2023-11-17 15:17:40,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4639455782312925 [2023-11-17 15:17:40,793 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 682 transitions. [2023-11-17 15:17:40,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 682 transitions. [2023-11-17 15:17:40,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:40,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 682 transitions. [2023-11-17 15:17:40,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 0 states have call successors, (0), 0 states 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:17:40,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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:17:40,798 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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:17:40,798 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 146 flow. Second operand 7 states and 682 transitions. [2023-11-17 15:17:40,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 316 flow [2023-11-17 15:17:40,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 263 flow, removed 20 selfloop flow, removed 5 redundant places. [2023-11-17 15:17:40,800 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 140 flow [2023-11-17 15:17:40,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2023-11-17 15:17:40,800 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2023-11-17 15:17:40,800 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 140 flow [2023-11-17 15:17:40,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 states 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:17:40,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:40,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:40,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:17:40,801 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:17:40,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:40,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1730544963, now seen corresponding path program 1 times [2023-11-17 15:17:40,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:40,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583250000] [2023-11-17 15:17:40,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:40,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:17:42,091 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:17:42,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:17:42,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583250000] [2023-11-17 15:17:42,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583250000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:17:42,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:17:42,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:17:42,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006872908] [2023-11-17 15:17:42,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:17:42,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:17:42,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:17:42,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:17:42,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:17:42,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 210 [2023-11-17 15:17:42,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 26 transitions, 140 flow. Second operand has 8 states, 8 states have (on average 87.25) internal successors, (698), 8 states have internal predecessors, (698), 0 states have call successors, (0), 0 states 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:17:42,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:17:42,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 210 [2023-11-17 15:17:42,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:17:42,308 INFO L124 PetriNetUnfolderBase]: 69/158 cut-off events. [2023-11-17 15:17:42,308 INFO L125 PetriNetUnfolderBase]: For 273/273 co-relation queries the response was YES. [2023-11-17 15:17:42,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 158 events. 69/158 cut-off events. For 273/273 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 509 event pairs, 13 based on Foata normal form. 1/159 useless extension candidates. Maximal degree in co-relation 558. Up to 57 conditions per place. [2023-11-17 15:17:42,309 INFO L140 encePairwiseOnDemand]: 203/210 looper letters, 37 selfloop transitions, 5 changer transitions 17/61 dead transitions. [2023-11-17 15:17:42,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 487 flow [2023-11-17 15:17:42,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:17:42,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:17:42,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 637 transitions. [2023-11-17 15:17:42,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2023-11-17 15:17:42,314 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 637 transitions. [2023-11-17 15:17:42,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 637 transitions. [2023-11-17 15:17:42,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:17:42,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 637 transitions. [2023-11-17 15:17:42,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 states 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:17:42,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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:17:42,318 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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:17:42,318 INFO L175 Difference]: Start difference. First operand has 43 places, 26 transitions, 140 flow. Second operand 7 states and 637 transitions. [2023-11-17 15:17:42,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 487 flow [2023-11-17 15:17:42,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 61 transitions, 375 flow, removed 36 selfloop flow, removed 6 redundant places. [2023-11-17 15:17:42,322 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 135 flow [2023-11-17 15:17:42,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=135, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2023-11-17 15:17:42,322 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2023-11-17 15:17:42,322 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 135 flow [2023-11-17 15:17:42,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.25) internal successors, (698), 8 states have internal predecessors, (698), 0 states have call successors, (0), 0 states 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:17:42,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:17:42,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:42,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 15:17:42,323 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:17:42,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:17:42,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1456911351, now seen corresponding path program 2 times [2023-11-17 15:17:42,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:17:42,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618049749] [2023-11-17 15:17:42,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:17:42,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:17:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:17:42,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:17:42,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:17:42,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:17:42,424 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:17:42,425 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-17 15:17:42,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-17 15:17:42,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-17 15:17:42,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-17 15:17:42,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-17 15:17:42,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 15:17:42,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 15:17:42,428 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:17:42,433 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:17:42,433 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:17:42,465 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 15:17:42,466 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:17:42,467 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 15:17:42,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:17:42 BasicIcfg [2023-11-17 15:17:42,480 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:17:42,481 INFO L158 Benchmark]: Toolchain (without parser) took 11782.92ms. Allocated memory was 246.4MB in the beginning and 358.6MB in the end (delta: 112.2MB). Free memory was 191.5MB in the beginning and 286.9MB in the end (delta: -95.4MB). Peak memory consumption was 17.9MB. Max. memory is 8.0GB. [2023-11-17 15:17:42,481 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 181.4MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:17:42,481 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.15ms. Allocated memory is still 246.4MB. Free memory was 191.5MB in the beginning and 168.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 15:17:42,482 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.31ms. Allocated memory is still 246.4MB. Free memory was 168.4MB in the beginning and 165.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:17:42,482 INFO L158 Benchmark]: Boogie Preprocessor took 41.45ms. Allocated memory is still 246.4MB. Free memory was 165.8MB in the beginning and 164.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:17:42,482 INFO L158 Benchmark]: RCFGBuilder took 623.34ms. Allocated memory is still 246.4MB. Free memory was 164.0MB in the beginning and 179.9MB in the end (delta: -15.9MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. [2023-11-17 15:17:42,482 INFO L158 Benchmark]: TraceAbstraction took 10492.15ms. Allocated memory was 246.4MB in the beginning and 358.6MB in the end (delta: 112.2MB). Free memory was 179.4MB in the beginning and 286.9MB in the end (delta: -107.5MB). Peak memory consumption was 4.7MB. Max. memory is 8.0GB. [2023-11-17 15:17:42,483 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.20ms. Allocated memory is still 181.4MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 544.15ms. Allocated memory is still 246.4MB. Free memory was 191.5MB in the beginning and 168.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 76.31ms. Allocated memory is still 246.4MB. Free memory was 168.4MB in the beginning and 165.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.45ms. Allocated memory is still 246.4MB. Free memory was 165.8MB in the beginning and 164.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 623.34ms. Allocated memory is still 246.4MB. Free memory was 164.0MB in the beginning and 179.9MB in the end (delta: -15.9MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. * TraceAbstraction took 10492.15ms. Allocated memory was 246.4MB in the beginning and 358.6MB in the end (delta: 112.2MB). Free memory was 179.4MB in the beginning and 286.9MB in the end (delta: -107.5MB). Peak memory consumption was 4.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 Unfinished Backtranslation: IdentifierExpression #t~pre9 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.9s, 116 PlacesBefore, 32 PlacesAfterwards, 108 TransitionsBefore, 23 TransitionsAfterwards, 2082 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, 4929 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2317, independent: 2151, independent conditional: 0, independent unconditional: 2151, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1473, independent: 1423, independent conditional: 0, independent unconditional: 1423, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1473, independent: 1397, independent conditional: 0, independent unconditional: 1397, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 76, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 280, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 232, dependent conditional: 0, dependent unconditional: 232, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2317, independent: 728, independent conditional: 0, independent unconditional: 728, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 1473, unknown conditional: 0, unknown unconditional: 1473] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 78, Positive conditional cache size: 0, Positive unconditional cache size: 78, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L829] 0 pthread_t t1828; [L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1828={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] [L831] 0 pthread_t t1829; [L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1828={5:0}, t1829={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] [L833] 0 pthread_t t1830; [L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1828={5:0}, t1829={6:0}, t1830={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=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] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L801] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EBX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=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$$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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L787] 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) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 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 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 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_p0_EAX=2, __unbuffered_p0_EBX=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$$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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L807] 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) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 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 [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 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=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=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$$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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 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) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 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 [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 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_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828={5:0}, t1829={6:0}, t1830={3: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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __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=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 19]: 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: 834]: 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: 832]: 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: 830]: 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, 138 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.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 245 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 245 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 802 IncrementalHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 11 mSDtfsCounter, 802 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=7, InterpolantAutomatonStates: 58, 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.9s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 1088 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:17:42,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...