/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/pthread-theta/unwind2-1.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:01:46,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:01:46,079 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 19:01:46,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:01:46,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:01:46,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:01:46,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:01:46,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:01:46,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:01:46,105 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:01:46,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:01:46,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:01:46,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:01:46,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:01:46,107 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:01:46,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:01:46,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:01:46,107 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:01:46,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:01:46,108 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:01:46,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:01:46,108 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:01:46,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:01:46,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:01:46,108 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:01:46,108 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:01:46,108 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:01:46,108 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:01:46,108 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:01:46,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:01:46,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:01:46,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:01:46,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:01:46,109 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:01:46,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:01:46,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:01:46,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:01:46,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:01:46,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:01:46,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:01:46,109 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:01:46,109 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:01:46,109 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:01:46,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:01:46,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:01:46,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:01:46,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:01:46,109 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 [2025-04-13 19:01:46,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:01:46,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:01:46,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:01:46,355 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:01:46,357 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:01:46,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-theta/unwind2-1.i [2025-04-13 19:01:47,653 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9fde6aca/a65938bd29b84e20b7ed4e4f1f5afaa3/FLAG3e9536a93 [2025-04-13 19:01:47,911 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:01:47,911 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind2-1.i [2025-04-13 19:01:47,933 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9fde6aca/a65938bd29b84e20b7ed4e4f1f5afaa3/FLAG3e9536a93 [2025-04-13 19:01:48,703 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9fde6aca/a65938bd29b84e20b7ed4e4f1f5afaa3 [2025-04-13 19:01:48,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:01:48,706 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:01:48,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:01:48,707 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:01:48,709 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:01:48,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:01:48" (1/1) ... [2025-04-13 19:01:48,710 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15879799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:48, skipping insertion in model container [2025-04-13 19:01:48,710 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:01:48" (1/1) ... [2025-04-13 19:01:48,739 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:01:49,016 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-theta/unwind2-1.i[33026,33039] [2025-04-13 19:01:49,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:01:49,033 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:01:49,079 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-theta/unwind2-1.i[33026,33039] [2025-04-13 19:01:49,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:01:49,108 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:01:49,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:49 WrapperNode [2025-04-13 19:01:49,109 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:01:49,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:01:49,110 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:01:49,110 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:01:49,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:49" (1/1) ... [2025-04-13 19:01:49,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:49" (1/1) ... [2025-04-13 19:01:49,139 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2025-04-13 19:01:49,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:01:49,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:01:49,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:01:49,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:01:49,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:49" (1/1) ... [2025-04-13 19:01:49,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:49" (1/1) ... [2025-04-13 19:01:49,149 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:49" (1/1) ... [2025-04-13 19:01:49,162 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 19:01:49,163 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:49" (1/1) ... [2025-04-13 19:01:49,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:49" (1/1) ... [2025-04-13 19:01:49,165 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:49" (1/1) ... [2025-04-13 19:01:49,166 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:49" (1/1) ... [2025-04-13 19:01:49,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:49" (1/1) ... [2025-04-13 19:01:49,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:49" (1/1) ... [2025-04-13 19:01:49,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:49" (1/1) ... [2025-04-13 19:01:49,173 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:01:49,178 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:01:49,178 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:01:49,178 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:01:49,179 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:49" (1/1) ... [2025-04-13 19:01:49,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:01:49,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:01:49,199 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 19:01:49,201 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 19:01:49,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:01:49,217 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-13 19:01:49,217 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-13 19:01:49,217 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-13 19:01:49,217 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-13 19:01:49,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:01:49,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:01:49,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:01:49,218 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:01:49,320 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:01:49,321 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:01:49,429 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:01:49,430 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:01:49,430 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:01:49,519 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:01:49,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:01:49 BoogieIcfgContainer [2025-04-13 19:01:49,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:01:49,525 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:01:49,525 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:01:49,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:01:49,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:01:48" (1/3) ... [2025-04-13 19:01:49,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c80e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:01:49, skipping insertion in model container [2025-04-13 19:01:49,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:01:49" (2/3) ... [2025-04-13 19:01:49,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c80e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:01:49, skipping insertion in model container [2025-04-13 19:01:49,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:01:49" (3/3) ... [2025-04-13 19:01:49,530 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind2-1.i [2025-04-13 19:01:49,539 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:01:49,540 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind2-1.i that has 3 procedures, 21 locations, 20 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-13 19:01:49,540 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:01:49,573 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 19:01:49,596 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 22 transitions, 58 flow [2025-04-13 19:01:49,609 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 89 states, 86 states have (on average 2.453488372093023) internal successors, (211), 88 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:49,627 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:01:49,634 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;@44d22031, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:01:49,634 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 19:01:49,635 INFO L278 IsEmpty]: Start isEmpty. Operand has 89 states, 86 states have (on average 2.453488372093023) internal successors, (211), 88 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:49,639 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 19:01:49,639 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:49,640 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:01:49,640 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:01:49,644 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:49,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1968472706, now seen corresponding path program 1 times [2025-04-13 19:01:49,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:49,649 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559647061] [2025-04-13 19:01:49,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:01:49,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:49,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:01:49,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:01:49,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:49,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:49,887 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 19:01:49,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:49,887 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559647061] [2025-04-13 19:01:49,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559647061] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:49,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:49,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:01:49,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672284047] [2025-04-13 19:01:49,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:49,895 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:01:49,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:49,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:01:49,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:01:49,909 INFO L87 Difference]: Start difference. First operand has 89 states, 86 states have (on average 2.453488372093023) internal successors, (211), 88 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 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 19:01:50,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:50,065 INFO L93 Difference]: Finished difference Result 175 states and 433 transitions. [2025-04-13 19:01:50,065 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:01:50,066 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-04-13 19:01:50,066 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:50,075 INFO L225 Difference]: With dead ends: 175 [2025-04-13 19:01:50,075 INFO L226 Difference]: Without dead ends: 144 [2025-04-13 19:01:50,078 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 19:01:50,080 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 71 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:50,080 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 8 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 19:01:50,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-04-13 19:01:50,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 111. [2025-04-13 19:01:50,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 108 states have (on average 2.4537037037037037) internal successors, (265), 110 states have internal predecessors, (265), 0 states have call successors, (0), 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 19:01:50,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 265 transitions. [2025-04-13 19:01:50,114 INFO L79 Accepts]: Start accepts. Automaton has 111 states and 265 transitions. Word has length 6 [2025-04-13 19:01:50,114 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:50,115 INFO L485 AbstractCegarLoop]: Abstraction has 111 states and 265 transitions. [2025-04-13 19:01:50,115 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 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 19:01:50,115 INFO L278 IsEmpty]: Start isEmpty. Operand 111 states and 265 transitions. [2025-04-13 19:01:50,115 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 19:01:50,115 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:50,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:50,115 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:01:50,116 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:01:50,116 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:50,116 INFO L85 PathProgramCache]: Analyzing trace with hash -893111565, now seen corresponding path program 1 times [2025-04-13 19:01:50,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:50,116 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818220242] [2025-04-13 19:01:50,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:01:50,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:50,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:01:50,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:01:50,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:50,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:50,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:50,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:50,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818220242] [2025-04-13 19:01:50,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818220242] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:01:50,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919876637] [2025-04-13 19:01:50,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:01:50,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:01:50,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:01:50,236 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:01:50,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 19:01:50,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:01:50,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:01:50,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:50,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:50,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 19:01:50,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:01:50,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:50,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:01:50,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:50,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919876637] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:01:50,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:01:50,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-04-13 19:01:50,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506400807] [2025-04-13 19:01:50,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:01:50,365 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:01:50,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:50,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:01:50,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:01:50,367 INFO L87 Difference]: Start difference. First operand 111 states and 265 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 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 19:01:50,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:50,518 INFO L93 Difference]: Finished difference Result 164 states and 406 transitions. [2025-04-13 19:01:50,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:01:50,518 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 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 7 [2025-04-13 19:01:50,518 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:50,519 INFO L225 Difference]: With dead ends: 164 [2025-04-13 19:01:50,520 INFO L226 Difference]: Without dead ends: 141 [2025-04-13 19:01:50,520 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-04-13 19:01:50,520 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 65 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:50,520 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 13 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 19:01:50,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-04-13 19:01:50,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2025-04-13 19:01:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 130 states have (on average 2.6076923076923078) internal successors, (339), 132 states have internal predecessors, (339), 0 states have call successors, (0), 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 19:01:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 339 transitions. [2025-04-13 19:01:50,535 INFO L79 Accepts]: Start accepts. Automaton has 133 states and 339 transitions. Word has length 7 [2025-04-13 19:01:50,535 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:50,535 INFO L485 AbstractCegarLoop]: Abstraction has 133 states and 339 transitions. [2025-04-13 19:01:50,535 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 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 19:01:50,535 INFO L278 IsEmpty]: Start isEmpty. Operand 133 states and 339 transitions. [2025-04-13 19:01:50,535 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 19:01:50,535 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:50,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:50,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 19:01:50,740 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:01:50,740 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:01:50,741 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:50,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1962707443, now seen corresponding path program 1 times [2025-04-13 19:01:50,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:50,741 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475433097] [2025-04-13 19:01:50,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:01:50,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:50,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:01:50,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:01:50,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:50,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:50,823 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 19:01:50,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:50,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475433097] [2025-04-13 19:01:50,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475433097] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:50,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:50,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:01:50,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941611840] [2025-04-13 19:01:50,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:50,824 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:01:50,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:50,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:01:50,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:01:50,825 INFO L87 Difference]: Start difference. First operand 133 states and 339 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 19:01:50,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:50,984 INFO L93 Difference]: Finished difference Result 245 states and 653 transitions. [2025-04-13 19:01:50,985 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:01:50,985 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-04-13 19:01:50,985 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:50,987 INFO L225 Difference]: With dead ends: 245 [2025-04-13 19:01:50,987 INFO L226 Difference]: Without dead ends: 206 [2025-04-13 19:01:50,987 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 19:01:50,987 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 62 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:50,990 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 8 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 19:01:50,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-04-13 19:01:51,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 165. [2025-04-13 19:01:51,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 162 states have (on average 2.617283950617284) internal successors, (424), 164 states have internal predecessors, (424), 0 states have call successors, (0), 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 19:01:51,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 424 transitions. [2025-04-13 19:01:51,018 INFO L79 Accepts]: Start accepts. Automaton has 165 states and 424 transitions. Word has length 8 [2025-04-13 19:01:51,018 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:51,018 INFO L485 AbstractCegarLoop]: Abstraction has 165 states and 424 transitions. [2025-04-13 19:01:51,018 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 19:01:51,018 INFO L278 IsEmpty]: Start isEmpty. Operand 165 states and 424 transitions. [2025-04-13 19:01:51,018 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 19:01:51,018 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:51,019 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:51,019 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:01:51,019 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:01:51,019 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:51,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1916654562, now seen corresponding path program 2 times [2025-04-13 19:01:51,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:51,019 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418845196] [2025-04-13 19:01:51,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:01:51,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:51,028 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-04-13 19:01:51,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:01:51,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:01:51,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:51,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:51,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:51,096 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418845196] [2025-04-13 19:01:51,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418845196] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:01:51,096 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028799816] [2025-04-13 19:01:51,096 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:01:51,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:01:51,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:01:51,099 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:01:51,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 19:01:51,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-04-13 19:01:51,142 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:01:51,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:01:51,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:51,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 19:01:51,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:01:51,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:51,175 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 19:01:51,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028799816] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:51,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 19:01:51,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-04-13 19:01:51,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419348954] [2025-04-13 19:01:51,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:51,176 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:01:51,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:51,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:01:51,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:01:51,177 INFO L87 Difference]: Start difference. First operand 165 states and 424 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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 19:01:51,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:51,381 INFO L93 Difference]: Finished difference Result 255 states and 633 transitions. [2025-04-13 19:01:51,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 19:01:51,383 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-04-13 19:01:51,383 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:51,384 INFO L225 Difference]: With dead ends: 255 [2025-04-13 19:01:51,384 INFO L226 Difference]: Without dead ends: 182 [2025-04-13 19:01:51,384 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-04-13 19:01:51,385 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 90 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:51,385 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 10 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 19:01:51,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-04-13 19:01:51,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 149. [2025-04-13 19:01:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 146 states have (on average 2.5342465753424657) internal successors, (370), 148 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:01:51,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 370 transitions. [2025-04-13 19:01:51,421 INFO L79 Accepts]: Start accepts. Automaton has 149 states and 370 transitions. Word has length 8 [2025-04-13 19:01:51,421 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:51,421 INFO L485 AbstractCegarLoop]: Abstraction has 149 states and 370 transitions. [2025-04-13 19:01:51,421 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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 19:01:51,421 INFO L278 IsEmpty]: Start isEmpty. Operand 149 states and 370 transitions. [2025-04-13 19:01:51,422 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 19:01:51,422 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:51,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:51,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 19:01:51,627 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-13 19:01:51,627 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:01:51,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:51,628 INFO L85 PathProgramCache]: Analyzing trace with hash -714388406, now seen corresponding path program 1 times [2025-04-13 19:01:51,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:51,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337228838] [2025-04-13 19:01:51,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:01:51,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:51,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:01:51,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:01:51,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:51,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:51,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:51,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337228838] [2025-04-13 19:01:51,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337228838] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:01:51,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045643434] [2025-04-13 19:01:51,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:01:51,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:01:51,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:01:51,712 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:01:51,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 19:01:51,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:01:51,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:01:51,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:51,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:51,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 19:01:51,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:01:51,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:51,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:01:51,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:51,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045643434] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:01:51,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:01:51,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-04-13 19:01:51,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707238404] [2025-04-13 19:01:51,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:01:51,836 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 19:01:51,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:51,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 19:01:51,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-13 19:01:51,837 INFO L87 Difference]: Start difference. First operand 149 states and 370 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 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 19:01:51,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:51,996 INFO L93 Difference]: Finished difference Result 233 states and 586 transitions. [2025-04-13 19:01:51,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:01:51,997 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 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 9 [2025-04-13 19:01:51,997 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:51,998 INFO L225 Difference]: With dead ends: 233 [2025-04-13 19:01:51,998 INFO L226 Difference]: Without dead ends: 200 [2025-04-13 19:01:51,998 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2025-04-13 19:01:51,999 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 79 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:51,999 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 14 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 19:01:52,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-04-13 19:01:52,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 172. [2025-04-13 19:01:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 169 states have (on average 2.5502958579881656) internal successors, (431), 171 states have internal predecessors, (431), 0 states have call successors, (0), 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 19:01:52,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 431 transitions. [2025-04-13 19:01:52,018 INFO L79 Accepts]: Start accepts. Automaton has 172 states and 431 transitions. Word has length 9 [2025-04-13 19:01:52,018 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:52,018 INFO L485 AbstractCegarLoop]: Abstraction has 172 states and 431 transitions. [2025-04-13 19:01:52,018 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 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 19:01:52,018 INFO L278 IsEmpty]: Start isEmpty. Operand 172 states and 431 transitions. [2025-04-13 19:01:52,018 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 19:01:52,019 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:52,019 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:52,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 19:01:52,219 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:01:52,219 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:01:52,220 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:52,220 INFO L85 PathProgramCache]: Analyzing trace with hash -671203923, now seen corresponding path program 2 times [2025-04-13 19:01:52,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:52,220 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512897792] [2025-04-13 19:01:52,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:01:52,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:52,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-04-13 19:01:52,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:01:52,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:01:52,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:52,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:52,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:52,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512897792] [2025-04-13 19:01:52,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512897792] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:01:52,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389307356] [2025-04-13 19:01:52,347 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:01:52,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:01:52,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:01:52,349 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:01:52,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 19:01:52,381 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-04-13 19:01:52,389 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:01:52,389 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:01:52,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:52,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 19:01:52,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:01:52,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:52,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:01:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:01:52,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389307356] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:01:52,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:01:52,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-13 19:01:52,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946848888] [2025-04-13 19:01:52,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:01:52,562 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 19:01:52,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:52,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 19:01:52,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-04-13 19:01:52,563 INFO L87 Difference]: Start difference. First operand 172 states and 431 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 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 19:01:52,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:52,795 INFO L93 Difference]: Finished difference Result 263 states and 662 transitions. [2025-04-13 19:01:52,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 19:01:52,795 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 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 10 [2025-04-13 19:01:52,795 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:52,796 INFO L225 Difference]: With dead ends: 263 [2025-04-13 19:01:52,796 INFO L226 Difference]: Without dead ends: 240 [2025-04-13 19:01:52,797 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 19:01:52,798 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 139 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:52,798 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 12 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 19:01:52,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-04-13 19:01:52,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 195. [2025-04-13 19:01:52,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 192 states have (on average 2.6145833333333335) internal successors, (502), 194 states have internal predecessors, (502), 0 states have call successors, (0), 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 19:01:52,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 502 transitions. [2025-04-13 19:01:52,816 INFO L79 Accepts]: Start accepts. Automaton has 195 states and 502 transitions. Word has length 10 [2025-04-13 19:01:52,816 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:52,816 INFO L485 AbstractCegarLoop]: Abstraction has 195 states and 502 transitions. [2025-04-13 19:01:52,816 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 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 19:01:52,816 INFO L278 IsEmpty]: Start isEmpty. Operand 195 states and 502 transitions. [2025-04-13 19:01:52,817 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 19:01:52,817 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:52,817 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:52,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 19:01:53,021 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:01:53,022 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:01:53,022 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:53,022 INFO L85 PathProgramCache]: Analyzing trace with hash -671449970, now seen corresponding path program 1 times [2025-04-13 19:01:53,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:53,022 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189661497] [2025-04-13 19:01:53,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:01:53,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:53,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:01:53,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:01:53,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:53,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:53,060 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 19:01:53,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:53,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189661497] [2025-04-13 19:01:53,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189661497] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:53,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:53,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:01:53,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092365361] [2025-04-13 19:01:53,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:53,061 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:01:53,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:53,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:01:53,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:01:53,062 INFO L87 Difference]: Start difference. First operand 195 states and 502 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 19:01:53,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:53,152 INFO L93 Difference]: Finished difference Result 248 states and 617 transitions. [2025-04-13 19:01:53,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:01:53,153 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-04-13 19:01:53,153 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:53,155 INFO L225 Difference]: With dead ends: 248 [2025-04-13 19:01:53,155 INFO L226 Difference]: Without dead ends: 239 [2025-04-13 19:01:53,155 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:01:53,156 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 52 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:53,156 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 7 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 19:01:53,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-04-13 19:01:53,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 195. [2025-04-13 19:01:53,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 192 states have (on average 2.6145833333333335) internal successors, (502), 194 states have internal predecessors, (502), 0 states have call successors, (0), 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 19:01:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 502 transitions. [2025-04-13 19:01:53,177 INFO L79 Accepts]: Start accepts. Automaton has 195 states and 502 transitions. Word has length 10 [2025-04-13 19:01:53,177 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:53,178 INFO L485 AbstractCegarLoop]: Abstraction has 195 states and 502 transitions. [2025-04-13 19:01:53,178 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 19:01:53,178 INFO L278 IsEmpty]: Start isEmpty. Operand 195 states and 502 transitions. [2025-04-13 19:01:53,178 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 19:01:53,179 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:53,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:53,179 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:01:53,179 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:01:53,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:53,179 INFO L85 PathProgramCache]: Analyzing trace with hash -677879252, now seen corresponding path program 1 times [2025-04-13 19:01:53,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:53,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91888487] [2025-04-13 19:01:53,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:01:53,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:53,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:01:53,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:01:53,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:53,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:53,226 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 19:01:53,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:53,226 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91888487] [2025-04-13 19:01:53,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91888487] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:53,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:01:53,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:01:53,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728912296] [2025-04-13 19:01:53,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:53,227 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:01:53,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:53,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:01:53,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:01:53,227 INFO L87 Difference]: Start difference. First operand 195 states and 502 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 19:01:53,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:53,318 INFO L93 Difference]: Finished difference Result 244 states and 600 transitions. [2025-04-13 19:01:53,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:01:53,318 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-04-13 19:01:53,318 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:53,319 INFO L225 Difference]: With dead ends: 244 [2025-04-13 19:01:53,320 INFO L226 Difference]: Without dead ends: 230 [2025-04-13 19:01:53,320 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:01:53,320 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 48 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:53,320 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 7 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 19:01:53,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-04-13 19:01:53,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 195. [2025-04-13 19:01:53,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 192 states have (on average 2.5416666666666665) internal successors, (488), 194 states have internal predecessors, (488), 0 states have call successors, (0), 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 19:01:53,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 488 transitions. [2025-04-13 19:01:53,338 INFO L79 Accepts]: Start accepts. Automaton has 195 states and 488 transitions. Word has length 10 [2025-04-13 19:01:53,338 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:53,338 INFO L485 AbstractCegarLoop]: Abstraction has 195 states and 488 transitions. [2025-04-13 19:01:53,338 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 19:01:53,338 INFO L278 IsEmpty]: Start isEmpty. Operand 195 states and 488 transitions. [2025-04-13 19:01:53,340 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 19:01:53,340 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:53,340 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:53,340 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:01:53,340 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:01:53,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:53,341 INFO L85 PathProgramCache]: Analyzing trace with hash 667515050, now seen corresponding path program 3 times [2025-04-13 19:01:53,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:53,341 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842062663] [2025-04-13 19:01:53,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:01:53,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:53,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 11 statements into 3 equivalence classes. [2025-04-13 19:01:53,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 11 statements. [2025-04-13 19:01:53,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:01:53,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:53,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 19:01:53,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:01:53,419 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842062663] [2025-04-13 19:01:53,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842062663] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:01:53,419 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077260761] [2025-04-13 19:01:53,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:01:53,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:01:53,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:01:53,421 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:01:53,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 19:01:53,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 11 statements into 3 equivalence classes. [2025-04-13 19:01:53,458 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 11 statements. [2025-04-13 19:01:53,459 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 19:01:53,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:01:53,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 19:01:53,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:01:53,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 19:01:53,476 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 19:01:53,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077260761] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:01:53,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 19:01:53,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-04-13 19:01:53,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966205829] [2025-04-13 19:01:53,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:01:53,477 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:01:53,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:01:53,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:01:53,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:01:53,477 INFO L87 Difference]: Start difference. First operand 195 states and 488 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 19:01:53,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:01:53,566 INFO L93 Difference]: Finished difference Result 250 states and 615 transitions. [2025-04-13 19:01:53,567 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:01:53,567 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 11 [2025-04-13 19:01:53,567 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:01:53,568 INFO L225 Difference]: With dead ends: 250 [2025-04-13 19:01:53,568 INFO L226 Difference]: Without dead ends: 120 [2025-04-13 19:01:53,568 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:01:53,569 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 30 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 19:01:53,569 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 8 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 19:01:53,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-04-13 19:01:53,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 110. [2025-04-13 19:01:53,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 108 states have (on average 2.3055555555555554) internal successors, (249), 109 states have internal predecessors, (249), 0 states have call successors, (0), 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 19:01:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 249 transitions. [2025-04-13 19:01:53,577 INFO L79 Accepts]: Start accepts. Automaton has 110 states and 249 transitions. Word has length 11 [2025-04-13 19:01:53,577 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:01:53,577 INFO L485 AbstractCegarLoop]: Abstraction has 110 states and 249 transitions. [2025-04-13 19:01:53,578 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 19:01:53,578 INFO L278 IsEmpty]: Start isEmpty. Operand 110 states and 249 transitions. [2025-04-13 19:01:53,578 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 19:01:53,578 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:01:53,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:01:53,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 19:01:53,782 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:01:53,782 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:01:53,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:01:53,782 INFO L85 PathProgramCache]: Analyzing trace with hash 659887593, now seen corresponding path program 1 times [2025-04-13 19:01:53,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:01:53,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516318098] [2025-04-13 19:01:53,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:01:53,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:01:53,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:01:53,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:01:53,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:53,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:01:53,788 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:01:53,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:01:53,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:01:53,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:01:53,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:01:53,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:01:53,805 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:01:53,806 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 19:01:53,807 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-04-13 19:01:53,807 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-13 19:01:53,807 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 19:01:53,807 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 19:01:53,807 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 19:01:53,807 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:01:53,811 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2025-04-13 19:01:53,844 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:01:53,844 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:01:53,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:01:53 BasicIcfg [2025-04-13 19:01:53,846 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:01:53,847 INFO L158 Benchmark]: Toolchain (without parser) took 5141.28ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 34.7MB in the end (delta: 63.1MB). Peak memory consumption was 64.2MB. Max. memory is 8.0GB. [2025-04-13 19:01:53,847 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 159.4MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:01:53,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.68ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 74.4MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 19:01:53,847 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.76ms. Allocated memory is still 142.6MB. Free memory was 74.4MB in the beginning and 72.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:01:53,849 INFO L158 Benchmark]: Boogie Preprocessor took 34.01ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 71.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:01:53,849 INFO L158 Benchmark]: RCFGBuilder took 341.88ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 48.4MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 19:01:53,849 INFO L158 Benchmark]: TraceAbstraction took 4321.88ms. Allocated memory is still 142.6MB. Free memory was 47.5MB in the beginning and 34.7MB in the end (delta: 12.7MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. [2025-04-13 19:01:53,851 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.31ms. Allocated memory is still 159.4MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 402.68ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 74.4MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.76ms. Allocated memory is still 142.6MB. Free memory was 74.4MB in the beginning and 72.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 34.01ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 71.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 341.88ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 48.4MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 4321.88ms. Allocated memory is still 142.6MB. Free memory was 47.5MB in the beginning and 34.7MB in the end (delta: 12.7MB). Peak memory consumption was 13.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: 753]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L775] 0 _N = 1 [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=1, limit=0, t1=-1] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=1, limit=0, t1=-1, t2=0] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\at(arg, Pre)={0:0}, _N=1, arg={0:0}, lim=2, limit=0] [L768] 2 limit = lim VAL [\at(arg, Pre)={0:0}, _N=1, arg={0:0}, lim=2, limit=2] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\at(arg, Pre)={0:0}, _N=1, arg={0:0}, lim=1, limit=2] [L759] 1 limit = lim VAL [\at(arg, Pre)={0:0}, _N=1, arg={0:0}, lim=1, limit=1] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\at(arg, Pre)={0:0}, _N=1, arg={0:0}, bound=1, i=0, lim=2, limit=1] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=1, arg={0:0}, bound=1, i=1, lim=2, limit=1] [L770] COND FALSE 2 !(i < bound) [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression [L753] 2 reach_error() VAL [\at(expression, Pre)=0, _N=1, expression=0, limit=1] - UnprovableResult [Line: 779]: 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: 778]: 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: 753]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 35 locations, 38 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 636 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 636 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1185 IncrementalHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 35 mSDtfsCounter, 1185 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=195occurred in iteration=6, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 277 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 135 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 557 SizeOfPredicates, 10 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 17 InterpolantComputations, 6 PerfectInterpolantSequences, 14/33 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 19:01:53,866 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...