/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-threaded-sum-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:46:06,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:46:06,325 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:46:06,329 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:46:06,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:46:06,350 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:46:06,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:46:06,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:46:06,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:46:06,350 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:46:06,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:46:06,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:46:06,351 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:46:06,351 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:46:06,351 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:46:06,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:46:06,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:46:06,351 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:46:06,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:46:06,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:46:06,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:46:06,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:46:06,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:46:06,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:46:06,353 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:46:06,353 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:46:06,353 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:46:06,353 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:46:06,353 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:46:06,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:46:06,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:46:06,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:46:06,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:46:06,353 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:46:06,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:46:06,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:46:06,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:46:06,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:46:06,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:46:06,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:46:06,354 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:46:06,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:46:06,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:46:06,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:46:06,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:46:06,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:46:06,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:46:06,354 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:46:06,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:46:06,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:46:06,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:46:06,551 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:46:06,551 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:46:06,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-threaded-sum-3.wvr.c [2025-04-13 18:46:07,823 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31b5c5124/a43a59a41535469e9fbf7860de4eea8b/FLAG5d0c6ecce [2025-04-13 18:46:08,008 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:46:08,014 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-threaded-sum-3.wvr.c [2025-04-13 18:46:08,023 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31b5c5124/a43a59a41535469e9fbf7860de4eea8b/FLAG5d0c6ecce [2025-04-13 18:46:08,873 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31b5c5124/a43a59a41535469e9fbf7860de4eea8b [2025-04-13 18:46:08,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:46:08,877 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:46:08,878 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:46:08,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:46:08,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:46:08,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:46:08" (1/1) ... [2025-04-13 18:46:08,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6772a897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:08, skipping insertion in model container [2025-04-13 18:46:08,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:46:08" (1/1) ... [2025-04-13 18:46:08,893 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:46:09,066 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-threaded-sum-3.wvr.c[2996,3009] [2025-04-13 18:46:09,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:46:09,082 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:46:09,118 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-threaded-sum-3.wvr.c[2996,3009] [2025-04-13 18:46:09,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:46:09,132 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:46:09,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:09 WrapperNode [2025-04-13 18:46:09,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:46:09,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:46:09,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:46:09,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:46:09,140 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:46:09" (1/1) ... [2025-04-13 18:46:09,147 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:46:09" (1/1) ... [2025-04-13 18:46:09,162 INFO L138 Inliner]: procedures = 21, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2025-04-13 18:46:09,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:46:09,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:46:09,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:46:09,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:46:09,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:09" (1/1) ... [2025-04-13 18:46:09,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:09" (1/1) ... [2025-04-13 18:46:09,171 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:09" (1/1) ... [2025-04-13 18:46:09,182 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:46:09,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:09" (1/1) ... [2025-04-13 18:46:09,182 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:09" (1/1) ... [2025-04-13 18:46:09,185 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:09" (1/1) ... [2025-04-13 18:46:09,185 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:09" (1/1) ... [2025-04-13 18:46:09,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:09" (1/1) ... [2025-04-13 18:46:09,188 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:09" (1/1) ... [2025-04-13 18:46:09,188 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:09" (1/1) ... [2025-04-13 18:46:09,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:46:09,191 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:46:09,191 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:46:09,191 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:46:09,192 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:09" (1/1) ... [2025-04-13 18:46:09,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:46:09,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:46:09,216 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:46:09,217 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:46:09,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:46:09,233 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:46:09,233 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:46:09,233 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:46:09,233 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:46:09,233 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:46:09,233 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:46:09,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:46:09,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 18:46:09,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 18:46:09,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:46:09,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:46:09,234 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:46:09,299 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:46:09,301 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:46:09,442 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:46:09,442 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:46:09,442 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:46:09,601 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:46:09,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:46:09 BoogieIcfgContainer [2025-04-13 18:46:09,602 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:46:09,604 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:46:09,604 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:46:09,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:46:09,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:46:08" (1/3) ... [2025-04-13 18:46:09,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11be1715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:46:09, skipping insertion in model container [2025-04-13 18:46:09,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:09" (2/3) ... [2025-04-13 18:46:09,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11be1715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:46:09, skipping insertion in model container [2025-04-13 18:46:09,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:46:09" (3/3) ... [2025-04-13 18:46:09,610 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-threaded-sum-3.wvr.c [2025-04-13 18:46:09,619 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:46:09,620 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-threaded-sum-3.wvr.c that has 4 procedures, 32 locations, 31 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 18:46:09,621 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:46:09,661 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 18:46:09,684 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 34 transitions, 89 flow [2025-04-13 18:46:09,736 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 641 states, 640 states have (on average 3.35625) internal successors, (2148), 640 states have internal predecessors, (2148), 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:46:09,756 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:46:09,765 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;@30d41a3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:46:09,765 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 18:46:09,770 INFO L278 IsEmpty]: Start isEmpty. Operand has 641 states, 640 states have (on average 3.35625) internal successors, (2148), 640 states have internal predecessors, (2148), 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:46:09,784 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:46:09,786 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:09,787 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] [2025-04-13 18:46:09,787 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:46:09,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:09,792 INFO L85 PathProgramCache]: Analyzing trace with hash 381576312, now seen corresponding path program 1 times [2025-04-13 18:46:09,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:09,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389078927] [2025-04-13 18:46:09,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:46:09,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:09,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 18:46:09,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:46:09,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:46:09,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:10,308 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:46:10,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:10,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389078927] [2025-04-13 18:46:10,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389078927] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:46:10,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:46:10,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:46:10,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611502731] [2025-04-13 18:46:10,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:46:10,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:46:10,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:46:10,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:46:10,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:46:10,333 INFO L87 Difference]: Start difference. First operand has 641 states, 640 states have (on average 3.35625) internal successors, (2148), 640 states have internal predecessors, (2148), 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 5.0) internal successors, (20), 3 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:46:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:46:10,557 INFO L93 Difference]: Finished difference Result 1276 states and 4334 transitions. [2025-04-13 18:46:10,558 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:46:10,559 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 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 20 [2025-04-13 18:46:10,559 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:46:10,582 INFO L225 Difference]: With dead ends: 1276 [2025-04-13 18:46:10,583 INFO L226 Difference]: Without dead ends: 1127 [2025-04-13 18:46:10,587 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:46:10,589 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 52 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:46:10,589 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 28 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:46:10,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2025-04-13 18:46:10,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 835. [2025-04-13 18:46:10,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 834 states have (on average 3.371702637889688) internal successors, (2812), 834 states have internal predecessors, (2812), 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:46:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 2812 transitions. [2025-04-13 18:46:10,694 INFO L79 Accepts]: Start accepts. Automaton has 835 states and 2812 transitions. Word has length 20 [2025-04-13 18:46:10,694 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:46:10,695 INFO L485 AbstractCegarLoop]: Abstraction has 835 states and 2812 transitions. [2025-04-13 18:46:10,695 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 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:46:10,695 INFO L278 IsEmpty]: Start isEmpty. Operand 835 states and 2812 transitions. [2025-04-13 18:46:10,699 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 18:46:10,700 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:10,700 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:46:10,700 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:46:10,700 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:46:10,700 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:10,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1635420994, now seen corresponding path program 1 times [2025-04-13 18:46:10,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:10,700 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306486327] [2025-04-13 18:46:10,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:46:10,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:10,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 18:46:10,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 18:46:10,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:46:10,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:10,948 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:46:10,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:10,948 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306486327] [2025-04-13 18:46:10,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306486327] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:46:10,948 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878111925] [2025-04-13 18:46:10,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:46:10,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:46:10,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:46:10,952 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:46:10,954 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:46:10,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 18:46:11,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 18:46:11,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:46:11,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:11,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 18:46:11,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:46:11,106 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:46:11,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:46:11,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:46:11,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878111925] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:46:11,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:46:11,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 4] total 8 [2025-04-13 18:46:11,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558731755] [2025-04-13 18:46:11,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:46:11,226 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:46:11,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:46:11,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:46:11,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:46:11,227 INFO L87 Difference]: Start difference. First operand 835 states and 2812 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:11,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:46:11,438 INFO L93 Difference]: Finished difference Result 1274 states and 4238 transitions. [2025-04-13 18:46:11,438 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:46:11,438 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 18:46:11,438 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:46:11,447 INFO L225 Difference]: With dead ends: 1274 [2025-04-13 18:46:11,447 INFO L226 Difference]: Without dead ends: 1169 [2025-04-13 18:46:11,447 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:46:11,448 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 70 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:46:11,448 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 27 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:46:11,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2025-04-13 18:46:11,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 898. [2025-04-13 18:46:11,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 897 states have (on average 3.3756967670011147) internal successors, (3028), 897 states have internal predecessors, (3028), 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:46:11,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 3028 transitions. [2025-04-13 18:46:11,512 INFO L79 Accepts]: Start accepts. Automaton has 898 states and 3028 transitions. Word has length 23 [2025-04-13 18:46:11,513 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:46:11,513 INFO L485 AbstractCegarLoop]: Abstraction has 898 states and 3028 transitions. [2025-04-13 18:46:11,513 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:11,514 INFO L278 IsEmpty]: Start isEmpty. Operand 898 states and 3028 transitions. [2025-04-13 18:46:11,516 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 18:46:11,516 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:11,516 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:46:11,524 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:46:11,722 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:46:11,722 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:46:11,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:11,723 INFO L85 PathProgramCache]: Analyzing trace with hash -941126539, now seen corresponding path program 1 times [2025-04-13 18:46:11,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:11,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363225818] [2025-04-13 18:46:11,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:46:11,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:11,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 18:46:11,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:46:11,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:46:11,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:11,880 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:46:11,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:11,880 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363225818] [2025-04-13 18:46:11,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363225818] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:46:11,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:46:11,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:46:11,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665952481] [2025-04-13 18:46:11,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:46:11,881 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:46:11,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:46:11,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:46:11,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:46:11,881 INFO L87 Difference]: Start difference. First operand 898 states and 3028 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:46:12,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:46:12,191 INFO L93 Difference]: Finished difference Result 1175 states and 3970 transitions. [2025-04-13 18:46:12,191 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:46:12,191 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:46:12,191 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:46:12,198 INFO L225 Difference]: With dead ends: 1175 [2025-04-13 18:46:12,198 INFO L226 Difference]: Without dead ends: 1007 [2025-04-13 18:46:12,199 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:46:12,199 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 87 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:46:12,199 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 39 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:46:12,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2025-04-13 18:46:12,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 709. [2025-04-13 18:46:12,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 708 states have (on average 3.3954802259887007) internal successors, (2404), 708 states have internal predecessors, (2404), 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:46:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 2404 transitions. [2025-04-13 18:46:12,274 INFO L79 Accepts]: Start accepts. Automaton has 709 states and 2404 transitions. Word has length 24 [2025-04-13 18:46:12,274 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:46:12,274 INFO L485 AbstractCegarLoop]: Abstraction has 709 states and 2404 transitions. [2025-04-13 18:46:12,274 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:46:12,274 INFO L278 IsEmpty]: Start isEmpty. Operand 709 states and 2404 transitions. [2025-04-13 18:46:12,276 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 18:46:12,276 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:12,276 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:46:12,277 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:46:12,277 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:46:12,277 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:12,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1514629653, now seen corresponding path program 2 times [2025-04-13 18:46:12,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:12,277 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110169408] [2025-04-13 18:46:12,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:46:12,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:12,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-04-13 18:46:12,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:46:12,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:46:12,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:12,560 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:46:12,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:12,561 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110169408] [2025-04-13 18:46:12,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110169408] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:46:12,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:46:12,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:46:12,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195388665] [2025-04-13 18:46:12,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:46:12,561 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:46:12,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:46:12,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:46:12,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:46:12,562 INFO L87 Difference]: Start difference. First operand 709 states and 2404 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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:46:12,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:46:12,856 INFO L93 Difference]: Finished difference Result 1500 states and 5026 transitions. [2025-04-13 18:46:12,857 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:46:12,857 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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:46:12,857 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:46:12,865 INFO L225 Difference]: With dead ends: 1500 [2025-04-13 18:46:12,865 INFO L226 Difference]: Without dead ends: 1418 [2025-04-13 18:46:12,865 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:46:12,866 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 75 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:46:12,866 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 52 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:46:12,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2025-04-13 18:46:12,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 824. [2025-04-13 18:46:12,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 823 states have (on average 3.4726609963547994) internal successors, (2858), 823 states have internal predecessors, (2858), 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:46:12,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2858 transitions. [2025-04-13 18:46:12,935 INFO L79 Accepts]: Start accepts. Automaton has 824 states and 2858 transitions. Word has length 24 [2025-04-13 18:46:12,935 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:46:12,935 INFO L485 AbstractCegarLoop]: Abstraction has 824 states and 2858 transitions. [2025-04-13 18:46:12,936 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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:46:12,936 INFO L278 IsEmpty]: Start isEmpty. Operand 824 states and 2858 transitions. [2025-04-13 18:46:12,938 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 18:46:12,938 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:12,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:46:12,938 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 18:46:12,938 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:46:12,939 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:12,939 INFO L85 PathProgramCache]: Analyzing trace with hash 652712459, now seen corresponding path program 3 times [2025-04-13 18:46:12,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:12,939 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935011592] [2025-04-13 18:46:12,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:46:12,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:12,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 1 equivalence classes. [2025-04-13 18:46:12,953 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:46:12,953 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:46:12,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:13,103 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:46:13,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:13,103 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935011592] [2025-04-13 18:46:13,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935011592] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:46:13,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:46:13,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:46:13,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783631968] [2025-04-13 18:46:13,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:46:13,103 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:46:13,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:46:13,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:46:13,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:46:13,104 INFO L87 Difference]: Start difference. First operand 824 states and 2858 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:46:13,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:46:13,253 INFO L93 Difference]: Finished difference Result 1086 states and 3690 transitions. [2025-04-13 18:46:13,254 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:46:13,254 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:46:13,254 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:46:13,260 INFO L225 Difference]: With dead ends: 1086 [2025-04-13 18:46:13,260 INFO L226 Difference]: Without dead ends: 964 [2025-04-13 18:46:13,260 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:46:13,261 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:46:13,261 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 26 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:46:13,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2025-04-13 18:46:13,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 904. [2025-04-13 18:46:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 903 states have (on average 3.4695459579180508) internal successors, (3133), 903 states have internal predecessors, (3133), 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:46:13,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 3133 transitions. [2025-04-13 18:46:13,341 INFO L79 Accepts]: Start accepts. Automaton has 904 states and 3133 transitions. Word has length 24 [2025-04-13 18:46:13,341 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:46:13,341 INFO L485 AbstractCegarLoop]: Abstraction has 904 states and 3133 transitions. [2025-04-13 18:46:13,342 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:46:13,342 INFO L278 IsEmpty]: Start isEmpty. Operand 904 states and 3133 transitions. [2025-04-13 18:46:13,343 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 18:46:13,344 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:13,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:46:13,344 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 18:46:13,344 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:46:13,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:13,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1251531995, now seen corresponding path program 4 times [2025-04-13 18:46:13,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:13,344 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770802779] [2025-04-13 18:46:13,344 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:46:13,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:13,348 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-13 18:46:13,355 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:46:13,356 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:46:13,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:13,483 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:46:13,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:13,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770802779] [2025-04-13 18:46:13,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770802779] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:46:13,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:46:13,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:46:13,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168942077] [2025-04-13 18:46:13,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:46:13,484 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:46:13,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:46:13,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:46:13,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:46:13,484 INFO L87 Difference]: Start difference. First operand 904 states and 3133 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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:46:13,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:46:13,781 INFO L93 Difference]: Finished difference Result 1774 states and 6226 transitions. [2025-04-13 18:46:13,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:46:13,782 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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:46:13,782 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:46:13,791 INFO L225 Difference]: With dead ends: 1774 [2025-04-13 18:46:13,791 INFO L226 Difference]: Without dead ends: 1656 [2025-04-13 18:46:13,792 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:46:13,792 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 42 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:46:13,792 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 46 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:46:13,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2025-04-13 18:46:13,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1008. [2025-04-13 18:46:13,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 1007 states have (on average 3.4826216484607744) internal successors, (3507), 1007 states have internal predecessors, (3507), 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:46:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 3507 transitions. [2025-04-13 18:46:13,881 INFO L79 Accepts]: Start accepts. Automaton has 1008 states and 3507 transitions. Word has length 24 [2025-04-13 18:46:13,881 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:46:13,881 INFO L485 AbstractCegarLoop]: Abstraction has 1008 states and 3507 transitions. [2025-04-13 18:46:13,881 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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:46:13,881 INFO L278 IsEmpty]: Start isEmpty. Operand 1008 states and 3507 transitions. [2025-04-13 18:46:13,884 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 18:46:13,884 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:13,884 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:46:13,884 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 18:46:13,884 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:46:13,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:13,884 INFO L85 PathProgramCache]: Analyzing trace with hash 513721821, now seen corresponding path program 1 times [2025-04-13 18:46:13,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:13,884 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90514818] [2025-04-13 18:46:13,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:46:13,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:13,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 18:46:13,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:46:13,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:46:13,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:15,917 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:46:15,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:15,918 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90514818] [2025-04-13 18:46:15,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90514818] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:46:15,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:46:15,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:46:15,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533746327] [2025-04-13 18:46:15,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:46:15,918 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:46:15,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:46:15,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:46:15,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:46:15,919 INFO L87 Difference]: Start difference. First operand 1008 states and 3507 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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:46:18,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:46:18,667 INFO L93 Difference]: Finished difference Result 2476 states and 8481 transitions. [2025-04-13 18:46:18,668 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:46:18,668 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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:46:18,668 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:46:18,680 INFO L225 Difference]: With dead ends: 2476 [2025-04-13 18:46:18,681 INFO L226 Difference]: Without dead ends: 2416 [2025-04-13 18:46:18,681 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:46:18,682 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 215 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:46:18,682 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 156 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:46:18,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2025-04-13 18:46:18,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 1130. [2025-04-13 18:46:18,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1129 states have (on average 3.4676705048715677) internal successors, (3915), 1129 states have internal predecessors, (3915), 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:46:18,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 3915 transitions. [2025-04-13 18:46:18,998 INFO L79 Accepts]: Start accepts. Automaton has 1130 states and 3915 transitions. Word has length 27 [2025-04-13 18:46:18,999 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:46:18,999 INFO L485 AbstractCegarLoop]: Abstraction has 1130 states and 3915 transitions. [2025-04-13 18:46:18,999 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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:46:18,999 INFO L278 IsEmpty]: Start isEmpty. Operand 1130 states and 3915 transitions. [2025-04-13 18:46:19,001 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 18:46:19,001 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:19,001 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:46:19,001 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 18:46:19,001 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:46:19,002 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:19,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1260524443, now seen corresponding path program 2 times [2025-04-13 18:46:19,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:19,002 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957172358] [2025-04-13 18:46:19,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:46:19,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:19,005 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 18:46:19,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:46:19,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:46:19,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:20,546 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:46:20,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:20,546 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957172358] [2025-04-13 18:46:20,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957172358] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:46:20,546 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029058316] [2025-04-13 18:46:20,546 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:46:20,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:46:20,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:46:20,549 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:46:20,550 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:46:20,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 18:46:20,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:46:20,610 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:46:20,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:20,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-13 18:46:20,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:46:21,181 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:46:21,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:46:21,914 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:46:21,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029058316] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:46:21,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:46:21,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2025-04-13 18:46:21,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962712707] [2025-04-13 18:46:21,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:46:21,915 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 18:46:21,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:46:21,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 18:46:21,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:46:21,915 INFO L87 Difference]: Start difference. First operand 1130 states and 3915 transitions. Second operand has 22 states, 21 states have (on average 3.857142857142857) internal successors, (81), 21 states have internal predecessors, (81), 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:46:46,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:46:46,384 INFO L93 Difference]: Finished difference Result 9397 states and 33362 transitions. [2025-04-13 18:46:46,384 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2025-04-13 18:46:46,385 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.857142857142857) internal successors, (81), 21 states have internal predecessors, (81), 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:46:46,385 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:46:46,421 INFO L225 Difference]: With dead ends: 9397 [2025-04-13 18:46:46,421 INFO L226 Difference]: Without dead ends: 8435 [2025-04-13 18:46:46,427 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7005 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=2976, Invalid=15384, Unknown=0, NotChecked=0, Total=18360 [2025-04-13 18:46:46,427 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 1015 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 3233 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 3325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 3233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:46:46,427 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 587 Invalid, 3325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 3233 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-04-13 18:46:46,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8435 states. [2025-04-13 18:46:47,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8435 to 2194. [2025-04-13 18:46:47,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2194 states, 2193 states have (on average 3.5722754217966255) internal successors, (7834), 2193 states have internal predecessors, (7834), 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:46:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2194 states to 2194 states and 7834 transitions. [2025-04-13 18:46:47,464 INFO L79 Accepts]: Start accepts. Automaton has 2194 states and 7834 transitions. Word has length 27 [2025-04-13 18:46:47,464 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:46:47,464 INFO L485 AbstractCegarLoop]: Abstraction has 2194 states and 7834 transitions. [2025-04-13 18:46:47,464 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.857142857142857) internal successors, (81), 21 states have internal predecessors, (81), 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:46:47,464 INFO L278 IsEmpty]: Start isEmpty. Operand 2194 states and 7834 transitions. [2025-04-13 18:46:47,468 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 18:46:47,469 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:47,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:46:47,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 18:46:47,673 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:46:47,673 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:46:47,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:47,673 INFO L85 PathProgramCache]: Analyzing trace with hash -249191015, now seen corresponding path program 3 times [2025-04-13 18:46:47,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:47,673 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442366111] [2025-04-13 18:46:47,673 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:46:47,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:47,677 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 1 equivalence classes. [2025-04-13 18:46:47,702 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:46:47,703 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:46:47,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:49,310 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:46:49,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:49,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442366111] [2025-04-13 18:46:49,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442366111] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:46:49,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:46:49,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:46:49,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119131092] [2025-04-13 18:46:49,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:46:49,311 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:46:49,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:46:49,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:46:49,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:46:49,311 INFO L87 Difference]: Start difference. First operand 2194 states and 7834 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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:46:52,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:46:52,095 INFO L93 Difference]: Finished difference Result 3458 states and 12360 transitions. [2025-04-13 18:46:52,095 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:46:52,095 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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:46:52,095 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:46:52,106 INFO L225 Difference]: With dead ends: 3458 [2025-04-13 18:46:52,106 INFO L226 Difference]: Without dead ends: 3238 [2025-04-13 18:46:52,107 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:46:52,108 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 120 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:46:52,108 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 121 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:46:52,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3238 states. [2025-04-13 18:46:53,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3238 to 2378. [2025-04-13 18:46:53,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2378 states, 2377 states have (on average 3.5868742111905765) internal successors, (8526), 2377 states have internal predecessors, (8526), 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:46:53,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 8526 transitions. [2025-04-13 18:46:53,244 INFO L79 Accepts]: Start accepts. Automaton has 2378 states and 8526 transitions. Word has length 27 [2025-04-13 18:46:53,244 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:46:53,244 INFO L485 AbstractCegarLoop]: Abstraction has 2378 states and 8526 transitions. [2025-04-13 18:46:53,245 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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:46:53,245 INFO L278 IsEmpty]: Start isEmpty. Operand 2378 states and 8526 transitions. [2025-04-13 18:46:53,249 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 18:46:53,249 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:53,249 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:46:53,249 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 18:46:53,249 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:46:53,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:53,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1286313683, now seen corresponding path program 4 times [2025-04-13 18:46:53,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:53,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066338222] [2025-04-13 18:46:53,250 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:46:53,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:53,253 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 18:46:53,265 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:46:53,265 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:46:53,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:54,387 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:46:54,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:54,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066338222] [2025-04-13 18:46:54,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066338222] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:46:54,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:46:54,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:46:54,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497454141] [2025-04-13 18:46:54,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:46:54,388 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:46:54,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:46:54,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:46:54,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:46:54,389 INFO L87 Difference]: Start difference. First operand 2378 states and 8526 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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:46:57,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:46:57,381 INFO L93 Difference]: Finished difference Result 3372 states and 12145 transitions. [2025-04-13 18:46:57,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:46:57,382 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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:46:57,382 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:46:57,391 INFO L225 Difference]: With dead ends: 3372 [2025-04-13 18:46:57,391 INFO L226 Difference]: Without dead ends: 3254 [2025-04-13 18:46:57,392 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:46:57,393 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 73 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:46:57,393 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 127 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:46:57,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2025-04-13 18:46:58,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 2378. [2025-04-13 18:46:58,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2378 states, 2377 states have (on average 3.5868742111905765) internal successors, (8526), 2377 states have internal predecessors, (8526), 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:46:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 8526 transitions. [2025-04-13 18:46:58,586 INFO L79 Accepts]: Start accepts. Automaton has 2378 states and 8526 transitions. Word has length 27 [2025-04-13 18:46:58,586 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:46:58,586 INFO L485 AbstractCegarLoop]: Abstraction has 2378 states and 8526 transitions. [2025-04-13 18:46:58,587 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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:46:58,587 INFO L278 IsEmpty]: Start isEmpty. Operand 2378 states and 8526 transitions. [2025-04-13 18:46:58,591 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 18:46:58,591 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:58,591 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:46:58,591 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 18:46:58,591 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:46:58,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:58,592 INFO L85 PathProgramCache]: Analyzing trace with hash 785505337, now seen corresponding path program 1 times [2025-04-13 18:46:58,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:58,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135149871] [2025-04-13 18:46:58,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:46:58,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:58,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 18:46:58,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:46:58,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:46:58,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:58,784 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:46:58,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:58,785 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135149871] [2025-04-13 18:46:58,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135149871] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:46:58,785 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395084869] [2025-04-13 18:46:58,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:46:58,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:46:58,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:46:58,787 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:46:58,788 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:46:58,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 18:46:58,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:46:58,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:46:58,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:58,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 18:46:58,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:46:59,042 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:46:59,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:46:59,387 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:46:59,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395084869] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:46:59,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:46:59,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 17 [2025-04-13 18:46:59,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936061233] [2025-04-13 18:46:59,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:46:59,388 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:46:59,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:46:59,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:46:59,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:46:59,389 INFO L87 Difference]: Start difference. First operand 2378 states and 8526 transitions. Second operand has 18 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 17 states have internal predecessors, (71), 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:47:05,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:47:05,724 INFO L93 Difference]: Finished difference Result 6497 states and 22938 transitions. [2025-04-13 18:47:05,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-13 18:47:05,724 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 17 states have internal predecessors, (71), 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:47:05,724 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:47:05,739 INFO L225 Difference]: With dead ends: 6497 [2025-04-13 18:47:05,740 INFO L226 Difference]: Without dead ends: 6309 [2025-04-13 18:47:05,745 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=543, Invalid=2537, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 18:47:05,745 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 376 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:47:05,745 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 494 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1388 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:47:05,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6309 states. [2025-04-13 18:47:07,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6309 to 2662. [2025-04-13 18:47:07,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2662 states, 2661 states have (on average 3.6181886508831265) internal successors, (9628), 2661 states have internal predecessors, (9628), 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:47:07,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 9628 transitions. [2025-04-13 18:47:07,233 INFO L79 Accepts]: Start accepts. Automaton has 2662 states and 9628 transitions. Word has length 27 [2025-04-13 18:47:07,233 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:47:07,233 INFO L485 AbstractCegarLoop]: Abstraction has 2662 states and 9628 transitions. [2025-04-13 18:47:07,234 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 17 states have internal predecessors, (71), 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:47:07,234 INFO L278 IsEmpty]: Start isEmpty. Operand 2662 states and 9628 transitions. [2025-04-13 18:47:07,238 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:47:07,238 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:47:07,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:47:07,246 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:47:07,442 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:47:07,442 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:47:07,442 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:47:07,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1852471969, now seen corresponding path program 1 times [2025-04-13 18:47:07,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:47:07,442 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975978162] [2025-04-13 18:47:07,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:47:07,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:47:07,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 18:47:07,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:47:07,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:47:07,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:47:08,395 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:47:08,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:47:08,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975978162] [2025-04-13 18:47:08,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975978162] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:47:08,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048392945] [2025-04-13 18:47:08,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:47:08,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:47:08,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:47:08,398 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:47:08,399 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:47:08,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 18:47:08,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:47:08,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:47:08,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:47:08,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 18:47:08,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:47:09,053 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:47:09,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:47:09,939 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:47:09,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048392945] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:47:09,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:47:09,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 27 [2025-04-13 18:47:09,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810772623] [2025-04-13 18:47:09,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:47:09,940 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 18:47:09,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:47:09,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 18:47:09,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:47:09,941 INFO L87 Difference]: Start difference. First operand 2662 states and 9628 transitions. Second operand has 29 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:47:30,046 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:47:35,119 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:47:39,148 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:47:47,911 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:47:52,734 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:47:56,740 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:48:00,780 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:48:04,844 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:48:10,059 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:48:23,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:48:27,444 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:48:38,523 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:48:42,650 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:48:56,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:48:56,817 INFO L93 Difference]: Finished difference Result 14572 states and 51416 transitions. [2025-04-13 18:48:56,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2025-04-13 18:48:56,817 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 18:48:56,818 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:48:56,853 INFO L225 Difference]: With dead ends: 14572 [2025-04-13 18:48:56,854 INFO L226 Difference]: Without dead ends: 12896 [2025-04-13 18:48:56,866 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21777 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=7517, Invalid=46075, Unknown=0, NotChecked=0, Total=53592 [2025-04-13 18:48:56,867 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 1402 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 6143 mSolverCounterSat, 196 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 6351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 6143 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:48:56,867 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1402 Valid, 1008 Invalid, 6351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 6143 Invalid, 12 Unknown, 0 Unchecked, 59.8s Time] [2025-04-13 18:48:56,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12896 states. [2025-04-13 18:49:00,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12896 to 4330. [2025-04-13 18:49:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4330 states, 4329 states have (on average 3.7107877107877107) internal successors, (16064), 4329 states have internal predecessors, (16064), 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:49:00,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4330 states to 4330 states and 16064 transitions. [2025-04-13 18:49:00,198 INFO L79 Accepts]: Start accepts. Automaton has 4330 states and 16064 transitions. Word has length 30 [2025-04-13 18:49:00,198 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:49:00,198 INFO L485 AbstractCegarLoop]: Abstraction has 4330 states and 16064 transitions. [2025-04-13 18:49:00,198 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:00,198 INFO L278 IsEmpty]: Start isEmpty. Operand 4330 states and 16064 transitions. [2025-04-13 18:49:00,205 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:49:00,205 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:49:00,205 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:49:00,211 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:49:00,406 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:49:00,406 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:49:00,406 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:49:00,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1355113251, now seen corresponding path program 2 times [2025-04-13 18:49:00,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:49:00,407 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709253630] [2025-04-13 18:49:00,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:49:00,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:49:00,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:49:00,418 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:49:00,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:49:00,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:49:00,510 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:49:00,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:49:00,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709253630] [2025-04-13 18:49:00,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709253630] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:49:00,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638062548] [2025-04-13 18:49:00,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:49:00,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:49:00,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:49:00,512 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:49:00,514 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:49:00,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:49:00,570 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:49:00,570 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:49:00,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:49:00,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 18:49:00,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:49:00,642 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:49:00,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:49:00,715 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:49:00,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638062548] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:49:00,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:49:00,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2025-04-13 18:49:00,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510754528] [2025-04-13 18:49:00,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:49:00,715 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:49:00,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:49:00,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:49:00,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:49:00,716 INFO L87 Difference]: Start difference. First operand 4330 states and 16064 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 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:49:07,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:49:07,091 INFO L93 Difference]: Finished difference Result 6622 states and 24278 transitions. [2025-04-13 18:49:07,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:49:07,091 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 18:49:07,092 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:49:07,107 INFO L225 Difference]: With dead ends: 6622 [2025-04-13 18:49:07,107 INFO L226 Difference]: Without dead ends: 6154 [2025-04-13 18:49:07,108 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=297, Invalid=759, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:49:07,109 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 219 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:49:07,109 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 82 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:49:07,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6154 states. [2025-04-13 18:49:10,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6154 to 3802. [2025-04-13 18:49:10,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3802 states, 3801 states have (on average 3.704025256511444) internal successors, (14079), 3801 states have internal predecessors, (14079), 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:49:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3802 states to 3802 states and 14079 transitions. [2025-04-13 18:49:10,062 INFO L79 Accepts]: Start accepts. Automaton has 3802 states and 14079 transitions. Word has length 30 [2025-04-13 18:49:10,062 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:49:10,062 INFO L485 AbstractCegarLoop]: Abstraction has 3802 states and 14079 transitions. [2025-04-13 18:49:10,062 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 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:49:10,062 INFO L278 IsEmpty]: Start isEmpty. Operand 3802 states and 14079 transitions. [2025-04-13 18:49:10,068 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:49:10,069 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:49:10,069 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:49:10,076 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:49:10,269 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,SelfDestructingSolverStorable12 [2025-04-13 18:49:10,269 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:49:10,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:49:10,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1356115641, now seen corresponding path program 3 times [2025-04-13 18:49:10,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:49:10,270 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037114262] [2025-04-13 18:49:10,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:49:10,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:49:10,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-04-13 18:49:10,286 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:49:10,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:49:10,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:49:11,366 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:49:11,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:49:11,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037114262] [2025-04-13 18:49:11,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037114262] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:49:11,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:49:11,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:49:11,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279380628] [2025-04-13 18:49:11,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:49:11,367 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:49:11,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:49:11,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:49:11,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:49:11,367 INFO L87 Difference]: Start difference. First operand 3802 states and 14079 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:17,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:49:17,251 INFO L93 Difference]: Finished difference Result 4970 states and 18374 transitions. [2025-04-13 18:49:17,251 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:49:17,252 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 18:49:17,252 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:49:17,266 INFO L225 Difference]: With dead ends: 4970 [2025-04-13 18:49:17,266 INFO L226 Difference]: Without dead ends: 4814 [2025-04-13 18:49:17,267 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:49:17,267 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 140 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:49:17,267 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 121 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:49:17,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4814 states. [2025-04-13 18:49:20,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4814 to 3802. [2025-04-13 18:49:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3802 states, 3801 states have (on average 3.704025256511444) internal successors, (14079), 3801 states have internal predecessors, (14079), 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:49:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3802 states to 3802 states and 14079 transitions. [2025-04-13 18:49:20,157 INFO L79 Accepts]: Start accepts. Automaton has 3802 states and 14079 transitions. Word has length 30 [2025-04-13 18:49:20,157 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:49:20,158 INFO L485 AbstractCegarLoop]: Abstraction has 3802 states and 14079 transitions. [2025-04-13 18:49:20,158 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:20,158 INFO L278 IsEmpty]: Start isEmpty. Operand 3802 states and 14079 transitions. [2025-04-13 18:49:20,164 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:49:20,164 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:49:20,164 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:49:20,164 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 18:49:20,164 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:49:20,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:49:20,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1253851187, now seen corresponding path program 4 times [2025-04-13 18:49:20,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:49:20,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715859671] [2025-04-13 18:49:20,165 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:49:20,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:49:20,168 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:49:20,178 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:49:20,178 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:49:20,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:49:21,679 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:49:21,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:49:21,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715859671] [2025-04-13 18:49:21,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715859671] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:49:21,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:49:21,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:49:21,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801008783] [2025-04-13 18:49:21,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:49:21,679 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:49:21,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:49:21,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:49:21,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:49:21,680 INFO L87 Difference]: Start difference. First operand 3802 states and 14079 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:31,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:49:31,998 INFO L93 Difference]: Finished difference Result 5797 states and 20875 transitions. [2025-04-13 18:49:31,998 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:49:31,998 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 18:49:31,998 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:49:32,013 INFO L225 Difference]: With dead ends: 5797 [2025-04-13 18:49:32,013 INFO L226 Difference]: Without dead ends: 5745 [2025-04-13 18:49:32,014 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=297, Invalid=893, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:49:32,015 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 325 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:49:32,015 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 126 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 18:49:32,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5745 states. [2025-04-13 18:49:34,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5745 to 3820. [2025-04-13 18:49:34,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3820 states, 3819 states have (on average 3.710395391463734) internal successors, (14170), 3819 states have internal predecessors, (14170), 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:49:34,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3820 states to 3820 states and 14170 transitions. [2025-04-13 18:49:34,980 INFO L79 Accepts]: Start accepts. Automaton has 3820 states and 14170 transitions. Word has length 30 [2025-04-13 18:49:34,980 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:49:34,981 INFO L485 AbstractCegarLoop]: Abstraction has 3820 states and 14170 transitions. [2025-04-13 18:49:34,981 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:34,981 INFO L278 IsEmpty]: Start isEmpty. Operand 3820 states and 14170 transitions. [2025-04-13 18:49:34,986 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:49:34,987 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:49:34,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:49:34,987 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 18:49:34,987 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:49:34,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:49:34,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1012564935, now seen corresponding path program 5 times [2025-04-13 18:49:34,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:49:34,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215161800] [2025-04-13 18:49:34,987 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:49:34,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:49:34,990 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-04-13 18:49:35,003 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:49:35,003 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:49:35,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:49:36,535 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:49:36,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:49:36,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215161800] [2025-04-13 18:49:36,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215161800] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:49:36,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:49:36,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:49:36,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265027091] [2025-04-13 18:49:36,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:49:36,536 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:49:36,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:49:36,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:49:36,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:49:36,536 INFO L87 Difference]: Start difference. First operand 3820 states and 14170 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:46,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:49:46,753 INFO L93 Difference]: Finished difference Result 5851 states and 21300 transitions. [2025-04-13 18:49:46,753 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 18:49:46,753 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 18:49:46,753 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:49:46,767 INFO L225 Difference]: With dead ends: 5851 [2025-04-13 18:49:46,767 INFO L226 Difference]: Without dead ends: 5646 [2025-04-13 18:49:46,768 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=481, Invalid=1411, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 18:49:46,768 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 336 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:49:46,768 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 148 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 18:49:46,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5646 states. [2025-04-13 18:49:49,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5646 to 3802. [2025-04-13 18:49:49,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3802 states, 3801 states have (on average 3.704025256511444) internal successors, (14079), 3801 states have internal predecessors, (14079), 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:49:49,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3802 states to 3802 states and 14079 transitions. [2025-04-13 18:49:49,804 INFO L79 Accepts]: Start accepts. Automaton has 3802 states and 14079 transitions. Word has length 30 [2025-04-13 18:49:49,804 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:49:49,804 INFO L485 AbstractCegarLoop]: Abstraction has 3802 states and 14079 transitions. [2025-04-13 18:49:49,804 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:49,804 INFO L278 IsEmpty]: Start isEmpty. Operand 3802 states and 14079 transitions. [2025-04-13 18:49:49,810 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:49:49,810 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:49:49,810 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:49:49,810 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 18:49:49,810 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:49:49,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:49:49,810 INFO L85 PathProgramCache]: Analyzing trace with hash -693196689, now seen corresponding path program 6 times [2025-04-13 18:49:49,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:49:49,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497699684] [2025-04-13 18:49:49,811 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:49:49,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:49:49,814 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 1 equivalence classes. [2025-04-13 18:49:49,819 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:49:49,819 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:49:49,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:49:49,920 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:49:49,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:49:49,920 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497699684] [2025-04-13 18:49:49,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497699684] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:49:49,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:49:49,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:49:49,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84280337] [2025-04-13 18:49:49,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:49:49,920 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:49:49,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:49:49,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:49:49,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:49:49,921 INFO L87 Difference]: Start difference. First operand 3802 states and 14079 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:49:58,510 INFO L93 Difference]: Finished difference Result 7654 states and 28482 transitions. [2025-04-13 18:49:58,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:49:58,510 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 18:49:58,510 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:49:58,528 INFO L225 Difference]: With dead ends: 7654 [2025-04-13 18:49:58,528 INFO L226 Difference]: Without dead ends: 7526 [2025-04-13 18:49:58,529 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:49:58,530 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 74 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:49:58,530 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 70 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:49:58,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7526 states. [2025-04-13 18:50:02,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7526 to 4780. [2025-04-13 18:50:02,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4780 states, 4779 states have (on average 3.7641766059845154) internal successors, (17989), 4779 states have internal predecessors, (17989), 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:50:02,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4780 states to 4780 states and 17989 transitions. [2025-04-13 18:50:02,581 INFO L79 Accepts]: Start accepts. Automaton has 4780 states and 17989 transitions. Word has length 30 [2025-04-13 18:50:02,581 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:50:02,581 INFO L485 AbstractCegarLoop]: Abstraction has 4780 states and 17989 transitions. [2025-04-13 18:50:02,581 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:02,581 INFO L278 IsEmpty]: Start isEmpty. Operand 4780 states and 17989 transitions. [2025-04-13 18:50:02,589 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:50:02,589 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:50:02,589 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, 1, 1, 1, 1, 1, 1] [2025-04-13 18:50:02,589 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 18:50:02,590 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:50:02,590 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:50:02,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1723239177, now seen corresponding path program 5 times [2025-04-13 18:50:02,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:50:02,590 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304064906] [2025-04-13 18:50:02,590 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:50:02,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:50:02,593 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:50:02,604 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:50:02,604 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:50:02,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:03,774 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:50:03,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:50:03,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304064906] [2025-04-13 18:50:03,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304064906] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:50:03,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892302233] [2025-04-13 18:50:03,775 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:50:03,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:50:03,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:50:03,777 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:50:03,778 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:50:03,804 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:50:03,870 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:50:03,871 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:50:03,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:03,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 18:50:03,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:50:20,869 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:50:20,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:50:29,995 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:50:29,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892302233] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:50:29,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:50:29,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2025-04-13 18:50:29,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464709569] [2025-04-13 18:50:29,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:50:29,996 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 18:50:29,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:50:29,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 18:50:29,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=736, Unknown=6, NotChecked=0, Total=930 [2025-04-13 18:50:29,997 INFO L87 Difference]: Start difference. First operand 4780 states and 17989 transitions. Second operand has 31 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 30 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:40,711 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:50:56,053 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 120 DAG size of output: 63 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:50:57,495 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:51:01,498 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:51:06,477 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:51:16,371 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 118 DAG size of output: 61 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:51:23,101 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:51:40,057 WARN L286 SmtUtils]: Spent 16.05s on a formula simplification. DAG size of input: 49 DAG size of output: 48 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:51:48,370 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:51:49,873 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:52:04,354 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:52:09,759 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:52:13,933 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:52:43,314 WARN L286 SmtUtils]: Spent 13.01s on a formula simplification. DAG size of input: 55 DAG size of output: 54 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:52:45,737 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:52:59,587 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:53:38,627 WARN L286 SmtUtils]: Spent 28.39s on a formula simplification. DAG size of input: 53 DAG size of output: 52 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:53:45,039 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:53:56,273 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:54:09,977 WARN L286 SmtUtils]: Spent 6.18s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:54:17,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:17,452 INFO L93 Difference]: Finished difference Result 14180 states and 50201 transitions. [2025-04-13 18:54:17,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2025-04-13 18:54:17,452 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 30 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 18:54:17,452 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:17,493 INFO L225 Difference]: With dead ends: 14180 [2025-04-13 18:54:17,494 INFO L226 Difference]: Without dead ends: 13476 [2025-04-13 18:54:17,498 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8725 ImplicationChecksByTransitivity, 173.8s TimeCoverageRelationStatistics Valid=3652, Invalid=19285, Unknown=15, NotChecked=0, Total=22952 [2025-04-13 18:54:17,499 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 1050 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 3503 mSolverCounterSat, 168 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 3682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 3503 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 61.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:17,499 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 718 Invalid, 3682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 3503 Invalid, 11 Unknown, 0 Unchecked, 61.8s Time] [2025-04-13 18:54:17,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13476 states. [2025-04-13 18:54:22,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13476 to 5309. [2025-04-13 18:54:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5309 states, 5308 states have (on average 3.7571590052750565) internal successors, (19943), 5308 states have internal predecessors, (19943), 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:54:22,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5309 states to 5309 states and 19943 transitions. [2025-04-13 18:54:22,280 INFO L79 Accepts]: Start accepts. Automaton has 5309 states and 19943 transitions. Word has length 30 [2025-04-13 18:54:22,280 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:22,280 INFO L485 AbstractCegarLoop]: Abstraction has 5309 states and 19943 transitions. [2025-04-13 18:54:22,281 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 30 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:22,281 INFO L278 IsEmpty]: Start isEmpty. Operand 5309 states and 19943 transitions. [2025-04-13 18:54:22,290 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:54:22,290 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:22,290 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, 1, 1, 1, 1, 1, 1] [2025-04-13 18:54:22,296 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:54:22,490 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 18:54:22,490 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:54:22,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:22,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1711434661, now seen corresponding path program 2 times [2025-04-13 18:54:22,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:22,491 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861092455] [2025-04-13 18:54:22,491 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:54:22,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:22,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:54:22,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:54:22,504 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:54:22,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:23,550 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:54:23,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:23,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861092455] [2025-04-13 18:54:23,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861092455] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:54:23,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642648329] [2025-04-13 18:54:23,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:54:23,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:54:23,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:54:23,553 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:54:23,554 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:54:23,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:54:23,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:54:23,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:54:23,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:23,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 18:54:23,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:54:24,462 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:54:24,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:54:27,644 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:54:27,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642648329] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:54:27,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:54:27,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 23 [2025-04-13 18:54:27,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537863302] [2025-04-13 18:54:27,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:54:27,645 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 18:54:27,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:27,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 18:54:27,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:54:27,646 INFO L87 Difference]: Start difference. First operand 5309 states and 19943 transitions. Second operand has 25 states, 24 states have (on average 3.75) internal successors, (90), 24 states have internal predecessors, (90), 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:54:54,768 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 96 DAG size of output: 76 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:55:22,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:22,832 INFO L93 Difference]: Finished difference Result 11770 states and 43904 transitions. [2025-04-13 18:55:22,833 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-04-13 18:55:22,833 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.75) internal successors, (90), 24 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 18:55:22,833 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:22,863 INFO L225 Difference]: With dead ends: 11770 [2025-04-13 18:55:22,863 INFO L226 Difference]: Without dead ends: 11447 [2025-04-13 18:55:22,866 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2100 ImplicationChecksByTransitivity, 36.9s TimeCoverageRelationStatistics Valid=1296, Invalid=5675, Unknown=1, NotChecked=0, Total=6972 [2025-04-13 18:55:22,867 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 543 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 2718 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 2760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:22,867 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 766 Invalid, 2760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2718 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-04-13 18:55:22,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11447 states. [2025-04-13 18:55:28,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11447 to 5799. [2025-04-13 18:55:28,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5799 states, 5798 states have (on average 3.7633666781648842) internal successors, (21820), 5798 states have internal predecessors, (21820), 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:55:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5799 states to 5799 states and 21820 transitions. [2025-04-13 18:55:28,268 INFO L79 Accepts]: Start accepts. Automaton has 5799 states and 21820 transitions. Word has length 30 [2025-04-13 18:55:28,268 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:28,268 INFO L485 AbstractCegarLoop]: Abstraction has 5799 states and 21820 transitions. [2025-04-13 18:55:28,269 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.75) internal successors, (90), 24 states have internal predecessors, (90), 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:55:28,269 INFO L278 IsEmpty]: Start isEmpty. Operand 5799 states and 21820 transitions. [2025-04-13 18:55:28,278 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:55:28,278 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:28,278 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, 1, 1, 1, 1, 1, 1] [2025-04-13 18:55:28,284 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:55:28,480 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:55:28,480 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:55:28,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:28,480 INFO L85 PathProgramCache]: Analyzing trace with hash -868384488, now seen corresponding path program 6 times [2025-04-13 18:55:28,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:28,480 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401477227] [2025-04-13 18:55:28,480 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:55:28,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:28,483 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:55:28,496 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:55:28,496 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:55:28,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:29,432 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:55:29,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:29,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401477227] [2025-04-13 18:55:29,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401477227] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:55:29,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108394049] [2025-04-13 18:55:29,432 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:55:29,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:55:29,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:55:29,434 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:55:29,436 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:55:29,462 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:55:29,509 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:55:29,510 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:55:29,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:29,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 18:55:29,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:55:30,171 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:55:30,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:55:31,069 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:55:31,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108394049] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:55:31,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:55:31,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2025-04-13 18:55:31,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694783639] [2025-04-13 18:55:31,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:55:31,069 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 18:55:31,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:31,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 18:55:31,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=668, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:55:31,070 INFO L87 Difference]: Start difference. First operand 5799 states and 21820 transitions. Second operand has 29 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 states have internal predecessors, (89), 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:56:25,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:25,213 INFO L93 Difference]: Finished difference Result 18473 states and 66645 transitions. [2025-04-13 18:56:25,214 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2025-04-13 18:56:25,214 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 states have internal predecessors, (89), 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 31 [2025-04-13 18:56:25,214 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:25,260 INFO L225 Difference]: With dead ends: 18473 [2025-04-13 18:56:25,260 INFO L226 Difference]: Without dead ends: 16804 [2025-04-13 18:56:25,267 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10021 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=3514, Invalid=22568, Unknown=0, NotChecked=0, Total=26082 [2025-04-13 18:56:25,268 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 1481 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 4716 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1481 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 4908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 4716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:25,268 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1481 Valid, 1042 Invalid, 4908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 4716 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2025-04-13 18:56:25,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16804 states. [2025-04-13 18:56:32,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16804 to 7399. [2025-04-13 18:56:32,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7399 states, 7398 states have (on average 3.7772370911057043) internal successors, (27944), 7398 states have internal predecessors, (27944), 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:56:32,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7399 states to 7399 states and 27944 transitions. [2025-04-13 18:56:32,949 INFO L79 Accepts]: Start accepts. Automaton has 7399 states and 27944 transitions. Word has length 31 [2025-04-13 18:56:32,949 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:32,949 INFO L485 AbstractCegarLoop]: Abstraction has 7399 states and 27944 transitions. [2025-04-13 18:56:32,949 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 states have internal predecessors, (89), 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:56:32,949 INFO L278 IsEmpty]: Start isEmpty. Operand 7399 states and 27944 transitions. [2025-04-13 18:56:32,962 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 18:56:32,962 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:32,962 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, 1, 1, 1, 1, 1, 1] [2025-04-13 18:56:32,968 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:56:33,162 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:56:33,163 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:56:33,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:33,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1329856345, now seen corresponding path program 7 times [2025-04-13 18:56:33,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:33,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222357831] [2025-04-13 18:56:33,163 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:56:33,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:33,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 18:56:33,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 18:56:33,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:56:33,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:35,261 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:56:35,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:35,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222357831] [2025-04-13 18:56:35,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222357831] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:56:35,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243402931] [2025-04-13 18:56:35,261 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:56:35,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:56:35,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:56:35,263 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:56:35,264 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:56:35,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 18:56:35,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 18:56:35,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:56:35,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:35,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 18:56:35,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:56:52,650 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:56:52,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:57:23,134 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:57:23,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243402931] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:57:23,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:57:23,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 28 [2025-04-13 18:57:23,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509339946] [2025-04-13 18:57:23,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:57:23,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 18:57:23,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:23,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 18:57:23,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=724, Unknown=10, NotChecked=0, Total=870 [2025-04-13 18:57:23,135 INFO L87 Difference]: Start difference. First operand 7399 states and 27944 transitions. Second operand has 30 states, 29 states have (on average 3.310344827586207) internal successors, (96), 29 states have internal predecessors, (96), 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:57:56,900 WARN L286 SmtUtils]: Spent 7.72s on a formula simplification. DAG size of input: 79 DAG size of output: 48 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:58:19,878 WARN L286 SmtUtils]: Spent 6.01s on a formula simplification. DAG size of input: 112 DAG size of output: 48 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:58:31,561 WARN L286 SmtUtils]: Spent 5.06s on a formula simplification. DAG size of input: 99 DAG size of output: 41 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:58:32,746 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 18:58:40,622 WARN L286 SmtUtils]: Spent 5.26s on a formula simplification. DAG size of input: 118 DAG size of output: 54 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:59:00,600 WARN L286 SmtUtils]: Spent 6.94s on a formula simplification. DAG size of input: 114 DAG size of output: 58 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:59:09,724 WARN L286 SmtUtils]: Spent 6.75s on a formula simplification. DAG size of input: 88 DAG size of output: 48 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:59:31,745 WARN L286 SmtUtils]: Spent 5.48s on a formula simplification. DAG size of input: 114 DAG size of output: 55 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:59:47,795 WARN L286 SmtUtils]: Spent 5.43s on a formula simplification. DAG size of input: 120 DAG size of output: 64 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2025-04-13 19:00:29,296 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 19:00:29,296 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 19:00:29,451 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2025-04-13 19:00:29,452 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3685 ImplicationChecksByTransitivity, 210.5s TimeCoverageRelationStatistics Valid=1909, Invalid=10067, Unknown=14, NotChecked=0, Total=11990 [2025-04-13 19:00:29,453 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 600 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 4265 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 4328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 4265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:29,453 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 677 Invalid, 4328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 4265 Invalid, 0 Unknown, 0 Unchecked, 13.8s Time] [2025-04-13 19:00:29,454 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 19:00:29,461 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 19:00:29,658 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:00:29,658 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (7399states) and FLOYD_HOARE automaton (currently 93 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-12-3-6-3-5-1 term,while SimplifyDDA2 was simplifying 5 xjuncts wrt. a ∧-2-1 context. [2025-04-13 19:00:29,659 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 19:00:29,660 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 19:00:29,660 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 19:00:29,662 INFO L422 BasicCegarLoop]: Path program histogram: [7, 6, 4, 2, 1, 1] [2025-04-13 19:00:29,664 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:00:29,664 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:00:29,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:00:29 BasicIcfg [2025-04-13 19:00:29,666 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:00:29,666 INFO L158 Benchmark]: Toolchain (without parser) took 860789.35ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 99.2MB in the beginning and 944.8MB in the end (delta: -845.7MB). Peak memory consumption was 726.1MB. Max. memory is 8.0GB. [2025-04-13 19:00:29,666 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:00:29,666 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.70ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 84.3MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 19:00:29,666 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.01ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 82.6MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:00:29,667 INFO L158 Benchmark]: Boogie Preprocessor took 28.17ms. Allocated memory is still 142.6MB. Free memory was 82.6MB in the beginning and 80.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:00:29,667 INFO L158 Benchmark]: RCFGBuilder took 411.15ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 45.7MB in the end (delta: 35.2MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-13 19:00:29,667 INFO L158 Benchmark]: TraceAbstraction took 860061.29ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 44.9MB in the beginning and 944.8MB in the end (delta: -900.0MB). Peak memory consumption was 675.8MB. Max. memory is 8.0GB. [2025-04-13 19:00:29,667 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 254.70ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 84.3MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.01ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 82.6MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.17ms. Allocated memory is still 142.6MB. Free memory was 82.6MB in the beginning and 80.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 411.15ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 45.7MB in the end (delta: 35.2MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 860061.29ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 44.9MB in the beginning and 944.8MB in the end (delta: -900.0MB). Peak memory consumption was 675.8MB. 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: 118]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (7399states) and FLOYD_HOARE automaton (currently 93 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-12-3-6-3-5-1 term,while SimplifyDDA2 was simplifying 5 xjuncts wrt. a ∧-2-1 context. - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (7399states) and FLOYD_HOARE automaton (currently 93 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-12-3-6-3-5-1 term,while SimplifyDDA2 was simplifying 5 xjuncts wrt. a ∧-2-1 context. - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (7399states) and FLOYD_HOARE automaton (currently 93 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-12-3-6-3-5-1 term,while SimplifyDDA2 was simplifying 5 xjuncts wrt. a ∧-2-1 context. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (7399states) and FLOYD_HOARE automaton (currently 93 states, 30 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-12-3-6-3-5-1 term,while SimplifyDDA2 was simplifying 5 xjuncts wrt. a ∧-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 54 locations, 59 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 860.0s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 712.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 23 mSolverCounterUnknown, 8314 SdHoareTripleChecker+Valid, 159.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8314 mSDsluCounter, 6461 SdHoareTripleChecker+Invalid, 155.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5794 mSDsCounter, 962 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30679 IncrementalHoareTripleChecker+Invalid, 31664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 962 mSolverCounterUnsat, 667 mSDtfsCounter, 30679 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1574 GetRequests, 436 SyntacticMatches, 16 SemanticMatches, 1121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55461 ImplicationChecksByTransitivity, 502.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7399occurred in iteration=20, InterpolantAutomatonStates: 972, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 42.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 56738 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 101.3s InterpolantComputationTime, 839 NumberOfCodeBlocks, 839 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1061 ConstructedInterpolants, 0 QuantifiedInterpolants, 54978 SizeOfPredicates, 74 NumberOfNonLiveVariables, 1311 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 39 InterpolantComputations, 13 PerfectInterpolantSequences, 1/57 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