/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/weaver/popl20-bad-threaded-sum-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:15:15,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:15:15,733 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 18:15:15,741 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:15:15,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:15:15,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:15:15,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:15:15,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:15:15,765 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:15:15,765 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:15:15,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:15:15,765 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:15:15,766 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:15:15,766 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:15:15,766 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:15:15,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:15:15,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:15:15,766 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:15:15,766 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:15:15,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:15:15,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:15:15,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:15:15,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:15:15,766 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:15:15,766 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:15:15,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:15:15,766 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:15:15,766 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:15:15,766 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:15:15,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:15:15,767 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:15:15,767 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:15:15,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:15:15,767 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:15:15,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:15:15,767 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:15:15,767 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:15:15,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:15:15,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:15:15,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:15:15,767 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:15:15,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:15:15,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:15:15,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:15:15,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:15:15,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:15:15,768 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:15:15,768 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 18:15:15,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:15:16,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:15:16,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:15:16,006 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:15:16,007 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:15:16,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2025-04-13 18:15:17,343 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fce7d0f0/386dd21bdc9f475d827674cf6aaec505/FLAG1110406c8 [2025-04-13 18:15:17,582 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:15:17,586 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2025-04-13 18:15:17,597 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fce7d0f0/386dd21bdc9f475d827674cf6aaec505/FLAG1110406c8 [2025-04-13 18:15:18,344 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fce7d0f0/386dd21bdc9f475d827674cf6aaec505 [2025-04-13 18:15:18,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:15:18,348 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:15:18,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:15:18,349 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:15:18,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:15:18,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:15:18" (1/1) ... [2025-04-13 18:15:18,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cf138d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:15:18, skipping insertion in model container [2025-04-13 18:15:18,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:15:18" (1/1) ... [2025-04-13 18:15:18,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:15:18,524 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c[2502,2515] [2025-04-13 18:15:18,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:15:18,538 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:15:18,561 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c[2502,2515] [2025-04-13 18:15:18,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:15:18,572 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:15:18,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:15:18 WrapperNode [2025-04-13 18:15:18,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:15:18,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:15:18,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:15:18,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:15:18,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:15:18" (1/1) ... [2025-04-13 18:15:18,589 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:15:18" (1/1) ... [2025-04-13 18:15:18,610 INFO L138 Inliner]: procedures = 20, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 48 [2025-04-13 18:15:18,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:15:18,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:15:18,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:15:18,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:15:18,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:15:18" (1/1) ... [2025-04-13 18:15:18,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:15:18" (1/1) ... [2025-04-13 18:15:18,625 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:15:18" (1/1) ... [2025-04-13 18:15:18,645 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 18:15:18,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:15:18" (1/1) ... [2025-04-13 18:15:18,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:15:18" (1/1) ... [2025-04-13 18:15:18,651 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:15:18" (1/1) ... [2025-04-13 18:15:18,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:15:18" (1/1) ... [2025-04-13 18:15:18,654 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:15:18" (1/1) ... [2025-04-13 18:15:18,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:15:18" (1/1) ... [2025-04-13 18:15:18,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:15:18" (1/1) ... [2025-04-13 18:15:18,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:15:18,666 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:15:18,666 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:15:18,666 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:15:18,667 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:15:18" (1/1) ... [2025-04-13 18:15:18,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:15:18,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:15:18,694 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 18:15:18,701 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 18:15:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:15:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:15:18,717 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:15:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:15:18,717 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:15:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:15:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 18:15:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 18:15:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:15:18,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:15:18,718 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 18:15:18,789 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:15:18,791 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:15:18,948 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:15:18,948 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:15:18,949 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:15:19,074 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:15:19,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:15:19 BoogieIcfgContainer [2025-04-13 18:15:19,075 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:15:19,077 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:15:19,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:15:19,081 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:15:19,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:15:18" (1/3) ... [2025-04-13 18:15:19,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3a54f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:15:19, skipping insertion in model container [2025-04-13 18:15:19,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:15:18" (2/3) ... [2025-04-13 18:15:19,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3a54f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:15:19, skipping insertion in model container [2025-04-13 18:15:19,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:15:19" (3/3) ... [2025-04-13 18:15:19,083 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-threaded-sum-2.wvr.c [2025-04-13 18:15:19,094 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:15:19,096 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-threaded-sum-2.wvr.c that has 3 procedures, 23 locations, 22 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 18:15:19,096 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:15:19,131 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 18:15:19,150 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 24 transitions, 62 flow [2025-04-13 18:15:19,174 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 107 states, 106 states have (on average 2.3773584905660377) internal successors, (252), 106 states have internal predecessors, (252), 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 18:15:19,195 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:15:19,203 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;@325c32f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:15:19,204 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 18:15:19,206 INFO L278 IsEmpty]: Start isEmpty. Operand has 107 states, 106 states have (on average 2.3773584905660377) internal successors, (252), 106 states have internal predecessors, (252), 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 18:15:19,210 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:15:19,210 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:15:19,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:15:19,210 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:15:19,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:15:19,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1301732947, now seen corresponding path program 1 times [2025-04-13 18:15:19,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:15:19,221 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605330330] [2025-04-13 18:15:19,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:15:19,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:15:19,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 18:15:19,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:15:19,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:15:19,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:15:19,598 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 18:15:19,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:15:19,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605330330] [2025-04-13 18:15:19,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605330330] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:15:19,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:15:19,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:15:19,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439028449] [2025-04-13 18:15:19,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:15:19,604 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:15:19,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:15:19,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:15:19,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:15:19,630 INFO L87 Difference]: Start difference. First operand has 107 states, 106 states have (on average 2.3773584905660377) internal successors, (252), 106 states have internal predecessors, (252), 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 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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 18:15:19,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:15:19,749 INFO L93 Difference]: Finished difference Result 204 states and 490 transitions. [2025-04-13 18:15:19,750 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:15:19,750 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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 14 [2025-04-13 18:15:19,751 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:15:19,756 INFO L225 Difference]: With dead ends: 204 [2025-04-13 18:15:19,756 INFO L226 Difference]: Without dead ends: 179 [2025-04-13 18:15:19,758 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:15:19,759 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:15:19,760 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 16 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:15:19,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-04-13 18:15:19,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 135. [2025-04-13 18:15:19,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.3955223880597014) internal successors, (321), 134 states have internal predecessors, (321), 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 18:15:19,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 321 transitions. [2025-04-13 18:15:19,792 INFO L79 Accepts]: Start accepts. Automaton has 135 states and 321 transitions. Word has length 14 [2025-04-13 18:15:19,792 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:15:19,792 INFO L485 AbstractCegarLoop]: Abstraction has 135 states and 321 transitions. [2025-04-13 18:15:19,792 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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 18:15:19,792 INFO L278 IsEmpty]: Start isEmpty. Operand 135 states and 321 transitions. [2025-04-13 18:15:19,793 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 18:15:19,793 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:15:19,793 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:15:19,793 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:15:19,795 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:15:19,795 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:15:19,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1882916597, now seen corresponding path program 1 times [2025-04-13 18:15:19,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:15:19,795 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108784691] [2025-04-13 18:15:19,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:15:19,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:15:19,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 18:15:19,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 18:15:19,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:15:19,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:15:19,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:15:19,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:15:19,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108784691] [2025-04-13 18:15:19,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108784691] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:15:19,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:15:19,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:15:19,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076368862] [2025-04-13 18:15:19,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:15:19,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:15:19,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:15:19,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:15:19,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:15:19,968 INFO L87 Difference]: Start difference. First operand 135 states and 321 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:15:20,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:15:20,064 INFO L93 Difference]: Finished difference Result 200 states and 478 transitions. [2025-04-13 18:15:20,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:15:20,064 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 18:15:20,064 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:15:20,065 INFO L225 Difference]: With dead ends: 200 [2025-04-13 18:15:20,065 INFO L226 Difference]: Without dead ends: 183 [2025-04-13 18:15:20,066 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:15:20,066 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:15:20,066 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 12 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:15:20,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-04-13 18:15:20,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 142. [2025-04-13 18:15:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.397163120567376) internal successors, (338), 141 states have internal predecessors, (338), 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 18:15:20,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 338 transitions. [2025-04-13 18:15:20,082 INFO L79 Accepts]: Start accepts. Automaton has 142 states and 338 transitions. Word has length 17 [2025-04-13 18:15:20,082 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:15:20,082 INFO L485 AbstractCegarLoop]: Abstraction has 142 states and 338 transitions. [2025-04-13 18:15:20,082 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:15:20,082 INFO L278 IsEmpty]: Start isEmpty. Operand 142 states and 338 transitions. [2025-04-13 18:15:20,085 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 18:15:20,085 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:15:20,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:15:20,085 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:15:20,085 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:15:20,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:15:20,086 INFO L85 PathProgramCache]: Analyzing trace with hash 220272450, now seen corresponding path program 1 times [2025-04-13 18:15:20,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:15:20,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470021877] [2025-04-13 18:15:20,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:15:20,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:15:20,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 18:15:20,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 18:15:20,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:15:20,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:15:20,687 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 18:15:20,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:15:20,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470021877] [2025-04-13 18:15:20,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470021877] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:15:20,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125124262] [2025-04-13 18:15:20,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:15:20,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:15:20,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:15:20,692 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 18:15:20,693 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 18:15:20,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 18:15:20,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 18:15:20,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:15:20,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:15:20,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-13 18:15:20,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:15:29,177 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 18:15:29,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:15:29,539 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 18:15:29,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125124262] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:15:29,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:15:29,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2025-04-13 18:15:29,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149593862] [2025-04-13 18:15:29,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:15:29,539 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:15:29,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:15:29,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:15:29,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=226, Unknown=2, NotChecked=0, Total=306 [2025-04-13 18:15:29,540 INFO L87 Difference]: Start difference. First operand 142 states and 338 transitions. Second operand has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 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 18:15:41,840 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 28 DAG size of output: 23 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:15:53,933 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 26 DAG size of output: 24 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:16:02,005 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 37 DAG size of output: 31 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:16:10,130 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 35 DAG size of output: 32 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:16:11,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:16:11,582 INFO L93 Difference]: Finished difference Result 615 states and 1526 transitions. [2025-04-13 18:16:11,583 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 18:16:11,583 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 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 18 [2025-04-13 18:16:11,583 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:16:11,586 INFO L225 Difference]: With dead ends: 615 [2025-04-13 18:16:11,588 INFO L226 Difference]: Without dead ends: 526 [2025-04-13 18:16:11,591 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 49.6s TimeCoverageRelationStatistics Valid=541, Invalid=1711, Unknown=4, NotChecked=0, Total=2256 [2025-04-13 18:16:11,591 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 290 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:16:11,591 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 91 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:16:11,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-04-13 18:16:11,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 254. [2025-04-13 18:16:11,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 2.4466403162055337) internal successors, (619), 253 states have internal predecessors, (619), 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 18:16:11,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 619 transitions. [2025-04-13 18:16:11,635 INFO L79 Accepts]: Start accepts. Automaton has 254 states and 619 transitions. Word has length 18 [2025-04-13 18:16:11,635 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:16:11,635 INFO L485 AbstractCegarLoop]: Abstraction has 254 states and 619 transitions. [2025-04-13 18:16:11,635 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 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 18:16:11,635 INFO L278 IsEmpty]: Start isEmpty. Operand 254 states and 619 transitions. [2025-04-13 18:16:11,636 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 18:16:11,636 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:16:11,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:16:11,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 18:16:11,841 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:16:11,841 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:16:11,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:16:11,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1713740794, now seen corresponding path program 1 times [2025-04-13 18:16:11,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:16:11,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697099593] [2025-04-13 18:16:11,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:16:11,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:16:11,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 18:16:11,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:16:11,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:16:11,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:16:11,941 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 18:16:11,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:16:11,942 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697099593] [2025-04-13 18:16:11,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697099593] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:16:11,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:16:11,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:16:11,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748153959] [2025-04-13 18:16:11,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:16:11,942 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:16:11,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:16:11,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:16:11,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:16:11,943 INFO L87 Difference]: Start difference. First operand 254 states and 619 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 18:16:12,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:16:12,057 INFO L93 Difference]: Finished difference Result 369 states and 909 transitions. [2025-04-13 18:16:12,058 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:16:12,058 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2025-04-13 18:16:12,058 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:16:12,061 INFO L225 Difference]: With dead ends: 369 [2025-04-13 18:16:12,061 INFO L226 Difference]: Without dead ends: 341 [2025-04-13 18:16:12,061 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:16:12,062 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:16:12,062 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 17 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:16:12,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-04-13 18:16:12,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 239. [2025-04-13 18:16:12,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 2.46218487394958) internal successors, (586), 238 states have internal predecessors, (586), 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 18:16:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 586 transitions. [2025-04-13 18:16:12,109 INFO L79 Accepts]: Start accepts. Automaton has 239 states and 586 transitions. Word has length 21 [2025-04-13 18:16:12,109 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:16:12,109 INFO L485 AbstractCegarLoop]: Abstraction has 239 states and 586 transitions. [2025-04-13 18:16:12,110 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 18:16:12,110 INFO L278 IsEmpty]: Start isEmpty. Operand 239 states and 586 transitions. [2025-04-13 18:16:12,111 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:16:12,111 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:16:12,111 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:16:12,111 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 18:16:12,112 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:16:12,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:16:12,112 INFO L85 PathProgramCache]: Analyzing trace with hash 145709459, now seen corresponding path program 2 times [2025-04-13 18:16:12,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:16:12,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870749055] [2025-04-13 18:16:12,112 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:16:12,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:16:12,118 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:16:12,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 22 statements. [2025-04-13 18:16:12,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:16:12,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:16:12,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:16:12,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:16:12,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870749055] [2025-04-13 18:16:12,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870749055] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:16:12,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:16:12,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:16:12,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670849742] [2025-04-13 18:16:12,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:16:12,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:16:12,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:16:12,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:16:12,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:16:12,284 INFO L87 Difference]: Start difference. First operand 239 states and 586 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 18:16:12,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:16:12,503 INFO L93 Difference]: Finished difference Result 415 states and 1008 transitions. [2025-04-13 18:16:12,504 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:16:12,504 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 22 [2025-04-13 18:16:12,504 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:16:12,506 INFO L225 Difference]: With dead ends: 415 [2025-04-13 18:16:12,506 INFO L226 Difference]: Without dead ends: 410 [2025-04-13 18:16:12,507 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:16:12,507 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 42 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:16:12,510 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 29 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:16:12,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-04-13 18:16:12,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 251. [2025-04-13 18:16:12,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 2.528) internal successors, (632), 250 states have internal predecessors, (632), 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 18:16:12,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 632 transitions. [2025-04-13 18:16:12,551 INFO L79 Accepts]: Start accepts. Automaton has 251 states and 632 transitions. Word has length 22 [2025-04-13 18:16:12,551 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:16:12,551 INFO L485 AbstractCegarLoop]: Abstraction has 251 states and 632 transitions. [2025-04-13 18:16:12,551 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 18:16:12,551 INFO L278 IsEmpty]: Start isEmpty. Operand 251 states and 632 transitions. [2025-04-13 18:16:12,552 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:16:12,552 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:16:12,552 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:16:12,552 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 18:16:12,553 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:16:12,553 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:16:12,553 INFO L85 PathProgramCache]: Analyzing trace with hash 140347079, now seen corresponding path program 3 times [2025-04-13 18:16:12,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:16:12,553 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34728137] [2025-04-13 18:16:12,553 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:16:12,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:16:12,558 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:16:12,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 22 statements. [2025-04-13 18:16:12,566 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:16:12,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:16:12,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:16:12,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:16:12,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34728137] [2025-04-13 18:16:12,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34728137] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:16:12,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:16:12,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:16:12,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606562394] [2025-04-13 18:16:12,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:16:12,733 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:16:12,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:16:12,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:16:12,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:16:12,734 INFO L87 Difference]: Start difference. First operand 251 states and 632 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 18:16:12,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:16:12,998 INFO L93 Difference]: Finished difference Result 425 states and 1026 transitions. [2025-04-13 18:16:12,998 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:16:12,998 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 22 [2025-04-13 18:16:12,998 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:16:13,001 INFO L225 Difference]: With dead ends: 425 [2025-04-13 18:16:13,001 INFO L226 Difference]: Without dead ends: 420 [2025-04-13 18:16:13,001 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:16:13,002 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 49 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:16:13,002 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 27 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:16:13,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-04-13 18:16:13,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 254. [2025-04-13 18:16:13,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 2.5177865612648223) internal successors, (637), 253 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:16:13,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 637 transitions. [2025-04-13 18:16:13,042 INFO L79 Accepts]: Start accepts. Automaton has 254 states and 637 transitions. Word has length 22 [2025-04-13 18:16:13,042 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:16:13,042 INFO L485 AbstractCegarLoop]: Abstraction has 254 states and 637 transitions. [2025-04-13 18:16:13,042 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 18:16:13,042 INFO L278 IsEmpty]: Start isEmpty. Operand 254 states and 637 transitions. [2025-04-13 18:16:13,043 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:16:13,043 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:16:13,043 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:16:13,043 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 18:16:13,043 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:16:13,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:16:13,043 INFO L85 PathProgramCache]: Analyzing trace with hash -109003591, now seen corresponding path program 4 times [2025-04-13 18:16:13,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:16:13,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525282408] [2025-04-13 18:16:13,044 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:16:13,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:16:13,048 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:16:13,055 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:16:13,055 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:16:13,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:16:13,193 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 18:16:13,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:16:13,193 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525282408] [2025-04-13 18:16:13,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525282408] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:16:13,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:16:13,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:16:13,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665433963] [2025-04-13 18:16:13,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:16:13,193 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:16:13,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:16:13,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:16:13,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:16:13,194 INFO L87 Difference]: Start difference. First operand 254 states and 637 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 18:16:13,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:16:13,392 INFO L93 Difference]: Finished difference Result 360 states and 908 transitions. [2025-04-13 18:16:13,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:16:13,393 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 22 [2025-04-13 18:16:13,393 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:16:13,395 INFO L225 Difference]: With dead ends: 360 [2025-04-13 18:16:13,395 INFO L226 Difference]: Without dead ends: 340 [2025-04-13 18:16:13,396 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:16:13,396 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 55 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:16:13,396 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 17 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:16:13,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-04-13 18:16:13,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 228. [2025-04-13 18:16:13,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 2.5198237885462555) internal successors, (572), 227 states have internal predecessors, (572), 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 18:16:13,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 572 transitions. [2025-04-13 18:16:13,422 INFO L79 Accepts]: Start accepts. Automaton has 228 states and 572 transitions. Word has length 22 [2025-04-13 18:16:13,422 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:16:13,422 INFO L485 AbstractCegarLoop]: Abstraction has 228 states and 572 transitions. [2025-04-13 18:16:13,422 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 18:16:13,422 INFO L278 IsEmpty]: Start isEmpty. Operand 228 states and 572 transitions. [2025-04-13 18:16:13,423 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 18:16:13,423 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:16:13,423 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:16:13,423 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 18:16:13,423 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:16:13,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:16:13,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1294325450, now seen corresponding path program 2 times [2025-04-13 18:16:13,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:16:13,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516437055] [2025-04-13 18:16:13,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:16:13,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:16:13,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 18:16:13,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:16:13,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:16:13,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:16:14,874 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 18:16:14,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:16:14,874 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516437055] [2025-04-13 18:16:14,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516437055] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:16:14,874 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56373164] [2025-04-13 18:16:14,875 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:16:14,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:16:14,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:16:14,876 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 18:16:14,878 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 18:16:14,909 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 18:16:14,929 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:16:14,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:16:14,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:16:14,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 18:16:14,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:16:19,703 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 18:16:19,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:16:24,859 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 18:16:24,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56373164] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:16:24,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:16:24,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-04-13 18:16:24,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506001210] [2025-04-13 18:16:24,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:16:24,860 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 18:16:24,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:16:24,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 18:16:24,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=328, Unknown=1, NotChecked=0, Total=420 [2025-04-13 18:16:24,860 INFO L87 Difference]: Start difference. First operand 228 states and 572 transitions. Second operand has 21 states, 20 states have (on average 3.2) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:16:27,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:16:27,940 INFO L93 Difference]: Finished difference Result 778 states and 1928 transitions. [2025-04-13 18:16:27,940 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 18:16:27,940 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.2) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 18:16:27,940 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:16:27,943 INFO L225 Difference]: With dead ends: 778 [2025-04-13 18:16:27,943 INFO L226 Difference]: Without dead ends: 662 [2025-04-13 18:16:27,944 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=511, Invalid=2038, Unknown=1, NotChecked=0, Total=2550 [2025-04-13 18:16:27,944 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 327 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:16:27,945 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 180 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 18:16:27,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-04-13 18:16:27,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 408. [2025-04-13 18:16:27,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 2.518427518427518) internal successors, (1025), 407 states have internal predecessors, (1025), 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 18:16:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1025 transitions. [2025-04-13 18:16:27,999 INFO L79 Accepts]: Start accepts. Automaton has 408 states and 1025 transitions. Word has length 24 [2025-04-13 18:16:27,999 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:16:27,999 INFO L485 AbstractCegarLoop]: Abstraction has 408 states and 1025 transitions. [2025-04-13 18:16:27,999 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.2) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:16:27,999 INFO L278 IsEmpty]: Start isEmpty. Operand 408 states and 1025 transitions. [2025-04-13 18:16:28,000 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 18:16:28,000 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:16:28,000 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:16:28,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 18:16:28,204 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,SelfDestructingSolverStorable7 [2025-04-13 18:16:28,204 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:16:28,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:16:28,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1796757054, now seen corresponding path program 3 times [2025-04-13 18:16:28,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:16:28,205 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027090192] [2025-04-13 18:16:28,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:16:28,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:16:28,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-13 18:16:28,235 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:16:28,236 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:16:28,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:16:33,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:16:33,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:16:33,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027090192] [2025-04-13 18:16:33,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027090192] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:16:33,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779476784] [2025-04-13 18:16:33,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:16:33,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:16:33,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:16:33,565 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 18:16:33,566 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 18:16:33,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-13 18:16:33,669 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:16:33,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:16:33,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:16:33,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 18:16:33,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:17:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:17:16,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:17:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:17:18,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779476784] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:17:18,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:17:18,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2025-04-13 18:17:18,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332578627] [2025-04-13 18:17:18,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:17:18,741 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 18:17:18,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:17:18,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 18:17:18,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=630, Unknown=10, NotChecked=0, Total=812 [2025-04-13 18:17:18,741 INFO L87 Difference]: Start difference. First operand 408 states and 1025 transitions. Second operand has 29 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 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 18:17:20,451 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 18:17:24,241 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:17:28,252 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:17:29,488 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:17:33,504 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:17:38,081 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:17:42,096 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:17:58,216 WARN L286 SmtUtils]: Spent 12.03s on a formula simplification. DAG size of input: 43 DAG size of output: 32 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:18:05,224 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:18:17,554 WARN L286 SmtUtils]: Spent 12.04s on a formula simplification. DAG size of input: 52 DAG size of output: 40 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:18:21,740 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:18:46,164 WARN L286 SmtUtils]: Spent 20.37s on a formula simplification. DAG size of input: 53 DAG size of output: 49 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:18:55,627 WARN L286 SmtUtils]: Spent 8.97s on a formula simplification. DAG size of input: 52 DAG size of output: 43 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:18:59,488 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:19:08,890 WARN L286 SmtUtils]: Spent 9.31s on a formula simplification. DAG size of input: 64 DAG size of output: 40 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:19:23,350 WARN L286 SmtUtils]: Spent 13.91s on a formula simplification. DAG size of input: 82 DAG size of output: 54 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:19:29,320 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:19:33,452 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:19:43,289 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:19:44,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:19:44,956 INFO L93 Difference]: Finished difference Result 1096 states and 2640 transitions. [2025-04-13 18:19:44,956 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-04-13 18:19:44,956 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 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 24 [2025-04-13 18:19:44,957 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:19:44,960 INFO L225 Difference]: With dead ends: 1096 [2025-04-13 18:19:44,961 INFO L226 Difference]: Without dead ends: 903 [2025-04-13 18:19:44,963 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1989 ImplicationChecksByTransitivity, 151.7s TimeCoverageRelationStatistics Valid=1191, Invalid=5276, Unknown=13, NotChecked=0, Total=6480 [2025-04-13 18:19:44,965 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 562 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 69 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:19:44,965 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 246 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1414 Invalid, 6 Unknown, 0 Unchecked, 43.3s Time] [2025-04-13 18:19:44,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2025-04-13 18:19:45,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 524. [2025-04-13 18:19:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 523 states have (on average 2.552581261950287) internal successors, (1335), 523 states have internal predecessors, (1335), 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 18:19:45,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1335 transitions. [2025-04-13 18:19:45,083 INFO L79 Accepts]: Start accepts. Automaton has 524 states and 1335 transitions. Word has length 24 [2025-04-13 18:19:45,083 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:19:45,083 INFO L485 AbstractCegarLoop]: Abstraction has 524 states and 1335 transitions. [2025-04-13 18:19:45,083 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 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 18:19:45,083 INFO L278 IsEmpty]: Start isEmpty. Operand 524 states and 1335 transitions. [2025-04-13 18:19:45,085 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 18:19:45,085 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:19:45,085 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:19:45,096 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 18:19:45,286 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:19:45,286 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:19:45,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:19:45,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1940262966, now seen corresponding path program 4 times [2025-04-13 18:19:45,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:19:45,287 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302350217] [2025-04-13 18:19:45,287 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:19:45,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:19:45,291 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-13 18:19:45,312 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:19:45,312 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:19:45,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:19:45,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:19:45,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:19:45,863 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302350217] [2025-04-13 18:19:45,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302350217] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:19:45,863 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270602131] [2025-04-13 18:19:45,863 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:19:45,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:19:45,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:19:45,865 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 18:19:45,866 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 18:19:45,896 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-13 18:19:45,979 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:19:45,979 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:19:45,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:19:45,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 18:19:45,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:19:55,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:19:55,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:20:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:20:05,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270602131] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:20:05,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:20:05,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2025-04-13 18:20:05,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516368811] [2025-04-13 18:20:05,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:20:05,609 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 18:20:05,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:05,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 18:20:05,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=744, Unknown=2, NotChecked=0, Total=930 [2025-04-13 18:20:05,610 INFO L87 Difference]: Start difference. First operand 524 states and 1335 transitions. Second operand has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 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 18:20:09,696 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:20:25,167 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:20:29,183 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:20:34,648 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:20:39,025 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:21:11,457 WARN L286 SmtUtils]: Spent 7.69s on a formula simplification. DAG size of input: 82 DAG size of output: 72 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:21:34,618 WARN L286 SmtUtils]: Spent 6.80s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:21:40,042 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:21:49,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:49,753 INFO L93 Difference]: Finished difference Result 1181 states and 2923 transitions. [2025-04-13 18:21:49,753 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-13 18:21:49,753 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 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 24 [2025-04-13 18:21:49,753 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:49,757 INFO L225 Difference]: With dead ends: 1181 [2025-04-13 18:21:49,757 INFO L226 Difference]: Without dead ends: 1065 [2025-04-13 18:21:49,759 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1773 ImplicationChecksByTransitivity, 84.4s TimeCoverageRelationStatistics Valid=1102, Invalid=4899, Unknown=5, NotChecked=0, Total=6006 [2025-04-13 18:21:49,760 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 460 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 76 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:49,760 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 242 Invalid, 1527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1446 Invalid, 5 Unknown, 0 Unchecked, 30.2s Time] [2025-04-13 18:21:49,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2025-04-13 18:21:49,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 604. [2025-04-13 18:21:49,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 603 states have (on average 2.5787728026533996) internal successors, (1555), 603 states have internal predecessors, (1555), 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 18:21:49,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1555 transitions. [2025-04-13 18:21:49,900 INFO L79 Accepts]: Start accepts. Automaton has 604 states and 1555 transitions. Word has length 24 [2025-04-13 18:21:49,900 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:49,900 INFO L485 AbstractCegarLoop]: Abstraction has 604 states and 1555 transitions. [2025-04-13 18:21:49,901 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 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 18:21:49,901 INFO L278 IsEmpty]: Start isEmpty. Operand 604 states and 1555 transitions. [2025-04-13 18:21:49,902 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 18:21:49,902 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:49,902 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:49,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 18:21:50,102 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:21:50,102 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:21:50,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:50,103 INFO L85 PathProgramCache]: Analyzing trace with hash 664191464, now seen corresponding path program 5 times [2025-04-13 18:21:50,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:50,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434102860] [2025-04-13 18:21:50,103 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:21:50,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:50,106 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 18:21:50,118 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:21:50,118 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:21:50,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:21:50,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:50,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434102860] [2025-04-13 18:21:50,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434102860] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:21:50,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252813675] [2025-04-13 18:21:50,902 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:21:50,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:21:50,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:21:50,904 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 18:21:50,905 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 18:21:50,929 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 18:21:50,952 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:21:50,952 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:21:50,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:50,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 18:21:50,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:21:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:21:51,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:21:52,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:21:52,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252813675] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:21:52,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:21:52,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2025-04-13 18:21:52,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386457492] [2025-04-13 18:21:52,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:21:52,544 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 18:21:52,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:52,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 18:21:52,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:21:52,544 INFO L87 Difference]: Start difference. First operand 604 states and 1555 transitions. Second operand has 27 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 states have internal predecessors, (72), 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 18:22:08,620 WARN L286 SmtUtils]: Spent 12.08s on a formula simplification. DAG size of input: 75 DAG size of output: 48 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:22:12,882 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:22:16,891 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:22:43,031 WARN L286 SmtUtils]: Spent 24.18s on a formula simplification. DAG size of input: 100 DAG size of output: 52 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:22:56,865 WARN L286 SmtUtils]: Spent 12.12s on a formula simplification. DAG size of input: 92 DAG size of output: 61 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:23:33,746 WARN L286 SmtUtils]: Spent 35.02s on a formula simplification. DAG size of input: 116 DAG size of output: 62 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:23:36,082 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:23:38,676 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:23:41,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:41,847 INFO L93 Difference]: Finished difference Result 1400 states and 3416 transitions. [2025-04-13 18:23:41,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-04-13 18:23:41,847 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 states have internal predecessors, (72), 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 24 [2025-04-13 18:23:41,847 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:41,862 INFO L225 Difference]: With dead ends: 1400 [2025-04-13 18:23:41,863 INFO L226 Difference]: Without dead ends: 1225 [2025-04-13 18:23:41,864 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2010 ImplicationChecksByTransitivity, 95.3s TimeCoverageRelationStatistics Valid=1226, Invalid=5254, Unknown=0, NotChecked=0, Total=6480 [2025-04-13 18:23:41,864 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 374 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 73 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:41,864 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 124 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1380 Invalid, 2 Unknown, 0 Unchecked, 14.5s Time] [2025-04-13 18:23:41,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-04-13 18:23:42,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 684. [2025-04-13 18:23:42,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 2.5929721815519766) internal successors, (1771), 683 states have internal predecessors, (1771), 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 18:23:42,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1771 transitions. [2025-04-13 18:23:42,047 INFO L79 Accepts]: Start accepts. Automaton has 684 states and 1771 transitions. Word has length 24 [2025-04-13 18:23:42,047 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:42,047 INFO L485 AbstractCegarLoop]: Abstraction has 684 states and 1771 transitions. [2025-04-13 18:23:42,047 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 states have internal predecessors, (72), 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 18:23:42,047 INFO L278 IsEmpty]: Start isEmpty. Operand 684 states and 1771 transitions. [2025-04-13 18:23:42,048 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:23:42,048 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:42,048 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:42,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 18:23:42,249 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-13 18:23:42,249 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:23:42,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:42,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1138229403, now seen corresponding path program 6 times [2025-04-13 18:23:42,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:42,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757837003] [2025-04-13 18:23:42,249 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:23:42,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:42,253 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 3 equivalence classes. [2025-04-13 18:23:42,265 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:23:42,266 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:23:42,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:23:50,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:50,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757837003] [2025-04-13 18:23:50,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757837003] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:50,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741866291] [2025-04-13 18:23:50,827 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:23:50,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:50,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:50,829 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:50,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 18:23:50,856 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 3 equivalence classes. [2025-04-13 18:23:50,880 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:23:50,881 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:23:50,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:50,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 18:23:50,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:59,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:23:59,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:24:02,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:24:02,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741866291] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:24:02,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:24:02,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2025-04-13 18:24:02,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734876772] [2025-04-13 18:24:02,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:24:02,644 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 18:24:02,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:02,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 18:24:02,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=629, Unknown=4, NotChecked=0, Total=756 [2025-04-13 18:24:02,645 INFO L87 Difference]: Start difference. First operand 684 states and 1771 transitions. Second operand has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 27 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:07,124 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:24:11,288 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:24:15,306 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:24:23,376 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:24:27,410 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:24:35,480 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:24:39,502 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:24:47,579 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:24:51,702 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:24:55,714 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:24:59,960 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:25:03,976 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:25:12,123 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:25:24,567 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification. DAG size of input: 67 DAG size of output: 40 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:25:28,640 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:25:32,653 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:25:37,401 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:25:49,500 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:25:53,698 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:25:57,721 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:26:09,851 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 67 DAG size of output: 37 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:26:14,399 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:26:18,417 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:26:39,864 WARN L286 SmtUtils]: Spent 16.06s on a formula simplification. DAG size of input: 45 DAG size of output: 41 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:26:45,466 WARN L286 SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 66 DAG size of output: 59 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:26:50,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:26:50,767 INFO L93 Difference]: Finished difference Result 1849 states and 4559 transitions. [2025-04-13 18:26:50,767 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-04-13 18:26:50,767 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 27 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:26:50,767 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:26:50,773 INFO L225 Difference]: With dead ends: 1849 [2025-04-13 18:26:50,774 INFO L226 Difference]: Without dead ends: 1650 [2025-04-13 18:26:50,775 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2784 ImplicationChecksByTransitivity, 99.7s TimeCoverageRelationStatistics Valid=1282, Invalid=8017, Unknown=13, NotChecked=0, Total=9312 [2025-04-13 18:26:50,776 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 589 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 1775 mSolverCounterSat, 55 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 86.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 1851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1775 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 86.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:26:50,776 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 257 Invalid, 1851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1775 Invalid, 21 Unknown, 0 Unchecked, 86.9s Time] [2025-04-13 18:26:50,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2025-04-13 18:26:51,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 870. [2025-04-13 18:26:51,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 2.655926352128884) internal successors, (2308), 869 states have internal predecessors, (2308), 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 18:26:51,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 2308 transitions. [2025-04-13 18:26:51,062 INFO L79 Accepts]: Start accepts. Automaton has 870 states and 2308 transitions. Word has length 25 [2025-04-13 18:26:51,062 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:26:51,062 INFO L485 AbstractCegarLoop]: Abstraction has 870 states and 2308 transitions. [2025-04-13 18:26:51,062 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 27 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:51,062 INFO L278 IsEmpty]: Start isEmpty. Operand 870 states and 2308 transitions. [2025-04-13 18:26:51,064 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 18:26:51,064 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:26:51,064 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:26:51,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 18:26:51,264 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:26:51,264 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:26:51,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:26:51,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1683310496, now seen corresponding path program 7 times [2025-04-13 18:26:51,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:26:51,265 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513019507] [2025-04-13 18:26:51,265 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:26:51,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:26:51,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 18:26:51,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:26:51,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:26:51,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:55,313 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:26:55,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:26:55,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513019507] [2025-04-13 18:26:55,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513019507] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:26:55,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011471570] [2025-04-13 18:26:55,314 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:26:55,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:26:55,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:26:55,316 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:26:55,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 18:26:55,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 18:26:55,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:26:55,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:26:55,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:55,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 18:26:55,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:27:04,389 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:27:04,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:27:06,536 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:27:06,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011471570] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:27:06,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:27:06,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-04-13 18:27:06,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613336154] [2025-04-13 18:27:06,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:27:06,536 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 18:27:06,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:27:06,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 18:27:06,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=558, Unknown=2, NotChecked=0, Total=702 [2025-04-13 18:27:06,537 INFO L87 Difference]: Start difference. First operand 870 states and 2308 transitions. Second operand has 27 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 26 states have internal predecessors, (75), 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 18:27:33,855 WARN L286 SmtUtils]: Spent 21.94s on a formula simplification. DAG size of input: 67 DAG size of output: 47 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:27:55,228 WARN L286 SmtUtils]: Spent 21.25s on a formula simplification. DAG size of input: 76 DAG size of output: 55 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:28:22,781 WARN L286 SmtUtils]: Spent 20.78s on a formula simplification. DAG size of input: 66 DAG size of output: 48 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:28:35,742 WARN L286 SmtUtils]: Spent 12.75s on a formula simplification. DAG size of input: 75 DAG size of output: 38 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:28:45,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:45,463 INFO L93 Difference]: Finished difference Result 1687 states and 4302 transitions. [2025-04-13 18:28:45,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 18:28:45,463 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 26 states have internal predecessors, (75), 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 27 [2025-04-13 18:28:45,463 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:45,468 INFO L225 Difference]: With dead ends: 1687 [2025-04-13 18:28:45,469 INFO L226 Difference]: Without dead ends: 1594 [2025-04-13 18:28:45,470 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 105.9s TimeCoverageRelationStatistics Valid=851, Invalid=3567, Unknown=4, NotChecked=0, Total=4422 [2025-04-13 18:28:45,470 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 338 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:45,470 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 275 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1543 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-04-13 18:28:45,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2025-04-13 18:28:45,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1064. [2025-04-13 18:28:45,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 1063 states have (on average 2.6669802445907806) internal successors, (2835), 1063 states have internal predecessors, (2835), 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 18:28:45,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 2835 transitions. [2025-04-13 18:28:45,828 INFO L79 Accepts]: Start accepts. Automaton has 1064 states and 2835 transitions. Word has length 27 [2025-04-13 18:28:45,828 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:45,828 INFO L485 AbstractCegarLoop]: Abstraction has 1064 states and 2835 transitions. [2025-04-13 18:28:45,828 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 26 states have internal predecessors, (75), 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 18:28:45,828 INFO L278 IsEmpty]: Start isEmpty. Operand 1064 states and 2835 transitions. [2025-04-13 18:28:45,830 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:28:45,830 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:45,830 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:28:45,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 18:28:46,030 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:46,030 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:28:46,031 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:46,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1098565569, now seen corresponding path program 8 times [2025-04-13 18:28:46,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:46,031 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668815309] [2025-04-13 18:28:46,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:28:46,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:46,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:28:46,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:28:46,046 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:28:46,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:46,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:46,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668815309] [2025-04-13 18:28:46,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668815309] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:28:46,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436441844] [2025-04-13 18:28:46,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:28:46,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:46,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:28:46,569 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:28:46,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 18:28:46,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:28:46,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:28:46,648 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:28:46,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:46,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 18:28:46,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:28:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:47,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:28:48,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:48,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436441844] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:28:48,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:28:48,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-04-13 18:28:48,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937138985] [2025-04-13 18:28:48,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:28:48,155 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 18:28:48,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:48,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 18:28:48,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:28:48,155 INFO L87 Difference]: Start difference. First operand 1064 states and 2835 transitions. Second operand has 27 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 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 18:29:03,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:29:03,075 INFO L93 Difference]: Finished difference Result 2368 states and 6087 transitions. [2025-04-13 18:29:03,076 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-04-13 18:29:03,076 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 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 28 [2025-04-13 18:29:03,076 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:29:03,084 INFO L225 Difference]: With dead ends: 2368 [2025-04-13 18:29:03,084 INFO L226 Difference]: Without dead ends: 2259 [2025-04-13 18:29:03,086 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3251 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=1401, Invalid=8499, Unknown=0, NotChecked=0, Total=9900 [2025-04-13 18:29:03,087 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 392 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 2048 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 2099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:29:03,087 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 292 Invalid, 2099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2048 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2025-04-13 18:29:03,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2025-04-13 18:29:03,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 1350. [2025-04-13 18:29:03,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1349 states have (on average 2.7116382505559673) internal successors, (3658), 1349 states have internal predecessors, (3658), 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 18:29:03,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 3658 transitions. [2025-04-13 18:29:03,599 INFO L79 Accepts]: Start accepts. Automaton has 1350 states and 3658 transitions. Word has length 28 [2025-04-13 18:29:03,601 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:29:03,601 INFO L485 AbstractCegarLoop]: Abstraction has 1350 states and 3658 transitions. [2025-04-13 18:29:03,601 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 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 18:29:03,601 INFO L278 IsEmpty]: Start isEmpty. Operand 1350 states and 3658 transitions. [2025-04-13 18:29:03,603 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:29:03,603 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:29:03,603 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:29:03,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 18:29:03,803 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 18:29:03,803 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:29:03,804 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:29:03,804 INFO L85 PathProgramCache]: Analyzing trace with hash -795442561, now seen corresponding path program 9 times [2025-04-13 18:29:03,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:29:03,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167301093] [2025-04-13 18:29:03,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:29:03,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:29:03,806 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:29:03,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:29:03,816 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:29:03,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:29:04,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:29:04,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:29:04,361 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167301093] [2025-04-13 18:29:04,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167301093] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:29:04,361 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863809801] [2025-04-13 18:29:04,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:29:04,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:29:04,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:29:04,363 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:29:04,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 18:29:04,390 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:29:04,475 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:29:04,476 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:29:04,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:29:04,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 18:29:04,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:29:05,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:29:05,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:29:06,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:29:06,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863809801] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:29:06,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:29:06,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2025-04-13 18:29:06,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497175512] [2025-04-13 18:29:06,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:29:06,028 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 18:29:06,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:29:06,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 18:29:06,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:29:06,029 INFO L87 Difference]: Start difference. First operand 1350 states and 3658 transitions. Second operand has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 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 18:29:19,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:29:19,924 INFO L93 Difference]: Finished difference Result 2526 states and 6558 transitions. [2025-04-13 18:29:19,924 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-04-13 18:29:19,925 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 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 28 [2025-04-13 18:29:19,925 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:29:19,933 INFO L225 Difference]: With dead ends: 2526 [2025-04-13 18:29:19,933 INFO L226 Difference]: Without dead ends: 2356 [2025-04-13 18:29:19,934 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1932 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=1283, Invalid=5359, Unknown=0, NotChecked=0, Total=6642 [2025-04-13 18:29:19,935 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 460 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 1630 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 1704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:29:19,935 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 242 Invalid, 1704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1630 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-04-13 18:29:19,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2025-04-13 18:29:20,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 1506. [2025-04-13 18:29:20,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 2.7282392026578073) internal successors, (4106), 1505 states have internal predecessors, (4106), 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 18:29:20,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 4106 transitions. [2025-04-13 18:29:20,529 INFO L79 Accepts]: Start accepts. Automaton has 1506 states and 4106 transitions. Word has length 28 [2025-04-13 18:29:20,529 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:29:20,529 INFO L485 AbstractCegarLoop]: Abstraction has 1506 states and 4106 transitions. [2025-04-13 18:29:20,529 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 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 18:29:20,529 INFO L278 IsEmpty]: Start isEmpty. Operand 1506 states and 4106 transitions. [2025-04-13 18:29:20,532 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:29:20,532 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:29:20,532 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:29:20,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 18:29:20,732 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 18:29:20,732 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:29:20,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:29:20,733 INFO L85 PathProgramCache]: Analyzing trace with hash 414948186, now seen corresponding path program 10 times [2025-04-13 18:29:20,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:29:20,733 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140870984] [2025-04-13 18:29:20,733 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:29:20,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:29:20,735 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:29:20,743 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:29:20,744 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:29:20,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:29:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:29:21,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:29:21,611 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140870984] [2025-04-13 18:29:21,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140870984] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:29:21,611 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720419294] [2025-04-13 18:29:21,611 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:29:21,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:29:21,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:29:21,613 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:29:21,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 18:29:21,638 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:29:21,666 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:29:21,667 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:29:21,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:29:21,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 18:29:21,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:29:22,512 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:29:22,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:29:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:29:23,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720419294] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:29:23,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:29:23,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 37 [2025-04-13 18:29:23,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346098281] [2025-04-13 18:29:23,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:29:23,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 18:29:23,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:29:23,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 18:29:23,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1251, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:29:23,668 INFO L87 Difference]: Start difference. First operand 1506 states and 4106 transitions. Second operand has 39 states, 38 states have (on average 2.289473684210526) internal successors, (87), 38 states have internal predecessors, (87), 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) Received shutdown request... [2025-04-13 18:29:49,662 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 18:29:49,671 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 18:29:49,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2025-04-13 18:29:49,797 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6100 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=2546, Invalid=14224, Unknown=0, NotChecked=0, Total=16770 [2025-04-13 18:29:49,798 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 516 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 2773 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 2880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:29:49,798 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 323 Invalid, 2880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2773 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-04-13 18:29:49,799 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 18:29:49,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 18:29:50,000 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 18:29:50,000 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (1506states) and FLOYD_HOARE automaton (currently 107 states, 39 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-6-2-3-3-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2025-04-13 18:29:50,001 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 18:29:50,002 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 18:29:50,004 INFO L422 BasicCegarLoop]: Path program histogram: [10, 4, 1, 1] [2025-04-13 18:29:50,006 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 18:29:50,006 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 18:29:50,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 06:29:50 BasicIcfg [2025-04-13 18:29:50,008 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 18:29:50,008 INFO L158 Benchmark]: Toolchain (without parser) took 871660.96ms. Allocated memory was 155.2MB in the beginning and 566.2MB in the end (delta: 411.0MB). Free memory was 110.2MB in the beginning and 435.2MB in the end (delta: -325.0MB). Peak memory consumption was 82.5MB. Max. memory is 8.0GB. [2025-04-13 18:29:50,008 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:29:50,009 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.49ms. Allocated memory is still 155.2MB. Free memory was 110.2MB in the beginning and 95.6MB in the end (delta: 14.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 18:29:50,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.43ms. Allocated memory is still 155.2MB. Free memory was 95.6MB in the beginning and 94.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:29:50,009 INFO L158 Benchmark]: Boogie Preprocessor took 49.61ms. Allocated memory is still 155.2MB. Free memory was 94.4MB in the beginning and 92.7MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:29:50,009 INFO L158 Benchmark]: RCFGBuilder took 409.26ms. Allocated memory is still 155.2MB. Free memory was 92.7MB in the beginning and 66.4MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 18:29:50,009 INFO L158 Benchmark]: TraceAbstraction took 870930.84ms. Allocated memory was 155.2MB in the beginning and 566.2MB in the end (delta: 411.0MB). Free memory was 65.8MB in the beginning and 435.2MB in the end (delta: -369.5MB). Peak memory consumption was 40.5MB. Max. memory is 8.0GB. [2025-04-13 18:29:50,011 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.14ms. Allocated memory is still 155.2MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 224.49ms. Allocated memory is still 155.2MB. Free memory was 110.2MB in the beginning and 95.6MB in the end (delta: 14.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.43ms. Allocated memory is still 155.2MB. Free memory was 95.6MB in the beginning and 94.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 49.61ms. Allocated memory is still 155.2MB. Free memory was 94.4MB in the beginning and 92.7MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 409.26ms. Allocated memory is still 155.2MB. Free memory was 92.7MB in the beginning and 66.4MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 870930.84ms. Allocated memory was 155.2MB in the beginning and 566.2MB in the end (delta: 411.0MB). Free memory was 65.8MB in the beginning and 435.2MB in the end (delta: -369.5MB). Peak memory consumption was 40.5MB. 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 - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (1506states) and FLOYD_HOARE automaton (currently 107 states, 39 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-6-2-3-3-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (1506states) and FLOYD_HOARE automaton (currently 107 states, 39 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-6-2-3-3-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (1506states) and FLOYD_HOARE automaton (currently 107 states, 39 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-6-2-3-3-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 38 locations, 41 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 870.8s, OverallIterations: 16, TraceHistogramMax: 3, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 727.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 34 mSolverCounterUnknown, 4523 SdHoareTripleChecker+Valid, 194.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4523 mSDsluCounter, 2390 SdHoareTripleChecker+Invalid, 192.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2191 mSDsCounter, 608 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16332 IncrementalHoareTripleChecker+Invalid, 16974 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 608 mSolverCounterUnsat, 199 mSDtfsCounter, 16332 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1173 GetRequests, 341 SyntacticMatches, 6 SemanticMatches, 825 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22356 ImplicationChecksByTransitivity, 638.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1506occurred in iteration=15, InterpolantAutomatonStates: 635, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 5600 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 137.1s InterpolantComputationTime, 620 NumberOfCodeBlocks, 612 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 835 ConstructedInterpolants, 0 QuantifiedInterpolants, 25639 SizeOfPredicates, 68 NumberOfNonLiveVariables, 1073 ConjunctsInSsa, 217 ConjunctsInUnsatCore, 36 InterpolantComputations, 6 PerfectInterpolantSequences, 12/142 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 could not prove your program: Timeout Completed graceful shutdown