/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-wmm/mix015.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:41:14,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:41:14,334 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 21:41:14,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:41:14,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:41:14,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:41:14,355 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:41:14,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:41:14,355 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:41:14,355 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:41:14,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:41:14,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:41:14,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:41:14,356 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:41:14,356 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:41:14,356 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:41:14,356 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:41:14,356 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:41:14,356 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:41:14,356 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:41:14,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:41:14,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:41:14,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:41:14,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:41:14,356 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:41:14,357 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:41:14,357 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:41:14,357 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:41:14,357 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:41:14,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:41:14,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:41:14,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:41:14,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:41:14,357 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:41:14,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:41:14,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:41:14,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:41:14,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:41:14,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:41:14,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:41:14,357 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:41:14,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:41:14,358 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:41:14,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:41:14,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:41:14,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:41:14,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:41:14,358 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 21:41:14,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:41:14,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:41:14,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:41:14,613 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:41:14,613 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:41:14,614 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015.oepc.i [2025-04-13 21:41:15,968 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b09ca8e5/a84f888ca8724390a179799dabb417ee/FLAGae43efaf5 [2025-04-13 21:41:16,204 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:41:16,205 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015.oepc.i [2025-04-13 21:41:16,218 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b09ca8e5/a84f888ca8724390a179799dabb417ee/FLAGae43efaf5 [2025-04-13 21:41:16,969 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b09ca8e5/a84f888ca8724390a179799dabb417ee [2025-04-13 21:41:16,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:41:16,972 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:41:16,974 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:41:16,974 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:41:16,977 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:41:16,978 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:41:16" (1/1) ... [2025-04-13 21:41:16,978 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c842a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:16, skipping insertion in model container [2025-04-13 21:41:16,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:41:16" (1/1) ... [2025-04-13 21:41:17,001 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:41:17,184 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015.oepc.i[945,958] [2025-04-13 21:41:17,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:41:17,363 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:41:17,388 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015.oepc.i[945,958] [2025-04-13 21:41:17,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:41:17,481 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:41:17,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:17 WrapperNode [2025-04-13 21:41:17,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:41:17,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:41:17,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:41:17,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:41:17,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:17" (1/1) ... [2025-04-13 21:41:17,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:17" (1/1) ... [2025-04-13 21:41:17,539 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 125 [2025-04-13 21:41:17,539 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:41:17,540 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:41:17,540 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:41:17,540 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:41:17,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:17" (1/1) ... [2025-04-13 21:41:17,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:17" (1/1) ... [2025-04-13 21:41:17,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:17" (1/1) ... [2025-04-13 21:41:17,565 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 21:41:17,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:17" (1/1) ... [2025-04-13 21:41:17,566 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:17" (1/1) ... [2025-04-13 21:41:17,574 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:17" (1/1) ... [2025-04-13 21:41:17,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:17" (1/1) ... [2025-04-13 21:41:17,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:17" (1/1) ... [2025-04-13 21:41:17,577 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:17" (1/1) ... [2025-04-13 21:41:17,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:41:17,584 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:41:17,584 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:41:17,584 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:41:17,585 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:17" (1/1) ... [2025-04-13 21:41:17,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:41:17,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:41:17,620 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 21:41:17,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 21:41:17,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 21:41:17,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:41:17,642 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 21:41:17,642 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 21:41:17,643 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 21:41:17,643 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 21:41:17,643 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 21:41:17,643 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 21:41:17,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:41:17,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 21:41:17,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:41:17,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:41:17,645 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:41:17,766 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:41:17,767 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:41:18,062 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:41:18,063 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:41:18,063 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:41:18,334 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:41:18,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:41:18 BoogieIcfgContainer [2025-04-13 21:41:18,335 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:41:18,337 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:41:18,337 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:41:18,341 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:41:18,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:41:16" (1/3) ... [2025-04-13 21:41:18,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40607066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:41:18, skipping insertion in model container [2025-04-13 21:41:18,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:17" (2/3) ... [2025-04-13 21:41:18,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40607066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:41:18, skipping insertion in model container [2025-04-13 21:41:18,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:41:18" (3/3) ... [2025-04-13 21:41:18,343 INFO L128 eAbstractionObserver]: Analyzing ICFG mix015.oepc.i [2025-04-13 21:41:18,354 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:41:18,356 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix015.oepc.i that has 4 procedures, 39 locations, 35 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-13 21:41:18,356 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:41:18,404 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:41:18,427 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 38 transitions, 88 flow [2025-04-13 21:41:18,643 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4250 states, 4247 states have (on average 3.4553802684247703) internal successors, (14675), 4249 states have internal predecessors, (14675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:18,666 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:41:18,675 INFO L340 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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;@4edca0af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:41:18,676 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 21:41:18,689 INFO L278 IsEmpty]: Start isEmpty. Operand has 4250 states, 4247 states have (on average 3.4553802684247703) internal successors, (14675), 4249 states have internal predecessors, (14675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:18,692 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-13 21:41:18,692 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:41:18,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-13 21:41:18,693 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:41:18,698 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:41:18,699 INFO L85 PathProgramCache]: Analyzing trace with hash 11555117, now seen corresponding path program 1 times [2025-04-13 21:41:18,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:41:18,704 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789984749] [2025-04-13 21:41:18,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:41:18,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:41:18,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 21:41:18,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 21:41:18,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:41:18,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:41:19,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:41:19,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:41:19,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789984749] [2025-04-13 21:41:19,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789984749] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:41:19,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:41:19,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:41:19,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354959578] [2025-04-13 21:41:19,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:41:19,085 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:41:19,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:41:19,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:41:19,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:41:19,113 INFO L87 Difference]: Start difference. First operand has 4250 states, 4247 states have (on average 3.4553802684247703) internal successors, (14675), 4249 states have internal predecessors, (14675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:19,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:41:19,309 INFO L93 Difference]: Finished difference Result 4250 states and 14675 transitions. [2025-04-13 21:41:19,310 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:41:19,311 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-04-13 21:41:19,311 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:41:19,348 INFO L225 Difference]: With dead ends: 4250 [2025-04-13 21:41:19,349 INFO L226 Difference]: Without dead ends: 3674 [2025-04-13 21:41:19,358 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:41:19,361 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 20 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:41:19,362 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 5 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:41:19,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2025-04-13 21:41:19,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3674. [2025-04-13 21:41:19,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3674 states, 3673 states have (on average 3.4448679553498502) internal successors, (12653), 3673 states have internal predecessors, (12653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3674 states to 3674 states and 12653 transitions. [2025-04-13 21:41:19,617 INFO L79 Accepts]: Start accepts. Automaton has 3674 states and 12653 transitions. Word has length 4 [2025-04-13 21:41:19,617 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:41:19,618 INFO L485 AbstractCegarLoop]: Abstraction has 3674 states and 12653 transitions. [2025-04-13 21:41:19,618 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:19,619 INFO L278 IsEmpty]: Start isEmpty. Operand 3674 states and 12653 transitions. [2025-04-13 21:41:19,621 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 21:41:19,621 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:41:19,621 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:41:19,622 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:41:19,622 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:41:19,623 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:41:19,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1962285935, now seen corresponding path program 1 times [2025-04-13 21:41:19,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:41:19,623 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897663399] [2025-04-13 21:41:19,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:41:19,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:41:19,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 21:41:19,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 21:41:19,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:41:19,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:41:19,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:41:19,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:41:19,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897663399] [2025-04-13 21:41:19,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897663399] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:41:19,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:41:19,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:41:19,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887310393] [2025-04-13 21:41:19,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:41:19,858 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:41:19,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:41:19,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:41:19,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:41:19,858 INFO L87 Difference]: Start difference. First operand 3674 states and 12653 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:20,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:41:20,050 INFO L93 Difference]: Finished difference Result 5144 states and 17284 transitions. [2025-04-13 21:41:20,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:41:20,051 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-13 21:41:20,051 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:41:20,071 INFO L225 Difference]: With dead ends: 5144 [2025-04-13 21:41:20,072 INFO L226 Difference]: Without dead ends: 2624 [2025-04-13 21:41:20,077 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:41:20,079 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 66 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:41:20,079 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 9 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:41:20,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2025-04-13 21:41:20,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2624. [2025-04-13 21:41:20,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2624 states, 2623 states have (on average 3.222645825390774) internal successors, (8453), 2623 states have internal predecessors, (8453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:20,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 8453 transitions. [2025-04-13 21:41:20,196 INFO L79 Accepts]: Start accepts. Automaton has 2624 states and 8453 transitions. Word has length 12 [2025-04-13 21:41:20,197 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:41:20,197 INFO L485 AbstractCegarLoop]: Abstraction has 2624 states and 8453 transitions. [2025-04-13 21:41:20,198 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:20,198 INFO L278 IsEmpty]: Start isEmpty. Operand 2624 states and 8453 transitions. [2025-04-13 21:41:20,204 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 21:41:20,204 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:41:20,205 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:41:20,205 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:41:20,205 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:41:20,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:41:20,205 INFO L85 PathProgramCache]: Analyzing trace with hash -112851452, now seen corresponding path program 1 times [2025-04-13 21:41:20,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:41:20,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107194165] [2025-04-13 21:41:20,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:41:20,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:41:20,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 21:41:20,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:41:20,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:41:20,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:41:20,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:41:20,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:41:20,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107194165] [2025-04-13 21:41:20,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107194165] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:41:20,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:41:20,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:41:20,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369145902] [2025-04-13 21:41:20,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:41:20,433 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:41:20,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:41:20,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:41:20,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:41:20,434 INFO L87 Difference]: Start difference. First operand 2624 states and 8453 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:20,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:41:20,632 INFO L93 Difference]: Finished difference Result 3024 states and 9553 transitions. [2025-04-13 21:41:20,632 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:41:20,632 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 21:41:20,632 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:41:20,647 INFO L225 Difference]: With dead ends: 3024 [2025-04-13 21:41:20,647 INFO L226 Difference]: Without dead ends: 1554 [2025-04-13 21:41:20,651 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:41:20,652 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 120 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:41:20,652 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 12 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:41:20,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2025-04-13 21:41:20,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1554. [2025-04-13 21:41:20,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1553 states have (on average 3.0315518351577593) internal successors, (4708), 1553 states have internal predecessors, (4708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 4708 transitions. [2025-04-13 21:41:20,701 INFO L79 Accepts]: Start accepts. Automaton has 1554 states and 4708 transitions. Word has length 17 [2025-04-13 21:41:20,701 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:41:20,702 INFO L485 AbstractCegarLoop]: Abstraction has 1554 states and 4708 transitions. [2025-04-13 21:41:20,702 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:20,702 INFO L278 IsEmpty]: Start isEmpty. Operand 1554 states and 4708 transitions. [2025-04-13 21:41:20,705 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 21:41:20,705 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:41:20,705 INFO L218 NwaCegarLoop]: 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] [2025-04-13 21:41:20,705 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:41:20,705 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:41:20,706 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:41:20,706 INFO L85 PathProgramCache]: Analyzing trace with hash 655890177, now seen corresponding path program 1 times [2025-04-13 21:41:20,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:41:20,706 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258842963] [2025-04-13 21:41:20,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:41:20,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:41:20,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 21:41:20,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 21:41:20,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:41:20,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:41:21,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:41:21,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:41:21,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258842963] [2025-04-13 21:41:21,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258842963] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:41:21,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:41:21,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:41:21,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458542704] [2025-04-13 21:41:21,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:41:21,055 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:41:21,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:41:21,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:41:21,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:41:21,056 INFO L87 Difference]: Start difference. First operand 1554 states and 4708 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:21,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:41:21,220 INFO L93 Difference]: Finished difference Result 1594 states and 4800 transitions. [2025-04-13 21:41:21,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:41:21,220 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 21:41:21,220 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:41:21,231 INFO L225 Difference]: With dead ends: 1594 [2025-04-13 21:41:21,232 INFO L226 Difference]: Without dead ends: 1194 [2025-04-13 21:41:21,233 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-13 21:41:21,234 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 135 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:41:21,234 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 9 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:41:21,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2025-04-13 21:41:21,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1194. [2025-04-13 21:41:21,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 1193 states have (on average 3.041072925398156) internal successors, (3628), 1193 states have internal predecessors, (3628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:21,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 3628 transitions. [2025-04-13 21:41:21,286 INFO L79 Accepts]: Start accepts. Automaton has 1194 states and 3628 transitions. Word has length 23 [2025-04-13 21:41:21,287 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:41:21,287 INFO L485 AbstractCegarLoop]: Abstraction has 1194 states and 3628 transitions. [2025-04-13 21:41:21,287 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:21,287 INFO L278 IsEmpty]: Start isEmpty. Operand 1194 states and 3628 transitions. [2025-04-13 21:41:21,290 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 21:41:21,290 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:41:21,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:41:21,290 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:41:21,290 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:41:21,291 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:41:21,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1884690282, now seen corresponding path program 1 times [2025-04-13 21:41:21,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:41:21,291 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768102535] [2025-04-13 21:41:21,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:41:21,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:41:21,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 21:41:21,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 21:41:21,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:41:21,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:41:22,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:41:22,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:41:22,147 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768102535] [2025-04-13 21:41:22,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768102535] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:41:22,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:41:22,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 21:41:22,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426386428] [2025-04-13 21:41:22,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:41:22,148 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 21:41:22,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:41:22,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 21:41:22,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:41:22,148 INFO L87 Difference]: Start difference. First operand 1194 states and 3628 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:22,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:41:22,440 INFO L93 Difference]: Finished difference Result 1918 states and 5701 transitions. [2025-04-13 21:41:22,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 21:41:22,440 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 21:41:22,440 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:41:22,450 INFO L225 Difference]: With dead ends: 1918 [2025-04-13 21:41:22,450 INFO L226 Difference]: Without dead ends: 1602 [2025-04-13 21:41:22,451 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:41:22,452 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 92 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:41:22,452 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 35 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:41:22,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2025-04-13 21:41:22,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1194. [2025-04-13 21:41:22,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 1193 states have (on average 2.9958088851634534) internal successors, (3574), 1193 states have internal predecessors, (3574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:22,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 3574 transitions. [2025-04-13 21:41:22,486 INFO L79 Accepts]: Start accepts. Automaton has 1194 states and 3574 transitions. Word has length 30 [2025-04-13 21:41:22,486 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:41:22,486 INFO L485 AbstractCegarLoop]: Abstraction has 1194 states and 3574 transitions. [2025-04-13 21:41:22,486 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:22,486 INFO L278 IsEmpty]: Start isEmpty. Operand 1194 states and 3574 transitions. [2025-04-13 21:41:22,489 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 21:41:22,489 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:41:22,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:41:22,489 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:41:22,489 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:41:22,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:41:22,490 INFO L85 PathProgramCache]: Analyzing trace with hash -214137780, now seen corresponding path program 2 times [2025-04-13 21:41:22,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:41:22,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405894134] [2025-04-13 21:41:22,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:41:22,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:41:22,499 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-04-13 21:41:22,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 21:41:22,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:41:22,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:41:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:41:22,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:41:22,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405894134] [2025-04-13 21:41:22,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405894134] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:41:22,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:41:22,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:41:22,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059865488] [2025-04-13 21:41:22,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:41:22,797 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:41:22,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:41:22,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:41:22,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:41:22,797 INFO L87 Difference]: Start difference. First operand 1194 states and 3574 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:22,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:41:22,981 INFO L93 Difference]: Finished difference Result 1594 states and 4670 transitions. [2025-04-13 21:41:22,981 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:41:22,982 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 21:41:22,982 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:41:22,990 INFO L225 Difference]: With dead ends: 1594 [2025-04-13 21:41:22,990 INFO L226 Difference]: Without dead ends: 1266 [2025-04-13 21:41:22,992 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:41:22,993 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 44 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:41:22,993 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 16 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:41:22,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2025-04-13 21:41:23,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1034. [2025-04-13 21:41:23,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 2.9177153920619556) internal successors, (3014), 1033 states have internal predecessors, (3014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:23,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 3014 transitions. [2025-04-13 21:41:23,018 INFO L79 Accepts]: Start accepts. Automaton has 1034 states and 3014 transitions. Word has length 30 [2025-04-13 21:41:23,018 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:41:23,018 INFO L485 AbstractCegarLoop]: Abstraction has 1034 states and 3014 transitions. [2025-04-13 21:41:23,018 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:23,019 INFO L278 IsEmpty]: Start isEmpty. Operand 1034 states and 3014 transitions. [2025-04-13 21:41:23,021 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 21:41:23,021 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:41:23,021 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:41:23,021 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:41:23,021 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:41:23,021 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:41:23,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1869922040, now seen corresponding path program 3 times [2025-04-13 21:41:23,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:41:23,021 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217536818] [2025-04-13 21:41:23,021 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:41:23,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:41:23,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-04-13 21:41:23,096 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 21:41:23,096 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:41:23,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:41:23,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:41:23,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:41:23,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217536818] [2025-04-13 21:41:23,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217536818] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:41:23,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:41:23,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:41:23,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861344894] [2025-04-13 21:41:23,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:41:23,345 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:41:23,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:41:23,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:41:23,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:41:23,346 INFO L87 Difference]: Start difference. First operand 1034 states and 3014 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:23,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:41:23,573 INFO L93 Difference]: Finished difference Result 1434 states and 4110 transitions. [2025-04-13 21:41:23,573 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 21:41:23,574 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 21:41:23,574 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:41:23,579 INFO L225 Difference]: With dead ends: 1434 [2025-04-13 21:41:23,580 INFO L226 Difference]: Without dead ends: 744 [2025-04-13 21:41:23,581 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:41:23,582 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 69 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:41:23,582 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 30 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:41:23,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2025-04-13 21:41:23,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2025-04-13 21:41:23,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 743 states have (on average 2.791386271870794) internal successors, (2074), 743 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 2074 transitions. [2025-04-13 21:41:23,597 INFO L79 Accepts]: Start accepts. Automaton has 744 states and 2074 transitions. Word has length 30 [2025-04-13 21:41:23,598 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:41:23,598 INFO L485 AbstractCegarLoop]: Abstraction has 744 states and 2074 transitions. [2025-04-13 21:41:23,598 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:23,598 INFO L278 IsEmpty]: Start isEmpty. Operand 744 states and 2074 transitions. [2025-04-13 21:41:23,601 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 21:41:23,601 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:41:23,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:41:23,601 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 21:41:23,601 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:41:23,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:41:23,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1424686968, now seen corresponding path program 4 times [2025-04-13 21:41:23,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:41:23,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513372112] [2025-04-13 21:41:23,601 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:41:23,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:41:23,611 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 21:41:23,646 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 21:41:23,646 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:41:23,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:41:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:41:23,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:41:23,790 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513372112] [2025-04-13 21:41:23,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513372112] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:41:23,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:41:23,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:41:23,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539418412] [2025-04-13 21:41:23,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:41:23,791 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:41:23,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:41:23,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:41:23,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:41:23,791 INFO L87 Difference]: Start difference. First operand 744 states and 2074 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:23,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:41:23,923 INFO L93 Difference]: Finished difference Result 976 states and 2700 transitions. [2025-04-13 21:41:23,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:41:23,923 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 21:41:23,924 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:41:23,928 INFO L225 Difference]: With dead ends: 976 [2025-04-13 21:41:23,928 INFO L226 Difference]: Without dead ends: 480 [2025-04-13 21:41:23,929 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:41:23,929 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 38 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:41:23,929 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 18 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:41:23,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-04-13 21:41:23,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-04-13 21:41:23,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 2.638830897703549) internal successors, (1264), 479 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:23,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 1264 transitions. [2025-04-13 21:41:23,945 INFO L79 Accepts]: Start accepts. Automaton has 480 states and 1264 transitions. Word has length 30 [2025-04-13 21:41:23,945 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:41:23,945 INFO L485 AbstractCegarLoop]: Abstraction has 480 states and 1264 transitions. [2025-04-13 21:41:23,945 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:23,945 INFO L278 IsEmpty]: Start isEmpty. Operand 480 states and 1264 transitions. [2025-04-13 21:41:23,946 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 21:41:23,946 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:41:23,946 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:41:23,946 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 21:41:23,946 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:41:23,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:41:23,947 INFO L85 PathProgramCache]: Analyzing trace with hash 676786606, now seen corresponding path program 5 times [2025-04-13 21:41:23,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:41:23,947 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251159082] [2025-04-13 21:41:23,947 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:41:23,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:41:23,955 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-04-13 21:41:23,998 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 21:41:23,999 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:41:23,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:41:25,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:41:25,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:41:25,002 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251159082] [2025-04-13 21:41:25,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251159082] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:41:25,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:41:25,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 21:41:25,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655236619] [2025-04-13 21:41:25,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:41:25,002 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 21:41:25,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:41:25,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 21:41:25,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:41:25,003 INFO L87 Difference]: Start difference. First operand 480 states and 1264 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:41:25,258 INFO L93 Difference]: Finished difference Result 704 states and 1836 transitions. [2025-04-13 21:41:25,258 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:41:25,258 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 21:41:25,258 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:41:25,262 INFO L225 Difference]: With dead ends: 704 [2025-04-13 21:41:25,262 INFO L226 Difference]: Without dead ends: 412 [2025-04-13 21:41:25,263 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:41:25,263 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 62 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:41:25,263 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 35 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:41:25,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-04-13 21:41:25,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 300. [2025-04-13 21:41:25,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 2.5016722408026757) internal successors, (748), 299 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:25,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 748 transitions. [2025-04-13 21:41:25,271 INFO L79 Accepts]: Start accepts. Automaton has 300 states and 748 transitions. Word has length 30 [2025-04-13 21:41:25,271 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:41:25,271 INFO L485 AbstractCegarLoop]: Abstraction has 300 states and 748 transitions. [2025-04-13 21:41:25,271 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:41:25,271 INFO L278 IsEmpty]: Start isEmpty. Operand 300 states and 748 transitions. [2025-04-13 21:41:25,272 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 21:41:25,272 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:41:25,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:41:25,272 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 21:41:25,272 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:41:25,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:41:25,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1469411822, now seen corresponding path program 6 times [2025-04-13 21:41:25,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:41:25,273 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939426072] [2025-04-13 21:41:25,273 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:41:25,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:41:25,280 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 1 equivalence classes. [2025-04-13 21:41:25,319 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 21:41:25,320 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:41:25,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:41:25,320 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:41:25,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 21:41:25,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 21:41:25,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:41:25,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:41:25,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:41:25,397 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:41:25,397 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 21:41:25,399 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 21:41:25,399 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-13 21:41:25,399 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-04-13 21:41:25,399 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-04-13 21:41:25,399 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 21:41:25,399 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 21:41:25,401 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1] [2025-04-13 21:41:25,505 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:41:25,505 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:41:25,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:41:25 BasicIcfg [2025-04-13 21:41:25,512 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:41:25,514 INFO L158 Benchmark]: Toolchain (without parser) took 8540.48ms. Allocated memory was 155.2MB in the beginning and 469.8MB in the end (delta: 314.6MB). Free memory was 108.2MB in the beginning and 278.3MB in the end (delta: -170.0MB). Peak memory consumption was 146.1MB. Max. memory is 8.0GB. [2025-04-13 21:41:25,514 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 95.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:41:25,514 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.10ms. Allocated memory is still 155.2MB. Free memory was 108.2MB in the beginning and 81.7MB in the end (delta: 26.6MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-13 21:41:25,514 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.42ms. Allocated memory is still 155.2MB. Free memory was 81.7MB in the beginning and 79.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:41:25,514 INFO L158 Benchmark]: Boogie Preprocessor took 44.08ms. Allocated memory is still 155.2MB. Free memory was 79.2MB in the beginning and 75.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:41:25,515 INFO L158 Benchmark]: IcfgBuilder took 751.13ms. Allocated memory is still 155.2MB. Free memory was 75.8MB in the beginning and 82.0MB in the end (delta: -6.2MB). Peak memory consumption was 57.6MB. Max. memory is 8.0GB. [2025-04-13 21:41:25,515 INFO L158 Benchmark]: TraceAbstraction took 7175.48ms. Allocated memory was 155.2MB in the beginning and 469.8MB in the end (delta: 314.6MB). Free memory was 82.0MB in the beginning and 278.3MB in the end (delta: -196.3MB). Peak memory consumption was 117.9MB. Max. memory is 8.0GB. [2025-04-13 21:41:25,517 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 95.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 508.10ms. Allocated memory is still 155.2MB. Free memory was 108.2MB in the beginning and 81.7MB in the end (delta: 26.6MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.42ms. Allocated memory is still 155.2MB. Free memory was 81.7MB in the beginning and 79.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 44.08ms. Allocated memory is still 155.2MB. Free memory was 79.2MB in the beginning and 75.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 751.13ms. Allocated memory is still 155.2MB. Free memory was 75.8MB in the beginning and 82.0MB in the end (delta: -6.2MB). Peak memory consumption was 57.6MB. Max. memory is 8.0GB. * TraceAbstraction took 7175.48ms. Allocated memory was 155.2MB in the beginning and 469.8MB in the end (delta: 314.6MB). Free memory was 82.0MB in the beginning and 278.3MB in the end (delta: -196.3MB). Peak memory consumption was 117.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 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_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t385; [L851] FCALL, FORK 0 pthread_create(&t385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t385=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t386; [L853] FCALL, FORK 0 pthread_create(&t386, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t385=-2, t386=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 1 __unbuffered_p0_EAX = x VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L854] 0 pthread_t t387; [L855] FCALL, FORK 0 pthread_create(&t387, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t385=-2, t386=-1, t387=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L769] 1 __unbuffered_p0_EBX = y VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L786] 2 y = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L789] 2 __unbuffered_p1_EAX = z VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L806] 3 z = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L809] 3 __unbuffered_p2_EAX = z VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EBX = a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L828] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t385=-2, t386=-1, t387=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t385=-2, t386=-1, t387=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t385=-2, t386=-1, t387=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, 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: 855]: 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: 851]: 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: 853]: 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, 67 locations, 63 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 646 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 646 mSDsluCounter, 169 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1636 IncrementalHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 43 mSDtfsCounter, 1636 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4250occurred in iteration=0, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 752 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 197 ConstructedInterpolants, 0 QuantifiedInterpolants, 1326 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 21:41:25,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...