/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix006_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:23:56,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:23:57,020 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 11:23:57,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:23:57,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:23:57,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:23:57,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:23:57,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:23:57,053 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:23:57,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:23:57,057 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:23:57,057 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:23:57,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:23:57,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:23:57,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:23:57,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:23:57,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:23:57,059 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:23:57,059 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:23:57,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:23:57,059 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:23:57,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:23:57,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:23:57,060 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:23:57,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:23:57,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:23:57,061 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:23:57,062 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:23:57,062 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:23:57,062 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:23:57,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:23:57,063 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:23:57,063 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:23:57,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:23:57,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:23:57,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:23:57,293 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:23:57,294 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:23:57,295 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_tso.oepc.i [2023-11-17 11:23:58,357 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:23:58,600 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:23:58,604 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_tso.oepc.i [2023-11-17 11:23:58,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2faceda22/62d815c33c0647f8b6aa878219b05ad9/FLAGf7719fa17 [2023-11-17 11:23:58,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2faceda22/62d815c33c0647f8b6aa878219b05ad9 [2023-11-17 11:23:58,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:23:58,651 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:23:58,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:23:58,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:23:58,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:23:58,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:23:58" (1/1) ... [2023-11-17 11:23:58,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@441c4fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:58, skipping insertion in model container [2023-11-17 11:23:58,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:23:58" (1/1) ... [2023-11-17 11:23:58,707 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:23:58,858 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/mix006_tso.oepc.i[949,962] [2023-11-17 11:23:59,050 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:23:59,068 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:23:59,076 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/mix006_tso.oepc.i[949,962] [2023-11-17 11:23:59,133 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:23:59,157 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:23:59,157 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:23:59,164 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:23:59,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:59 WrapperNode [2023-11-17 11:23:59,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:23:59,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:23:59,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:23:59,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:23:59,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:59" (1/1) ... [2023-11-17 11:23:59,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:59" (1/1) ... [2023-11-17 11:23:59,213 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 263 [2023-11-17 11:23:59,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:23:59,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:23:59,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:23:59,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:23:59,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:59" (1/1) ... [2023-11-17 11:23:59,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:59" (1/1) ... [2023-11-17 11:23:59,233 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:59" (1/1) ... [2023-11-17 11:23:59,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:59" (1/1) ... [2023-11-17 11:23:59,242 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:59" (1/1) ... [2023-11-17 11:23:59,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:59" (1/1) ... [2023-11-17 11:23:59,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:59" (1/1) ... [2023-11-17 11:23:59,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:59" (1/1) ... [2023-11-17 11:23:59,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:23:59,251 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:23:59,251 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:23:59,251 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:23:59,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:59" (1/1) ... [2023-11-17 11:23:59,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:23:59,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:23:59,305 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 11:23:59,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 11:23:59,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:23:59,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:23:59,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:23:59,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:23:59,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:23:59,328 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:23:59,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:23:59,328 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:23:59,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:23:59,329 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 11:23:59,329 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 11:23:59,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:23:59,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:23:59,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:23:59,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:23:59,330 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:23:59,434 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:23:59,435 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:23:59,745 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:23:59,959 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:23:59,959 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:23:59,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:23:59 BoogieIcfgContainer [2023-11-17 11:23:59,960 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:23:59,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:23:59,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:23:59,965 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:23:59,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:23:58" (1/3) ... [2023-11-17 11:23:59,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a759079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:23:59, skipping insertion in model container [2023-11-17 11:23:59,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:23:59" (2/3) ... [2023-11-17 11:23:59,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a759079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:23:59, skipping insertion in model container [2023-11-17 11:23:59,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:23:59" (3/3) ... [2023-11-17 11:23:59,968 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006_tso.oepc.i [2023-11-17 11:23:59,982 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:23:59,983 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-17 11:23:59,983 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:24:00,029 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:24:00,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 98 flow [2023-11-17 11:24:00,090 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2023-11-17 11:24:00,091 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:24:00,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2023-11-17 11:24:00,096 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 43 transitions, 98 flow [2023-11-17 11:24:00,101 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 40 transitions, 89 flow [2023-11-17 11:24:00,103 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:24:00,117 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 40 transitions, 89 flow [2023-11-17 11:24:00,120 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 40 transitions, 89 flow [2023-11-17 11:24:00,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 40 transitions, 89 flow [2023-11-17 11:24:00,139 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2023-11-17 11:24:00,139 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:24:00,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2023-11-17 11:24:00,140 INFO L119 LiptonReduction]: Number of co-enabled transitions 938 [2023-11-17 11:24:01,865 INFO L134 LiptonReduction]: Checked pairs total: 2485 [2023-11-17 11:24:01,865 INFO L136 LiptonReduction]: Total number of compositions: 21 [2023-11-17 11:24:01,876 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:24:01,880 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;@4597e729, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:24:01,881 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-17 11:24:01,883 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:24:01,883 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-11-17 11:24:01,883 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:24:01,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:01,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 11:24:01,884 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:24:01,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:01,888 INFO L85 PathProgramCache]: Analyzing trace with hash 543871247, now seen corresponding path program 1 times [2023-11-17 11:24:01,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:01,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542479622] [2023-11-17 11:24:01,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:01,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:24:02,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:02,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542479622] [2023-11-17 11:24:02,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542479622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:02,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:02,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:24:02,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561526999] [2023-11-17 11:24:02,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:02,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:24:02,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:02,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:24:02,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:24:02,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2023-11-17 11:24:02,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:02,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:02,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2023-11-17 11:24:02,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:02,751 INFO L124 PetriNetUnfolderBase]: 1679/2470 cut-off events. [2023-11-17 11:24:02,752 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-17 11:24:02,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4989 conditions, 2470 events. 1679/2470 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12195 event pairs, 179 based on Foata normal form. 0/2197 useless extension candidates. Maximal degree in co-relation 4978. Up to 2141 conditions per place. [2023-11-17 11:24:02,768 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 35 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2023-11-17 11:24:02,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 39 transitions, 164 flow [2023-11-17 11:24:02,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:24:02,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:24:02,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2023-11-17 11:24:02,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2023-11-17 11:24:02,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 86 transitions. [2023-11-17 11:24:02,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 86 transitions. [2023-11-17 11:24:02,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:02,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 86 transitions. [2023-11-17 11:24:02,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:02,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:02,784 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:02,785 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 61 flow. Second operand 3 states and 86 transitions. [2023-11-17 11:24:02,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 39 transitions, 164 flow [2023-11-17 11:24:02,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 160 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 11:24:02,788 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 60 flow [2023-11-17 11:24:02,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2023-11-17 11:24:02,792 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2023-11-17 11:24:02,792 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 60 flow [2023-11-17 11:24:02,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:02,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:02,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:02,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:24:02,793 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:24:02,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:02,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1325771646, now seen corresponding path program 1 times [2023-11-17 11:24:02,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:02,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076068729] [2023-11-17 11:24:02,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:02,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:02,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:24:02,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:02,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076068729] [2023-11-17 11:24:02,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076068729] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:02,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:02,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:24:02,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930357296] [2023-11-17 11:24:02,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:02,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:24:02,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:02,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:24:02,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:24:02,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2023-11-17 11:24:02,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:02,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:02,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2023-11-17 11:24:02,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:03,250 INFO L124 PetriNetUnfolderBase]: 1393/2172 cut-off events. [2023-11-17 11:24:03,250 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2023-11-17 11:24:03,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4392 conditions, 2172 events. 1393/2172 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10789 event pairs, 249 based on Foata normal form. 0/2051 useless extension candidates. Maximal degree in co-relation 4382. Up to 1625 conditions per place. [2023-11-17 11:24:03,257 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 30 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-11-17 11:24:03,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 152 flow [2023-11-17 11:24:03,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:24:03,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:24:03,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2023-11-17 11:24:03,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4322916666666667 [2023-11-17 11:24:03,259 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 83 transitions. [2023-11-17 11:24:03,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 83 transitions. [2023-11-17 11:24:03,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:03,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 83 transitions. [2023-11-17 11:24:03,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:03,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:03,260 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:03,260 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 60 flow. Second operand 3 states and 83 transitions. [2023-11-17 11:24:03,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 152 flow [2023-11-17 11:24:03,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:24:03,262 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 56 flow [2023-11-17 11:24:03,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-11-17 11:24:03,262 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2023-11-17 11:24:03,263 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 56 flow [2023-11-17 11:24:03,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:03,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:03,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:03,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:24:03,263 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:24:03,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:03,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1538767658, now seen corresponding path program 1 times [2023-11-17 11:24:03,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:03,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498816643] [2023-11-17 11:24:03,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:03,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:03,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:24:03,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:03,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498816643] [2023-11-17 11:24:03,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498816643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:03,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:03,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:24:03,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629771664] [2023-11-17 11:24:03,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:03,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:24:03,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:03,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:24:03,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:24:03,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 64 [2023-11-17 11:24:03,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:03,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:03,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 64 [2023-11-17 11:24:03,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:04,054 INFO L124 PetriNetUnfolderBase]: 1545/2276 cut-off events. [2023-11-17 11:24:04,054 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2023-11-17 11:24:04,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4718 conditions, 2276 events. 1545/2276 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9340 event pairs, 521 based on Foata normal form. 60/2336 useless extension candidates. Maximal degree in co-relation 4708. Up to 1595 conditions per place. [2023-11-17 11:24:04,063 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 32 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2023-11-17 11:24:04,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 146 flow [2023-11-17 11:24:04,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:24:04,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:24:04,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2023-11-17 11:24:04,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4010416666666667 [2023-11-17 11:24:04,065 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 77 transitions. [2023-11-17 11:24:04,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 77 transitions. [2023-11-17 11:24:04,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:04,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 77 transitions. [2023-11-17 11:24:04,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:04,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:04,066 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:04,066 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 56 flow. Second operand 3 states and 77 transitions. [2023-11-17 11:24:04,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 146 flow [2023-11-17 11:24:04,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:24:04,068 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 60 flow [2023-11-17 11:24:04,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-11-17 11:24:04,068 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2023-11-17 11:24:04,068 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 60 flow [2023-11-17 11:24:04,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:04,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:04,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:04,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:24:04,069 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:24:04,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:04,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1288065738, now seen corresponding path program 1 times [2023-11-17 11:24:04,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:04,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175624553] [2023-11-17 11:24:04,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:04,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:04,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:24:04,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:04,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175624553] [2023-11-17 11:24:04,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175624553] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:04,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:04,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:24:04,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913388686] [2023-11-17 11:24:04,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:04,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:24:04,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:04,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:24:04,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:24:04,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 64 [2023-11-17 11:24:04,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:04,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:04,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 64 [2023-11-17 11:24:04,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:04,761 INFO L124 PetriNetUnfolderBase]: 1443/2134 cut-off events. [2023-11-17 11:24:04,762 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-17 11:24:04,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4605 conditions, 2134 events. 1443/2134 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 9036 event pairs, 419 based on Foata normal form. 40/2174 useless extension candidates. Maximal degree in co-relation 4594. Up to 1565 conditions per place. [2023-11-17 11:24:04,773 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 34 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2023-11-17 11:24:04,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 163 flow [2023-11-17 11:24:04,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:24:04,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:24:04,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2023-11-17 11:24:04,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4114583333333333 [2023-11-17 11:24:04,777 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 79 transitions. [2023-11-17 11:24:04,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 79 transitions. [2023-11-17 11:24:04,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:04,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 79 transitions. [2023-11-17 11:24:04,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:04,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:04,819 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:04,819 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 60 flow. Second operand 3 states and 79 transitions. [2023-11-17 11:24:04,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 163 flow [2023-11-17 11:24:04,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 157 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:24:04,821 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 64 flow [2023-11-17 11:24:04,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-11-17 11:24:04,821 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2023-11-17 11:24:04,821 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 64 flow [2023-11-17 11:24:04,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:04,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:04,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:04,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:24:04,822 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:24:04,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:04,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1192445212, now seen corresponding path program 1 times [2023-11-17 11:24:04,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:04,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100863743] [2023-11-17 11:24:04,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:04,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:05,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:24:05,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:05,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100863743] [2023-11-17 11:24:05,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100863743] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:05,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:05,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:24:05,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528279528] [2023-11-17 11:24:05,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:05,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:24:05,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:05,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:24:05,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:24:05,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 64 [2023-11-17 11:24:05,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:05,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:05,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 64 [2023-11-17 11:24:05,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:05,145 INFO L124 PetriNetUnfolderBase]: 511/852 cut-off events. [2023-11-17 11:24:05,145 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2023-11-17 11:24:05,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1944 conditions, 852 events. 511/852 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3665 event pairs, 161 based on Foata normal form. 60/908 useless extension candidates. Maximal degree in co-relation 1932. Up to 620 conditions per place. [2023-11-17 11:24:05,149 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 33 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2023-11-17 11:24:05,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 178 flow [2023-11-17 11:24:05,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:24:05,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:24:05,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2023-11-17 11:24:05,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2023-11-17 11:24:05,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 74 transitions. [2023-11-17 11:24:05,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 74 transitions. [2023-11-17 11:24:05,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:05,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 74 transitions. [2023-11-17 11:24:05,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:05,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:05,152 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:05,152 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 64 flow. Second operand 3 states and 74 transitions. [2023-11-17 11:24:05,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 178 flow [2023-11-17 11:24:05,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:24:05,153 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 86 flow [2023-11-17 11:24:05,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2023-11-17 11:24:05,154 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2023-11-17 11:24:05,154 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 86 flow [2023-11-17 11:24:05,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:05,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:05,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:05,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:24:05,154 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:24:05,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:05,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1018174165, now seen corresponding path program 1 times [2023-11-17 11:24:05,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:05,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384179775] [2023-11-17 11:24:05,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:05,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:05,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 11:24:05,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:05,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384179775] [2023-11-17 11:24:05,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384179775] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:05,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:05,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:24:05,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742783175] [2023-11-17 11:24:05,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:05,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:24:05,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:05,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:24:05,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:24:05,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 64 [2023-11-17 11:24:05,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:05,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:05,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 64 [2023-11-17 11:24:05,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:05,480 INFO L124 PetriNetUnfolderBase]: 281/507 cut-off events. [2023-11-17 11:24:05,481 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-11-17 11:24:05,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 507 events. 281/507 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2038 event pairs, 125 based on Foata normal form. 47/550 useless extension candidates. Maximal degree in co-relation 1309. Up to 219 conditions per place. [2023-11-17 11:24:05,483 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 44 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2023-11-17 11:24:05,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 53 transitions, 258 flow [2023-11-17 11:24:05,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:24:05,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:24:05,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2023-11-17 11:24:05,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2023-11-17 11:24:05,485 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 100 transitions. [2023-11-17 11:24:05,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 100 transitions. [2023-11-17 11:24:05,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:05,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 100 transitions. [2023-11-17 11:24:05,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:05,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:05,486 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:05,486 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 86 flow. Second operand 4 states and 100 transitions. [2023-11-17 11:24:05,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 53 transitions, 258 flow [2023-11-17 11:24:05,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 53 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:24:05,488 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 122 flow [2023-11-17 11:24:05,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-11-17 11:24:05,488 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2023-11-17 11:24:05,488 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 122 flow [2023-11-17 11:24:05,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:05,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:05,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:05,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:24:05,489 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:24:05,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:05,489 INFO L85 PathProgramCache]: Analyzing trace with hash 161076988, now seen corresponding path program 1 times [2023-11-17 11:24:05,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:05,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812617665] [2023-11-17 11:24:05,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:05,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:24:05,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:05,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812617665] [2023-11-17 11:24:05,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812617665] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:05,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:05,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:24:05,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138979297] [2023-11-17 11:24:05,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:05,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:24:05,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:05,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:24:05,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:24:05,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 64 [2023-11-17 11:24:05,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:05,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:05,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 64 [2023-11-17 11:24:05,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:05,942 INFO L124 PetriNetUnfolderBase]: 249/443 cut-off events. [2023-11-17 11:24:05,943 INFO L125 PetriNetUnfolderBase]: For 295/295 co-relation queries the response was YES. [2023-11-17 11:24:05,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1215 conditions, 443 events. 249/443 cut-off events. For 295/295 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1764 event pairs, 122 based on Foata normal form. 12/451 useless extension candidates. Maximal degree in co-relation 1200. Up to 219 conditions per place. [2023-11-17 11:24:05,945 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 41 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2023-11-17 11:24:05,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 282 flow [2023-11-17 11:24:05,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:24:05,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:24:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2023-11-17 11:24:05,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2023-11-17 11:24:05,948 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 112 transitions. [2023-11-17 11:24:05,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 112 transitions. [2023-11-17 11:24:05,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:05,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 112 transitions. [2023-11-17 11:24:05,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:05,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:05,950 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:05,950 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 122 flow. Second operand 5 states and 112 transitions. [2023-11-17 11:24:05,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 282 flow [2023-11-17 11:24:05,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 53 transitions, 256 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-17 11:24:05,955 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 128 flow [2023-11-17 11:24:05,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-11-17 11:24:05,958 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2023-11-17 11:24:05,958 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 128 flow [2023-11-17 11:24:05,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:05,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:05,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:05,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:24:05,962 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:24:05,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:05,963 INFO L85 PathProgramCache]: Analyzing trace with hash -338102816, now seen corresponding path program 1 times [2023-11-17 11:24:05,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:05,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114092911] [2023-11-17 11:24:05,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:05,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:24:06,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:06,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114092911] [2023-11-17 11:24:06,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114092911] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:06,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:06,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:24:06,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046848767] [2023-11-17 11:24:06,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:06,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:24:06,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:06,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:24:06,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:24:06,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 64 [2023-11-17 11:24:06,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:06,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:06,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 64 [2023-11-17 11:24:06,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:06,726 INFO L124 PetriNetUnfolderBase]: 461/789 cut-off events. [2023-11-17 11:24:06,726 INFO L125 PetriNetUnfolderBase]: For 695/695 co-relation queries the response was YES. [2023-11-17 11:24:06,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2140 conditions, 789 events. 461/789 cut-off events. For 695/695 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3256 event pairs, 56 based on Foata normal form. 1/790 useless extension candidates. Maximal degree in co-relation 2126. Up to 493 conditions per place. [2023-11-17 11:24:06,729 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 39 selfloop transitions, 4 changer transitions 35/78 dead transitions. [2023-11-17 11:24:06,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 78 transitions, 474 flow [2023-11-17 11:24:06,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:24:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:24:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2023-11-17 11:24:06,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3723958333333333 [2023-11-17 11:24:06,730 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 143 transitions. [2023-11-17 11:24:06,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 143 transitions. [2023-11-17 11:24:06,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:06,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 143 transitions. [2023-11-17 11:24:06,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:06,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 64.0) internal successors, (448), 7 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:06,732 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 64.0) internal successors, (448), 7 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:06,732 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 128 flow. Second operand 6 states and 143 transitions. [2023-11-17 11:24:06,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 78 transitions, 474 flow [2023-11-17 11:24:06,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 78 transitions, 418 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-11-17 11:24:06,736 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 132 flow [2023-11-17 11:24:06,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=132, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2023-11-17 11:24:06,736 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2023-11-17 11:24:06,737 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 132 flow [2023-11-17 11:24:06,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:06,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:06,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:06,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:24:06,737 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:24:06,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:06,738 INFO L85 PathProgramCache]: Analyzing trace with hash 472309944, now seen corresponding path program 2 times [2023-11-17 11:24:06,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:06,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65461446] [2023-11-17 11:24:06,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:06,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:08,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:24:08,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:08,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65461446] [2023-11-17 11:24:08,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65461446] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:08,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:08,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-17 11:24:08,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014712658] [2023-11-17 11:24:08,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:08,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-17 11:24:08,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:08,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-17 11:24:08,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-17 11:24:08,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 64 [2023-11-17 11:24:08,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 132 flow. Second operand has 10 states, 10 states have (on average 17.2) internal successors, (172), 10 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:08,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:08,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 64 [2023-11-17 11:24:08,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:08,564 INFO L124 PetriNetUnfolderBase]: 353/635 cut-off events. [2023-11-17 11:24:08,565 INFO L125 PetriNetUnfolderBase]: For 596/596 co-relation queries the response was YES. [2023-11-17 11:24:08,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1903 conditions, 635 events. 353/635 cut-off events. For 596/596 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2792 event pairs, 16 based on Foata normal form. 1/633 useless extension candidates. Maximal degree in co-relation 1890. Up to 202 conditions per place. [2023-11-17 11:24:08,567 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 54 selfloop transitions, 9 changer transitions 33/97 dead transitions. [2023-11-17 11:24:08,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 97 transitions, 611 flow [2023-11-17 11:24:08,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 11:24:08,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 11:24:08,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 211 transitions. [2023-11-17 11:24:08,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3663194444444444 [2023-11-17 11:24:08,569 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 211 transitions. [2023-11-17 11:24:08,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 211 transitions. [2023-11-17 11:24:08,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:08,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 211 transitions. [2023-11-17 11:24:08,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 23.444444444444443) internal successors, (211), 9 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:08,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 64.0) internal successors, (640), 10 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:08,571 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 64.0) internal successors, (640), 10 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:08,571 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 132 flow. Second operand 9 states and 211 transitions. [2023-11-17 11:24:08,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 97 transitions, 611 flow [2023-11-17 11:24:08,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 97 transitions, 609 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-17 11:24:08,575 INFO L231 Difference]: Finished difference. Result has 55 places, 35 transitions, 187 flow [2023-11-17 11:24:08,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=187, PETRI_PLACES=55, PETRI_TRANSITIONS=35} [2023-11-17 11:24:08,575 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2023-11-17 11:24:08,575 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 35 transitions, 187 flow [2023-11-17 11:24:08,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.2) internal successors, (172), 10 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:08,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:08,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:08,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:24:08,576 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:24:08,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:08,576 INFO L85 PathProgramCache]: Analyzing trace with hash 228827976, now seen corresponding path program 3 times [2023-11-17 11:24:08,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:08,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844216440] [2023-11-17 11:24:08,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:08,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:09,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:24:09,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:09,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844216440] [2023-11-17 11:24:09,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844216440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:09,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:09,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:24:09,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93926441] [2023-11-17 11:24:09,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:09,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:24:09,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:09,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:24:09,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:24:09,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 64 [2023-11-17 11:24:09,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 35 transitions, 187 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:09,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:09,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 64 [2023-11-17 11:24:09,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:09,710 INFO L124 PetriNetUnfolderBase]: 290/542 cut-off events. [2023-11-17 11:24:09,710 INFO L125 PetriNetUnfolderBase]: For 1053/1054 co-relation queries the response was YES. [2023-11-17 11:24:09,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1967 conditions, 542 events. 290/542 cut-off events. For 1053/1054 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2355 event pairs, 82 based on Foata normal form. 2/532 useless extension candidates. Maximal degree in co-relation 1949. Up to 152 conditions per place. [2023-11-17 11:24:09,712 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 37 selfloop transitions, 6 changer transitions 34/80 dead transitions. [2023-11-17 11:24:09,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 80 transitions, 595 flow [2023-11-17 11:24:09,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 11:24:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 11:24:09,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2023-11-17 11:24:09,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35546875 [2023-11-17 11:24:09,714 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 182 transitions. [2023-11-17 11:24:09,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 182 transitions. [2023-11-17 11:24:09,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:09,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 182 transitions. [2023-11-17 11:24:09,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 22.75) internal successors, (182), 8 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:09,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 64.0) internal successors, (576), 9 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:09,715 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 64.0) internal successors, (576), 9 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:09,715 INFO L175 Difference]: Start difference. First operand has 55 places, 35 transitions, 187 flow. Second operand 8 states and 182 transitions. [2023-11-17 11:24:09,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 80 transitions, 595 flow [2023-11-17 11:24:09,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 80 transitions, 549 flow, removed 13 selfloop flow, removed 5 redundant places. [2023-11-17 11:24:09,719 INFO L231 Difference]: Finished difference. Result has 57 places, 34 transitions, 180 flow [2023-11-17 11:24:09,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=180, PETRI_PLACES=57, PETRI_TRANSITIONS=34} [2023-11-17 11:24:09,721 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2023-11-17 11:24:09,721 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 34 transitions, 180 flow [2023-11-17 11:24:09,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:09,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:09,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:09,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 11:24:09,723 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:24:09,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:09,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1052676570, now seen corresponding path program 4 times [2023-11-17 11:24:09,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:09,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046075950] [2023-11-17 11:24:09,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:09,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:24:09,794 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:24:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:24:09,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:24:09,895 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:24:09,895 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2023-11-17 11:24:09,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2023-11-17 11:24:09,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2023-11-17 11:24:09,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2023-11-17 11:24:09,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2023-11-17 11:24:09,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2023-11-17 11:24:09,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2023-11-17 11:24:09,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2023-11-17 11:24:09,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 11:24:09,898 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:09,902 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:24:09,902 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:24:09,948 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 11:24:09,950 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-17 11:24:09,951 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated [2023-11-17 11:24:09,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:24:09 BasicIcfg [2023-11-17 11:24:09,968 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:24:09,968 INFO L158 Benchmark]: Toolchain (without parser) took 11317.02ms. Allocated memory was 314.6MB in the beginning and 681.6MB in the end (delta: 367.0MB). Free memory was 260.7MB in the beginning and 629.4MB in the end (delta: -368.8MB). Peak memory consumption was 391.8MB. Max. memory is 8.0GB. [2023-11-17 11:24:09,969 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 196.1MB. Free memory was 146.3MB in the beginning and 146.1MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:24:09,969 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.11ms. Allocated memory is still 314.6MB. Free memory was 260.3MB in the beginning and 232.2MB in the end (delta: 28.1MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2023-11-17 11:24:09,969 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.59ms. Allocated memory is still 314.6MB. Free memory was 232.2MB in the beginning and 228.1MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-11-17 11:24:09,969 INFO L158 Benchmark]: Boogie Preprocessor took 36.31ms. Allocated memory is still 314.6MB. Free memory was 228.1MB in the beginning and 225.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:24:09,969 INFO L158 Benchmark]: RCFGBuilder took 709.33ms. Allocated memory is still 314.6MB. Free memory was 225.4MB in the beginning and 203.1MB in the end (delta: 22.3MB). Peak memory consumption was 23.9MB. Max. memory is 8.0GB. [2023-11-17 11:24:09,970 INFO L158 Benchmark]: TraceAbstraction took 10005.52ms. Allocated memory was 314.6MB in the beginning and 681.6MB in the end (delta: 367.0MB). Free memory was 202.0MB in the beginning and 629.4MB in the end (delta: -427.4MB). Peak memory consumption was 332.3MB. Max. memory is 8.0GB. [2023-11-17 11:24:09,971 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.12ms. Allocated memory is still 196.1MB. Free memory was 146.3MB in the beginning and 146.1MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 511.11ms. Allocated memory is still 314.6MB. Free memory was 260.3MB in the beginning and 232.2MB in the end (delta: 28.1MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.59ms. Allocated memory is still 314.6MB. Free memory was 232.2MB in the beginning and 228.1MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.31ms. Allocated memory is still 314.6MB. Free memory was 228.1MB in the beginning and 225.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 709.33ms. Allocated memory is still 314.6MB. Free memory was 225.4MB in the beginning and 203.1MB in the end (delta: 22.3MB). Peak memory consumption was 23.9MB. Max. memory is 8.0GB. * TraceAbstraction took 10005.52ms. Allocated memory was 314.6MB in the beginning and 681.6MB in the end (delta: 367.0MB). Free memory was 202.0MB in the beginning and 629.4MB in the end (delta: -427.4MB). Peak memory consumption was 332.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 48 PlacesBefore, 36 PlacesAfterwards, 40 TransitionsBefore, 26 TransitionsAfterwards, 938 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 2 ChoiceCompositions, 21 TotalNumberOfCompositions, 2485 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1073, independent: 975, independent conditional: 0, independent unconditional: 975, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 588, independent: 529, independent conditional: 0, independent unconditional: 529, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 588, independent: 525, independent conditional: 0, independent unconditional: 525, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 63, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 651, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 644, dependent conditional: 0, dependent unconditional: 644, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1073, independent: 446, independent conditional: 0, independent unconditional: 446, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 588, unknown conditional: 0, unknown unconditional: 588] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 108, Positive conditional cache size: 0, Positive unconditional cache size: 108, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$read_delayed; [L733] 0 int *x$read_delayed_var; [L734] 0 int x$w_buff0; [L735] 0 _Bool x$w_buff0_used; [L736] 0 int x$w_buff1; [L737] 0 _Bool x$w_buff1_used; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff1_thd0; [L747] 0 _Bool y$r_buff1_thd1; [L748] 0 _Bool y$r_buff1_thd2; [L749] 0 _Bool y$r_buff1_thd3; [L750] 0 _Bool y$read_delayed; [L751] 0 int *y$read_delayed_var; [L752] 0 int y$w_buff0; [L753] 0 _Bool y$w_buff0_used; [L754] 0 int y$w_buff1; [L755] 0 _Bool y$w_buff1_used; [L757] 0 int z = 0; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice2; [L899] 0 pthread_t t171; [L900] FCALL, FORK 0 pthread_create(&t171, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t171={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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L901] 0 pthread_t t172; [L902] FCALL, FORK 0 pthread_create(&t172, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t171={5:0}, t172={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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L903] 0 pthread_t t173; [L783] 2 x$w_buff1 = x$w_buff0 [L784] 2 x$w_buff0 = 2 [L785] 2 x$w_buff1_used = x$w_buff0_used [L786] 2 x$w_buff0_used = (_Bool)1 [L787] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L787] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L788] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L789] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L790] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L791] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L792] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L904] FCALL, FORK 0 pthread_create(&t173, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t171={5:0}, t172={6:0}, t173={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L795] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 2 x$flush_delayed = weak$$choice2 [L798] 2 x$mem_tmp = x [L799] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L800] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L801] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L802] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L803] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L804] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L805] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L806] 2 __unbuffered_p1_EAX = x [L807] 2 x = x$flush_delayed ? x$mem_tmp : x [L808] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L811] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 2 y$flush_delayed = weak$$choice2 [L814] 2 y$mem_tmp = y [L815] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L816] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L817] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L818] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L819] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L820] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L821] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L822] 2 __unbuffered_p1_EBX = y [L823] 2 y = y$flush_delayed ? y$mem_tmp : y [L824] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L841] 3 y$w_buff1 = y$w_buff0 [L842] 3 y$w_buff0 = 1 [L843] 3 y$w_buff1_used = y$w_buff0_used [L844] 3 y$w_buff0_used = (_Bool)1 [L845] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L845] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L846] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L847] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L848] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L849] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L850] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L853] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 3 y$flush_delayed = weak$$choice2 [L856] 3 y$mem_tmp = y [L857] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L858] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L859] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L860] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L861] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L862] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L863] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L864] 3 __unbuffered_p2_EAX = y [L865] 3 y = y$flush_delayed ? y$mem_tmp : y [L866] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=0] [L869] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=0] [L763] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L766] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L769] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L770] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L771] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L772] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L773] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L827] 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) [L828] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L829] 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 [L830] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L831] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L872] 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) [L873] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L874] 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 [L875] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L876] 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 [L877] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L878] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L879] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L880] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L881] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L884] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L886] 3 return 0; [L776] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 1 return 0; [L834] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 2 return 0; [L906] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L908] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L908] RET 0 assume_abort_if_not(main$tmp_guard0) [L910] 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) [L911] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L912] 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 [L913] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L914] 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 [L915] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L916] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L917] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L918] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L919] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t171={5:0}, t172={6:0}, t173={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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L922] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L923] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L924] 0 x$flush_delayed = weak$$choice2 [L925] 0 x$mem_tmp = x [L926] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L927] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L928] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L929] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L930] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L931] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L932] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L933] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L934] 0 x = x$flush_delayed ? x$mem_tmp : x [L935] 0 x$flush_delayed = (_Bool)0 [L937] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 902]: 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: 904]: 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: 900]: 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, 70 locations, 8 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: 9.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 298 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 298 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 763 IncrementalHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 9 mSDtfsCounter, 763 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=9, InterpolantAutomatonStates: 47, 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.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 1671 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 11:24:09,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...