/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/bench-exp2x6.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:38:05,509 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:38:05,554 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 17:38:05,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:38:05,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:38:05,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:38:05,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:38:05,587 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:38:05,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:38:05,587 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:38:05,588 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:38:05,588 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:38:05,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:38:05,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:38:05,589 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:38:05,589 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:38:05,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:38:05,589 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:38:05,589 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:38:05,589 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:38:05,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:38:05,589 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:38:05,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:38:05,590 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:38:05,590 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:38:05,590 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:38:05,590 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:38:05,590 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:38:05,590 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:38:05,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:38:05,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:38:05,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:38:05,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:38:05,590 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:38:05,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:38:05,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:38:05,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:38:05,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:38:05,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:38:05,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:38:05,591 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:38:05,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:38:05,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:38:05,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:38:05,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:38:05,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:38:05,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:38:05,591 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 17:38:05,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:38:05,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:38:05,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:38:05,827 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:38:05,827 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:38:05,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2025-04-13 17:38:07,058 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1121b24d5/ac3fa07b04554761897678d8fc44d194/FLAG97f28ac4f [2025-04-13 17:38:07,249 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:38:07,249 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2025-04-13 17:38:07,261 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1121b24d5/ac3fa07b04554761897678d8fc44d194/FLAG97f28ac4f [2025-04-13 17:38:09,109 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1121b24d5/ac3fa07b04554761897678d8fc44d194 [2025-04-13 17:38:09,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:38:09,111 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:38:09,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:38:09,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:38:09,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:38:09,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:38:09" (1/1) ... [2025-04-13 17:38:09,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14070fac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:38:09, skipping insertion in model container [2025-04-13 17:38:09,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:38:09" (1/1) ... [2025-04-13 17:38:09,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:38:09,285 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/bench-exp2x6.wvr.c[2505,2518] [2025-04-13 17:38:09,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:38:09,294 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:38:09,320 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/bench-exp2x6.wvr.c[2505,2518] [2025-04-13 17:38:09,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:38:09,330 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:38:09,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:38:09 WrapperNode [2025-04-13 17:38:09,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:38:09,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:38:09,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:38:09,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:38:09,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:38:09" (1/1) ... [2025-04-13 17:38:09,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:38:09" (1/1) ... [2025-04-13 17:38:09,358 INFO L138 Inliner]: procedures = 19, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2025-04-13 17:38:09,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:38:09,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:38:09,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:38:09,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:38:09,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:38:09" (1/1) ... [2025-04-13 17:38:09,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:38:09" (1/1) ... [2025-04-13 17:38:09,368 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:38:09" (1/1) ... [2025-04-13 17:38:09,382 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 17:38:09,382 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:38:09" (1/1) ... [2025-04-13 17:38:09,383 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:38:09" (1/1) ... [2025-04-13 17:38:09,390 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:38:09" (1/1) ... [2025-04-13 17:38:09,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:38:09" (1/1) ... [2025-04-13 17:38:09,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:38:09" (1/1) ... [2025-04-13 17:38:09,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:38:09" (1/1) ... [2025-04-13 17:38:09,394 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:38:09" (1/1) ... [2025-04-13 17:38:09,396 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:38:09,396 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:38:09,396 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:38:09,396 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:38:09,397 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:38:09" (1/1) ... [2025-04-13 17:38:09,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:38:09,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:38:09,419 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 17:38:09,421 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 17:38:09,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:38:09,436 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 17:38:09,436 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 17:38:09,436 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 17:38:09,436 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 17:38:09,436 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 17:38:09,436 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 17:38:09,436 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 17:38:09,436 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 17:38:09,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:38:09,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:38:09,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:38:09,437 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 17:38:09,496 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:38:09,498 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:38:09,639 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:38:09,640 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:38:09,640 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:38:09,801 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 17:38:09,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:38:09 BoogieIcfgContainer [2025-04-13 17:38:09,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:38:09,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:38:09,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:38:09,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:38:09,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:38:09" (1/3) ... [2025-04-13 17:38:09,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7bffd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:38:09, skipping insertion in model container [2025-04-13 17:38:09,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:38:09" (2/3) ... [2025-04-13 17:38:09,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7bffd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:38:09, skipping insertion in model container [2025-04-13 17:38:09,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:38:09" (3/3) ... [2025-04-13 17:38:09,807 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x6.wvr.c [2025-04-13 17:38:09,817 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:38:09,818 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x6.wvr.c that has 5 procedures, 28 locations, 27 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 17:38:09,818 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:38:09,855 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 17:38:09,876 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 31 transitions, 90 flow [2025-04-13 17:38:09,917 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 283 states, 282 states have (on average 4.099290780141844) internal successors, (1156), 282 states have internal predecessors, (1156), 0 states have call successors, (0), 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 17:38:09,937 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:38:09,947 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;@14f936ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:38:09,948 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 17:38:09,950 INFO L278 IsEmpty]: Start isEmpty. Operand has 283 states, 282 states have (on average 4.099290780141844) internal successors, (1156), 282 states have internal predecessors, (1156), 0 states have call successors, (0), 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 17:38:09,960 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 17:38:09,960 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:38:09,961 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] [2025-04-13 17:38:09,961 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 2 more)] === [2025-04-13 17:38:09,966 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:38:09,967 INFO L85 PathProgramCache]: Analyzing trace with hash -117428894, now seen corresponding path program 1 times [2025-04-13 17:38:09,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:38:09,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300233998] [2025-04-13 17:38:09,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:38:09,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:38:10,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 17:38:10,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 17:38:10,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:38:10,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:10,350 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 17:38:10,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:38:10,352 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300233998] [2025-04-13 17:38:10,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300233998] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:38:10,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:38:10,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:38:10,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008183470] [2025-04-13 17:38:10,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:38:10,358 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:38:10,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:38:10,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:38:10,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:38:10,374 INFO L87 Difference]: Start difference. First operand has 283 states, 282 states have (on average 4.099290780141844) internal successors, (1156), 282 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:10,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:38:10,525 INFO L93 Difference]: Finished difference Result 556 states and 2283 transitions. [2025-04-13 17:38:10,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:38:10,527 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 17:38:10,527 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:38:10,545 INFO L225 Difference]: With dead ends: 556 [2025-04-13 17:38:10,546 INFO L226 Difference]: Without dead ends: 549 [2025-04-13 17:38:10,548 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:38:10,551 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:38:10,551 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:38:10,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-04-13 17:38:10,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2025-04-13 17:38:10,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 4.12956204379562) internal successors, (2263), 548 states have internal predecessors, (2263), 0 states have call successors, (0), 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 17:38:10,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 2263 transitions. [2025-04-13 17:38:10,646 INFO L79 Accepts]: Start accepts. Automaton has 549 states and 2263 transitions. Word has length 22 [2025-04-13 17:38:10,646 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:38:10,647 INFO L485 AbstractCegarLoop]: Abstraction has 549 states and 2263 transitions. [2025-04-13 17:38:10,647 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:10,647 INFO L278 IsEmpty]: Start isEmpty. Operand 549 states and 2263 transitions. [2025-04-13 17:38:10,651 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:38:10,651 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:38:10,651 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 17:38:10,655 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:38:10,655 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 2 more)] === [2025-04-13 17:38:10,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:38:10,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1624810413, now seen corresponding path program 1 times [2025-04-13 17:38:10,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:38:10,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340358078] [2025-04-13 17:38:10,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:38:10,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:38:10,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 17:38:10,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:38:10,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:38:10,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:10,779 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 17:38:10,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:38:10,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340358078] [2025-04-13 17:38:10,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340358078] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:38:10,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:38:10,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:38:10,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774866955] [2025-04-13 17:38:10,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:38:10,781 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:38:10,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:38:10,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:38:10,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:38:10,781 INFO L87 Difference]: Start difference. First operand 549 states and 2263 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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 17:38:10,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:38:10,975 INFO L93 Difference]: Finished difference Result 793 states and 3246 transitions. [2025-04-13 17:38:10,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:38:10,976 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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 17:38:10,976 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:38:10,984 INFO L225 Difference]: With dead ends: 793 [2025-04-13 17:38:10,984 INFO L226 Difference]: Without dead ends: 738 [2025-04-13 17:38:10,985 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:38:10,985 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 36 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:38:10,986 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 19 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:38:10,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-04-13 17:38:11,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 657. [2025-04-13 17:38:11,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 656 states have (on average 4.219512195121951) internal successors, (2768), 656 states have internal predecessors, (2768), 0 states have call successors, (0), 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 17:38:11,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 2768 transitions. [2025-04-13 17:38:11,077 INFO L79 Accepts]: Start accepts. Automaton has 657 states and 2768 transitions. Word has length 23 [2025-04-13 17:38:11,077 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:38:11,077 INFO L485 AbstractCegarLoop]: Abstraction has 657 states and 2768 transitions. [2025-04-13 17:38:11,077 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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 17:38:11,077 INFO L278 IsEmpty]: Start isEmpty. Operand 657 states and 2768 transitions. [2025-04-13 17:38:11,080 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:38:11,081 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:38:11,081 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 17:38:11,081 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 17:38:11,081 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 2 more)] === [2025-04-13 17:38:11,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:38:11,081 INFO L85 PathProgramCache]: Analyzing trace with hash 622888362, now seen corresponding path program 1 times [2025-04-13 17:38:11,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:38:11,081 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467713666] [2025-04-13 17:38:11,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:38:11,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:38:11,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 17:38:11,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:38:11,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:38:11,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:11,175 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 17:38:11,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:38:11,176 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467713666] [2025-04-13 17:38:11,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467713666] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:38:11,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:38:11,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:38:11,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603470538] [2025-04-13 17:38:11,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:38:11,176 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:38:11,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:38:11,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:38:11,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:38:11,177 INFO L87 Difference]: Start difference. First operand 657 states and 2768 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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 17:38:11,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:38:11,383 INFO L93 Difference]: Finished difference Result 977 states and 4032 transitions. [2025-04-13 17:38:11,384 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:38:11,384 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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 17:38:11,384 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:38:11,391 INFO L225 Difference]: With dead ends: 977 [2025-04-13 17:38:11,391 INFO L226 Difference]: Without dead ends: 836 [2025-04-13 17:38:11,393 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:38:11,394 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 42 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:38:11,394 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 19 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:38:11,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2025-04-13 17:38:11,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 755. [2025-04-13 17:38:11,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 754 states have (on average 4.262599469496021) internal successors, (3214), 754 states have internal predecessors, (3214), 0 states have call successors, (0), 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 17:38:11,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 3214 transitions. [2025-04-13 17:38:11,484 INFO L79 Accepts]: Start accepts. Automaton has 755 states and 3214 transitions. Word has length 23 [2025-04-13 17:38:11,484 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:38:11,485 INFO L485 AbstractCegarLoop]: Abstraction has 755 states and 3214 transitions. [2025-04-13 17:38:11,485 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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 17:38:11,485 INFO L278 IsEmpty]: Start isEmpty. Operand 755 states and 3214 transitions. [2025-04-13 17:38:11,487 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:38:11,487 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:38:11,487 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 17:38:11,487 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:38:11,487 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 2 more)] === [2025-04-13 17:38:11,488 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:38:11,488 INFO L85 PathProgramCache]: Analyzing trace with hash -14264616, now seen corresponding path program 1 times [2025-04-13 17:38:11,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:38:11,488 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759934872] [2025-04-13 17:38:11,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:38:11,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:38:11,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 17:38:11,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:38:11,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:38:11,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:11,597 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 17:38:11,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:38:11,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759934872] [2025-04-13 17:38:11,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759934872] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:38:11,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046134185] [2025-04-13 17:38:11,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:38:11,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:38:11,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:38:11,601 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 17:38:11,602 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 17:38:11,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 17:38:11,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:38:11,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:38:11,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:11,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 17:38:11,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:38:11,865 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 17:38:11,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:38:11,949 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 17:38:11,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046134185] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:38:11,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:38:11,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 17:38:11,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783238339] [2025-04-13 17:38:11,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:38:11,950 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:38:11,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:38:11,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:38:11,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:38:11,950 INFO L87 Difference]: Start difference. First operand 755 states and 3214 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 17:38:12,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:38:12,258 INFO L93 Difference]: Finished difference Result 1048 states and 4333 transitions. [2025-04-13 17:38:12,259 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:38:12,259 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 17:38:12,259 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:38:12,267 INFO L225 Difference]: With dead ends: 1048 [2025-04-13 17:38:12,267 INFO L226 Difference]: Without dead ends: 976 [2025-04-13 17:38:12,269 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:38:12,270 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 40 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:38:12,270 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 29 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:38:12,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-04-13 17:38:12,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 823. [2025-04-13 17:38:12,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 822 states have (on average 4.2822384428223845) internal successors, (3520), 822 states have internal predecessors, (3520), 0 states have call successors, (0), 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 17:38:12,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 3520 transitions. [2025-04-13 17:38:12,413 INFO L79 Accepts]: Start accepts. Automaton has 823 states and 3520 transitions. Word has length 23 [2025-04-13 17:38:12,414 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:38:12,414 INFO L485 AbstractCegarLoop]: Abstraction has 823 states and 3520 transitions. [2025-04-13 17:38:12,414 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 17:38:12,414 INFO L278 IsEmpty]: Start isEmpty. Operand 823 states and 3520 transitions. [2025-04-13 17:38:12,417 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:38:12,418 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:38:12,418 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 17:38:12,426 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 17:38:12,624 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:38:12,624 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 2 more)] === [2025-04-13 17:38:12,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:38:12,624 INFO L85 PathProgramCache]: Analyzing trace with hash -392305382, now seen corresponding path program 2 times [2025-04-13 17:38:12,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:38:12,625 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227237898] [2025-04-13 17:38:12,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:38:12,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:38:12,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 17:38:12,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:38:12,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:38:12,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:12,715 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 17:38:12,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:38:12,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227237898] [2025-04-13 17:38:12,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227237898] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:38:12,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:38:12,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:38:12,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040950780] [2025-04-13 17:38:12,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:38:12,716 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:38:12,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:38:12,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:38:12,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:38:12,717 INFO L87 Difference]: Start difference. First operand 823 states and 3520 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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 17:38:12,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:38:12,895 INFO L93 Difference]: Finished difference Result 976 states and 4021 transitions. [2025-04-13 17:38:12,895 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:38:12,895 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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 17:38:12,896 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:38:12,903 INFO L225 Difference]: With dead ends: 976 [2025-04-13 17:38:12,904 INFO L226 Difference]: Without dead ends: 876 [2025-04-13 17:38:12,907 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:38:12,907 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 36 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:38:12,907 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 19 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:38:12,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2025-04-13 17:38:12,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 853. [2025-04-13 17:38:12,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 852 states have (on average 4.213615023474178) internal successors, (3590), 852 states have internal predecessors, (3590), 0 states have call successors, (0), 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 17:38:12,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 3590 transitions. [2025-04-13 17:38:12,997 INFO L79 Accepts]: Start accepts. Automaton has 853 states and 3590 transitions. Word has length 23 [2025-04-13 17:38:12,997 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:38:12,997 INFO L485 AbstractCegarLoop]: Abstraction has 853 states and 3590 transitions. [2025-04-13 17:38:12,997 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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 17:38:12,997 INFO L278 IsEmpty]: Start isEmpty. Operand 853 states and 3590 transitions. [2025-04-13 17:38:13,000 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:38:13,000 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:38:13,000 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 17:38:13,000 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 17:38:13,000 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 2 more)] === [2025-04-13 17:38:13,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:38:13,001 INFO L85 PathProgramCache]: Analyzing trace with hash -359437573, now seen corresponding path program 2 times [2025-04-13 17:38:13,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:38:13,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872236887] [2025-04-13 17:38:13,001 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:38:13,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:38:13,007 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 17:38:13,013 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:38:13,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:38:13,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:13,061 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 17:38:13,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:38:13,062 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872236887] [2025-04-13 17:38:13,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872236887] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:38:13,062 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964232570] [2025-04-13 17:38:13,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:38:13,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:38:13,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:38:13,064 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 17:38:13,065 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 17:38:13,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 17:38:13,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:38:13,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:38:13,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:13,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 17:38:13,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:38:13,228 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 17:38:13,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:38:13,289 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 17:38:13,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964232570] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:38:13,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:38:13,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 17:38:13,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976311367] [2025-04-13 17:38:13,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:38:13,290 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:38:13,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:38:13,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:38:13,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:38:13,290 INFO L87 Difference]: Start difference. First operand 853 states and 3590 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 17:38:13,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:38:13,498 INFO L93 Difference]: Finished difference Result 1016 states and 4258 transitions. [2025-04-13 17:38:13,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:38:13,498 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 17:38:13,498 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:38:13,505 INFO L225 Difference]: With dead ends: 1016 [2025-04-13 17:38:13,505 INFO L226 Difference]: Without dead ends: 945 [2025-04-13 17:38:13,506 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:38:13,507 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 47 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:38:13,508 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 21 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:38:13,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-04-13 17:38:13,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 922. [2025-04-13 17:38:13,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 921 states have (on average 4.232356134636265) internal successors, (3898), 921 states have internal predecessors, (3898), 0 states have call successors, (0), 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 17:38:13,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 3898 transitions. [2025-04-13 17:38:13,591 INFO L79 Accepts]: Start accepts. Automaton has 922 states and 3898 transitions. Word has length 23 [2025-04-13 17:38:13,591 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:38:13,591 INFO L485 AbstractCegarLoop]: Abstraction has 922 states and 3898 transitions. [2025-04-13 17:38:13,592 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 17:38:13,592 INFO L278 IsEmpty]: Start isEmpty. Operand 922 states and 3898 transitions. [2025-04-13 17:38:13,594 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:38:13,594 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:38:13,594 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 17:38:13,600 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 17:38:13,794 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,SelfDestructingSolverStorable5 [2025-04-13 17:38:13,795 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 2 more)] === [2025-04-13 17:38:13,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:38:13,796 INFO L85 PathProgramCache]: Analyzing trace with hash 961722655, now seen corresponding path program 1 times [2025-04-13 17:38:13,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:38:13,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955821787] [2025-04-13 17:38:13,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:38:13,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:38:13,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 17:38:13,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:38:13,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:38:13,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:13,869 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 17:38:13,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:38:13,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955821787] [2025-04-13 17:38:13,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955821787] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:38:13,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329424101] [2025-04-13 17:38:13,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:38:13,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:38:13,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:38:13,871 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 17:38:13,873 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 17:38:13,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 17:38:13,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:38:13,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:38:13,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:13,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 17:38:13,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:38:14,022 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 17:38:14,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:38:14,079 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 17:38:14,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329424101] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:38:14,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:38:14,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 17:38:14,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500309366] [2025-04-13 17:38:14,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:38:14,080 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:38:14,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:38:14,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:38:14,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:38:14,080 INFO L87 Difference]: Start difference. First operand 922 states and 3898 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 17:38:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:38:14,366 INFO L93 Difference]: Finished difference Result 1464 states and 5888 transitions. [2025-04-13 17:38:14,366 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:38:14,366 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 17:38:14,367 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:38:14,377 INFO L225 Difference]: With dead ends: 1464 [2025-04-13 17:38:14,378 INFO L226 Difference]: Without dead ends: 1312 [2025-04-13 17:38:14,379 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:38:14,380 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 78 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:38:14,380 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 21 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:38:14,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2025-04-13 17:38:14,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1046. [2025-04-13 17:38:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 1045 states have (on average 4.239234449760765) internal successors, (4430), 1045 states have internal predecessors, (4430), 0 states have call successors, (0), 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 17:38:14,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 4430 transitions. [2025-04-13 17:38:14,488 INFO L79 Accepts]: Start accepts. Automaton has 1046 states and 4430 transitions. Word has length 23 [2025-04-13 17:38:14,488 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:38:14,488 INFO L485 AbstractCegarLoop]: Abstraction has 1046 states and 4430 transitions. [2025-04-13 17:38:14,488 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 17:38:14,488 INFO L278 IsEmpty]: Start isEmpty. Operand 1046 states and 4430 transitions. [2025-04-13 17:38:14,491 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:38:14,491 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:38:14,491 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 17:38:14,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 17:38:14,696 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:38:14,696 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 2 more)] === [2025-04-13 17:38:14,696 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:38:14,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1210630783, now seen corresponding path program 2 times [2025-04-13 17:38:14,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:38:14,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595156944] [2025-04-13 17:38:14,696 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:38:14,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:38:14,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 17:38:14,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:38:14,708 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:38:14,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:14,753 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 17:38:14,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:38:14,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595156944] [2025-04-13 17:38:14,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595156944] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:38:14,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:38:14,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:38:14,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51007502] [2025-04-13 17:38:14,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:38:14,754 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:38:14,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:38:14,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:38:14,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:38:14,754 INFO L87 Difference]: Start difference. First operand 1046 states and 4430 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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 17:38:14,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:38:14,970 INFO L93 Difference]: Finished difference Result 1312 states and 5282 transitions. [2025-04-13 17:38:14,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:38:14,971 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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 17:38:14,971 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:38:14,979 INFO L225 Difference]: With dead ends: 1312 [2025-04-13 17:38:14,979 INFO L226 Difference]: Without dead ends: 1136 [2025-04-13 17:38:14,979 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:38:14,981 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 50 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:38:14,981 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 19 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:38:14,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2025-04-13 17:38:15,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1078. [2025-04-13 17:38:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1077 states have (on average 4.187558031569174) internal successors, (4510), 1077 states have internal predecessors, (4510), 0 states have call successors, (0), 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 17:38:15,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 4510 transitions. [2025-04-13 17:38:15,085 INFO L79 Accepts]: Start accepts. Automaton has 1078 states and 4510 transitions. Word has length 23 [2025-04-13 17:38:15,085 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:38:15,085 INFO L485 AbstractCegarLoop]: Abstraction has 1078 states and 4510 transitions. [2025-04-13 17:38:15,085 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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 17:38:15,085 INFO L278 IsEmpty]: Start isEmpty. Operand 1078 states and 4510 transitions. [2025-04-13 17:38:15,089 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:38:15,089 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:38:15,089 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 17:38:15,089 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 17:38:15,089 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 2 more)] === [2025-04-13 17:38:15,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:38:15,089 INFO L85 PathProgramCache]: Analyzing trace with hash 260072730, now seen corresponding path program 2 times [2025-04-13 17:38:15,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:38:15,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886810897] [2025-04-13 17:38:15,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:38:15,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:38:15,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 17:38:15,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:38:15,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:38:15,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:15,148 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 17:38:15,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:38:15,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886810897] [2025-04-13 17:38:15,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886810897] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:38:15,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123165012] [2025-04-13 17:38:15,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:38:15,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:38:15,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:38:15,150 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 17:38:15,152 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 17:38:15,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 17:38:15,193 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:38:15,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:38:15,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:15,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 17:38:15,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:38:15,275 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 17:38:15,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:38:15,316 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 17:38:15,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123165012] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:38:15,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:38:15,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 17:38:15,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65289707] [2025-04-13 17:38:15,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:38:15,317 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:38:15,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:38:15,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:38:15,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:38:15,318 INFO L87 Difference]: Start difference. First operand 1078 states and 4510 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 17:38:15,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:38:15,574 INFO L93 Difference]: Finished difference Result 1412 states and 5798 transitions. [2025-04-13 17:38:15,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:38:15,575 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 17:38:15,575 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:38:15,583 INFO L225 Difference]: With dead ends: 1412 [2025-04-13 17:38:15,583 INFO L226 Difference]: Without dead ends: 1240 [2025-04-13 17:38:15,584 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:38:15,584 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 43 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:38:15,584 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 29 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:38:15,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2025-04-13 17:38:15,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1182. [2025-04-13 17:38:15,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 4.201524132091448) internal successors, (4962), 1181 states have internal predecessors, (4962), 0 states have call successors, (0), 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 17:38:15,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 4962 transitions. [2025-04-13 17:38:15,750 INFO L79 Accepts]: Start accepts. Automaton has 1182 states and 4962 transitions. Word has length 23 [2025-04-13 17:38:15,750 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:38:15,750 INFO L485 AbstractCegarLoop]: Abstraction has 1182 states and 4962 transitions. [2025-04-13 17:38:15,750 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 17:38:15,751 INFO L278 IsEmpty]: Start isEmpty. Operand 1182 states and 4962 transitions. [2025-04-13 17:38:15,753 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 17:38:15,753 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:38:15,753 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 17:38:15,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 17:38:15,953 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:38:15,954 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 2 more)] === [2025-04-13 17:38:15,954 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:38:15,954 INFO L85 PathProgramCache]: Analyzing trace with hash -441726185, now seen corresponding path program 1 times [2025-04-13 17:38:15,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:38:15,954 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464360403] [2025-04-13 17:38:15,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:38:15,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:38:15,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 17:38:15,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 17:38:15,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:38:15,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:16,311 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 17:38:16,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:38:16,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464360403] [2025-04-13 17:38:16,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464360403] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:38:16,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793729365] [2025-04-13 17:38:16,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:38:16,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:38:16,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:38:16,313 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 17:38:16,315 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 17:38:16,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 17:38:16,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 17:38:16,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:38:16,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:16,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:38:16,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:38:18,992 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 17:38:18,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:38:19,401 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 17:38:19,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793729365] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:38:19,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:38:19,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-13 17:38:19,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829013091] [2025-04-13 17:38:19,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:38:19,402 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:38:19,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:38:19,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:38:19,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:38:19,403 INFO L87 Difference]: Start difference. First operand 1182 states and 4962 transitions. Second operand has 16 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:23,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:38:23,616 INFO L93 Difference]: Finished difference Result 2319 states and 9440 transitions. [2025-04-13 17:38:23,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 17:38:23,616 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 17:38:23,616 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:38:23,629 INFO L225 Difference]: With dead ends: 2319 [2025-04-13 17:38:23,629 INFO L226 Difference]: Without dead ends: 2132 [2025-04-13 17:38:23,629 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:38:23,630 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 144 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:38:23,630 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 131 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-04-13 17:38:23,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2025-04-13 17:38:23,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 1410. [2025-04-13 17:38:23,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1409 states have (on average 4.312987934705465) internal successors, (6077), 1409 states have internal predecessors, (6077), 0 states have call successors, (0), 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 17:38:23,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 6077 transitions. [2025-04-13 17:38:23,822 INFO L79 Accepts]: Start accepts. Automaton has 1410 states and 6077 transitions. Word has length 24 [2025-04-13 17:38:23,822 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:38:23,822 INFO L485 AbstractCegarLoop]: Abstraction has 1410 states and 6077 transitions. [2025-04-13 17:38:23,822 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:38:23,822 INFO L278 IsEmpty]: Start isEmpty. Operand 1410 states and 6077 transitions. [2025-04-13 17:38:23,825 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 17:38:23,825 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:38:23,825 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 17:38:23,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 17:38:24,026 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,SelfDestructingSolverStorable9 [2025-04-13 17:38:24,026 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 2 more)] === [2025-04-13 17:38:24,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:38:24,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1610492117, now seen corresponding path program 2 times [2025-04-13 17:38:24,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:38:24,027 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274355888] [2025-04-13 17:38:24,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:38:24,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:38:24,030 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 17:38:24,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 17:38:24,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:38:24,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:24,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 17:38:24,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:38:24,224 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274355888] [2025-04-13 17:38:24,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274355888] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:38:24,224 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784818431] [2025-04-13 17:38:24,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:38:24,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:38:24,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:38:24,226 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 17:38:24,227 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 17:38:24,260 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 17:38:24,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 17:38:24,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:38:24,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:38:24,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:38:24,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:39:00,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:39:00,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:39:08,383 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 17:39:08,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784818431] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:39:08,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:39:08,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 5, 5] total 11 [2025-04-13 17:39:08,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300100682] [2025-04-13 17:39:08,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:39:08,384 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:39:08,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:39:08,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:39:08,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=103, Unknown=5, NotChecked=0, Total=156 [2025-04-13 17:39:08,385 INFO L87 Difference]: Start difference. First operand 1410 states and 6077 transitions. Second operand has 13 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:39:18,765 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 17:39:20,570 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:39:25,652 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 17:39:37,946 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 17:39:43,104 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:39:45,560 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:39:47,080 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:39:53,097 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 17:39:57,837 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 17:40:01,873 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 17:40:06,085 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 17:40:10,094 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 17:40:11,984 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:40:15,961 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:40:17,794 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:40:18,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:40:18,742 INFO L93 Difference]: Finished difference Result 3371 states and 13900 transitions. [2025-04-13 17:40:18,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 17:40:18,742 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 17:40:18,742 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:40:18,761 INFO L225 Difference]: With dead ends: 3371 [2025-04-13 17:40:18,761 INFO L226 Difference]: Without dead ends: 3119 [2025-04-13 17:40:18,764 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 44.4s TimeCoverageRelationStatistics Valid=173, Invalid=420, Unknown=7, NotChecked=0, Total=600 [2025-04-13 17:40:18,765 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 181 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 29 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:40:18,765 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 143 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 739 Invalid, 8 Unknown, 0 Unchecked, 56.3s Time] [2025-04-13 17:40:18,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3119 states. [2025-04-13 17:40:19,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3119 to 1761. [2025-04-13 17:40:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1761 states, 1760 states have (on average 4.430113636363636) internal successors, (7797), 1760 states have internal predecessors, (7797), 0 states have call successors, (0), 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 17:40:19,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 7797 transitions. [2025-04-13 17:40:19,075 INFO L79 Accepts]: Start accepts. Automaton has 1761 states and 7797 transitions. Word has length 24 [2025-04-13 17:40:19,075 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:40:19,075 INFO L485 AbstractCegarLoop]: Abstraction has 1761 states and 7797 transitions. [2025-04-13 17:40:19,075 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:40:19,075 INFO L278 IsEmpty]: Start isEmpty. Operand 1761 states and 7797 transitions. [2025-04-13 17:40:19,078 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 17:40:19,078 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:40:19,078 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 17:40:19,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 17:40:19,279 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:40:19,279 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 2 more)] === [2025-04-13 17:40:19,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:40:19,279 INFO L85 PathProgramCache]: Analyzing trace with hash -283151987, now seen corresponding path program 1 times [2025-04-13 17:40:19,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:40:19,280 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058573564] [2025-04-13 17:40:19,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:40:19,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:40:19,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 17:40:19,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 17:40:19,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:40:19,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:40:19,525 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 17:40:19,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:40:19,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058573564] [2025-04-13 17:40:19,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058573564] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:40:19,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758217024] [2025-04-13 17:40:19,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:40:19,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:40:19,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:40:19,527 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 17:40:19,528 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 17:40:19,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 17:40:19,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 17:40:19,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:40:19,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:40:19,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:40:19,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:42:24,456 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 17:42:24,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:42:35,749 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 17:42:35,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758217024] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:42:35,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:42:35,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-13 17:42:35,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278394682] [2025-04-13 17:42:35,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:42:35,750 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:42:35,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:42:35,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:42:35,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=168, Unknown=6, NotChecked=0, Total=240 [2025-04-13 17:42:35,750 INFO L87 Difference]: Start difference. First operand 1761 states and 7797 transitions. Second operand has 16 states, 15 states have (on average 4.4) internal successors, (66), 15 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 17:42:41,565 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:42:52,270 WARN L286 SmtUtils]: Spent 6.68s on a formula simplification. DAG size of input: 51 DAG size of output: 32 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 17:43:00,661 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:43:02,458 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 17:43:06,529 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 17:43:10,852 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:43:14,855 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 17:43:16,865 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:43:17,931 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:43:22,097 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 17:43:26,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 17:43:31,071 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.51s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:43:49,015 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 17:44:03,782 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 17:44:07,787 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 17:44:09,318 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:44:11,311 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:44:15,322 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 17:44:20,117 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 17:44:24,129 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 17:44:27,195 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:44:31,198 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 17:44:32,243 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:44:36,245 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 17:44:41,744 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 17:44:45,749 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 17:44:49,753 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 17:44:52,254 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:44:55,453 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:44:59,031 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:45:01,633 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:45:06,213 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 17:45:10,218 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 17:45:14,405 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 17:45:15,838 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 17:45:19,889 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 17:45:21,229 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:45:21,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:21,301 INFO L93 Difference]: Finished difference Result 3284 states and 13569 transitions. [2025-04-13 17:45:21,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 17:45:21,302 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.4) internal successors, (66), 15 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 24 [2025-04-13 17:45:21,302 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:21,316 INFO L225 Difference]: With dead ends: 3284 [2025-04-13 17:45:21,317 INFO L226 Difference]: Without dead ends: 2983 [2025-04-13 17:45:21,322 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 106.8s TimeCoverageRelationStatistics Valid=147, Invalid=395, Unknown=10, NotChecked=0, Total=552 [2025-04-13 17:45:21,323 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 244 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 29 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 122.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 122.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:21,323 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 117 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 688 Invalid, 19 Unknown, 0 Unchecked, 122.7s Time] [2025-04-13 17:45:21,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2025-04-13 17:45:21,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 2114. [2025-04-13 17:45:21,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2114 states, 2113 states have (on average 4.448177946048273) internal successors, (9399), 2113 states have internal predecessors, (9399), 0 states have call successors, (0), 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 17:45:21,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 9399 transitions. [2025-04-13 17:45:21,723 INFO L79 Accepts]: Start accepts. Automaton has 2114 states and 9399 transitions. Word has length 24 [2025-04-13 17:45:21,723 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:21,724 INFO L485 AbstractCegarLoop]: Abstraction has 2114 states and 9399 transitions. [2025-04-13 17:45:21,724 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.4) internal successors, (66), 15 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 17:45:21,724 INFO L278 IsEmpty]: Start isEmpty. Operand 2114 states and 9399 transitions. [2025-04-13 17:45:21,727 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 17:45:21,727 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:21,727 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 17:45:21,733 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 17:45:21,928 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:21,928 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 2 more)] === [2025-04-13 17:45:21,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:21,928 INFO L85 PathProgramCache]: Analyzing trace with hash -401729009, now seen corresponding path program 2 times [2025-04-13 17:45:21,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:21,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464049214] [2025-04-13 17:45:21,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:45:21,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:21,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 17:45:21,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 17:45:21,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:45:21,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:22,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 17:45:22,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:22,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464049214] [2025-04-13 17:45:22,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464049214] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:22,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456325569] [2025-04-13 17:45:22,077 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:45:22,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:22,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:22,079 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 17:45:22,080 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 17:45:22,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 17:45:22,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 17:45:22,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:45:22,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:22,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:45:22,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:23,584 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 17:45:23,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:23,873 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 17:45:23,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456325569] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:23,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:23,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 5, 5] total 11 [2025-04-13 17:45:23,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785666445] [2025-04-13 17:45:23,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:23,874 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:45:23,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:23,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:45:23,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:45:23,874 INFO L87 Difference]: Start difference. First operand 2114 states and 9399 transitions. Second operand has 13 states, 12 states have (on average 5.5) internal successors, (66), 12 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 17:45:30,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 17:45:35,365 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 17:45:38,937 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.57s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:45:43,109 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 17:45:48,132 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 17:45:52,151 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 17:45:56,392 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 17:45:57,973 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:45:58,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:58,471 INFO L93 Difference]: Finished difference Result 4482 states and 18462 transitions. [2025-04-13 17:45:58,471 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:45:58,471 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.5) internal successors, (66), 12 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 24 [2025-04-13 17:45:58,471 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:58,486 INFO L225 Difference]: With dead ends: 4482 [2025-04-13 17:45:58,486 INFO L226 Difference]: Without dead ends: 4125 [2025-04-13 17:45:58,488 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:45:58,488 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 219 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 30 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:58,488 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 108 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 635 Invalid, 6 Unknown, 0 Unchecked, 32.8s Time] [2025-04-13 17:45:58,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4125 states. [2025-04-13 17:45:59,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4125 to 2440. [2025-04-13 17:45:59,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 2439 states have (on average 4.51619516195162) internal successors, (11015), 2439 states have internal predecessors, (11015), 0 states have call successors, (0), 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 17:45:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 11015 transitions. [2025-04-13 17:45:59,105 INFO L79 Accepts]: Start accepts. Automaton has 2440 states and 11015 transitions. Word has length 24 [2025-04-13 17:45:59,106 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:59,106 INFO L485 AbstractCegarLoop]: Abstraction has 2440 states and 11015 transitions. [2025-04-13 17:45:59,106 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.5) internal successors, (66), 12 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 17:45:59,106 INFO L278 IsEmpty]: Start isEmpty. Operand 2440 states and 11015 transitions. [2025-04-13 17:45:59,110 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:45:59,110 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:59,110 INFO L218 NwaCegarLoop]: trace histogram [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 17:45:59,116 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 17:45:59,311 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-13 17:45:59,311 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 2 more)] === [2025-04-13 17:45:59,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:59,311 INFO L85 PathProgramCache]: Analyzing trace with hash 2099437386, now seen corresponding path program 3 times [2025-04-13 17:45:59,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:59,311 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965558575] [2025-04-13 17:45:59,311 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:45:59,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:59,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:45:59,322 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:45:59,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:45:59,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:45:59,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:59,414 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965558575] [2025-04-13 17:45:59,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965558575] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:59,415 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872287131] [2025-04-13 17:45:59,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:45:59,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:59,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:59,416 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 17:45:59,418 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 17:45:59,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:45:59,613 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:45:59,613 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:45:59,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:59,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:45:59,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:46:20,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:50,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:46:50,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872287131] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:46:50,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:46:50,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2025-04-13 17:46:50,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422500384] [2025-04-13 17:46:50,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:46:50,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:46:50,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:50,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:46:50,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=180, Unknown=12, NotChecked=0, Total=240 [2025-04-13 17:46:50,176 INFO L87 Difference]: Start difference. First operand 2440 states and 11015 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 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 17:46:57,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:57,480 INFO L93 Difference]: Finished difference Result 3405 states and 15039 transitions. [2025-04-13 17:46:57,481 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:46:57,481 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 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 25 [2025-04-13 17:46:57,481 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:57,491 INFO L225 Difference]: With dead ends: 3405 [2025-04-13 17:46:57,492 INFO L226 Difference]: Without dead ends: 3202 [2025-04-13 17:46:57,494 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 54.6s TimeCoverageRelationStatistics Valid=94, Invalid=313, Unknown=13, NotChecked=0, Total=420 [2025-04-13 17:46:57,495 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 147 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:57,495 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 138 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-04-13 17:46:57,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3202 states. [2025-04-13 17:46:58,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3202 to 2724. [2025-04-13 17:46:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2724 states, 2723 states have (on average 4.594197576202718) internal successors, (12510), 2723 states have internal predecessors, (12510), 0 states have call successors, (0), 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 17:46:58,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2724 states to 2724 states and 12510 transitions. [2025-04-13 17:46:58,085 INFO L79 Accepts]: Start accepts. Automaton has 2724 states and 12510 transitions. Word has length 25 [2025-04-13 17:46:58,085 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:58,085 INFO L485 AbstractCegarLoop]: Abstraction has 2724 states and 12510 transitions. [2025-04-13 17:46:58,085 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 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 17:46:58,085 INFO L278 IsEmpty]: Start isEmpty. Operand 2724 states and 12510 transitions. [2025-04-13 17:46:58,090 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:46:58,090 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:58,090 INFO L218 NwaCegarLoop]: trace histogram [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 17:46:58,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 17:46:58,290 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 17:46:58,291 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 2 more)] === [2025-04-13 17:46:58,291 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:58,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1881228014, now seen corresponding path program 4 times [2025-04-13 17:46:58,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:58,291 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679848554] [2025-04-13 17:46:58,291 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:46:58,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:58,295 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:46:58,303 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:46:58,303 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:46:58,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:58,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:46:58,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:58,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679848554] [2025-04-13 17:46:58,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679848554] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:58,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272684334] [2025-04-13 17:46:58,380 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:46:58,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:58,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:58,382 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:46:58,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 17:46:58,414 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:46:58,576 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:46:58,576 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:46:58,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:58,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:46:58,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:47:00,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:47:00,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:47:01,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:47:01,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272684334] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:47:01,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:47:01,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2025-04-13 17:47:01,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809248448] [2025-04-13 17:47:01,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:47:01,280 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:47:01,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:47:01,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:47:01,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:47:01,280 INFO L87 Difference]: Start difference. First operand 2724 states and 12510 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 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 17:47:04,413 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:47:07,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:47:07,223 INFO L93 Difference]: Finished difference Result 3536 states and 15527 transitions. [2025-04-13 17:47:07,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:47:07,224 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 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 25 [2025-04-13 17:47:07,224 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:47:07,234 INFO L225 Difference]: With dead ends: 3536 [2025-04-13 17:47:07,234 INFO L226 Difference]: Without dead ends: 3387 [2025-04-13 17:47:07,234 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:47:07,235 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 175 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:47:07,235 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 128 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-04-13 17:47:07,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3387 states. [2025-04-13 17:47:07,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3387 to 2680. [2025-04-13 17:47:07,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2680 states, 2679 states have (on average 4.585293019783501) internal successors, (12284), 2679 states have internal predecessors, (12284), 0 states have call successors, (0), 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 17:47:07,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 12284 transitions. [2025-04-13 17:47:07,813 INFO L79 Accepts]: Start accepts. Automaton has 2680 states and 12284 transitions. Word has length 25 [2025-04-13 17:47:07,813 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:47:07,813 INFO L485 AbstractCegarLoop]: Abstraction has 2680 states and 12284 transitions. [2025-04-13 17:47:07,813 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 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 17:47:07,813 INFO L278 IsEmpty]: Start isEmpty. Operand 2680 states and 12284 transitions. [2025-04-13 17:47:07,817 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:47:07,817 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:47:07,817 INFO L218 NwaCegarLoop]: trace histogram [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 17:47:07,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 17:47:08,019 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 17:47:08,019 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 2 more)] === [2025-04-13 17:47:08,019 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:47:08,019 INFO L85 PathProgramCache]: Analyzing trace with hash -917512098, now seen corresponding path program 5 times [2025-04-13 17:47:08,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:47:08,020 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848830169] [2025-04-13 17:47:08,020 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:47:08,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:47:08,023 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 3 equivalence classes. [2025-04-13 17:47:08,034 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:47:08,034 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:47:08,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:47:08,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:47:08,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848830169] [2025-04-13 17:47:08,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848830169] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:47:08,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369918537] [2025-04-13 17:47:08,100 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:47:08,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:08,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:47:08,101 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:47:08,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 17:47:08,131 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 3 equivalence classes. [2025-04-13 17:47:08,328 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:47:08,328 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:47:08,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:08,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 17:47:08,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:47:09,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:47:09,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:47:12,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:47:12,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369918537] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:47:12,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:47:12,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2025-04-13 17:47:12,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546329691] [2025-04-13 17:47:12,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:47:12,475 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:47:12,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:47:12,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:47:12,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:47:12,475 INFO L87 Difference]: Start difference. First operand 2680 states and 12284 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 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 17:47:16,861 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 17:47:21,645 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:47:24,109 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:47:28,123 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:47:31,328 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:47:36,507 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 17:47:54,277 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:47:56,730 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:48:06,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 17:48:10,103 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:48:16,796 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:48:20,835 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 17:48:24,849 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:48:27,619 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:48:31,735 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 17:48:36,875 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 17:48:41,660 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 17:48:45,784 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 17:48:48,640 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:48:52,867 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 17:48:55,232 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:48:59,681 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:49:03,687 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 17:49:10,432 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 17:49:14,550 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 17:49:15,845 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:49:21,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:49:21,250 INFO L93 Difference]: Finished difference Result 4898 states and 21096 transitions. [2025-04-13 17:49:21,251 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 17:49:21,251 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 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 25 [2025-04-13 17:49:21,251 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:49:21,263 INFO L225 Difference]: With dead ends: 4898 [2025-04-13 17:49:21,264 INFO L226 Difference]: Without dead ends: 4755 [2025-04-13 17:49:21,265 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 30.7s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:49:21,265 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 273 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 25 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 100.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 100.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:49:21,265 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 143 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 713 Invalid, 12 Unknown, 0 Unchecked, 100.1s Time] [2025-04-13 17:49:21,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4755 states. [2025-04-13 17:49:21,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4755 to 2879. [2025-04-13 17:49:21,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2879 states, 2878 states have (on average 4.667824878387769) internal successors, (13434), 2878 states have internal predecessors, (13434), 0 states have call successors, (0), 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 17:49:21,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2879 states to 2879 states and 13434 transitions. [2025-04-13 17:49:21,957 INFO L79 Accepts]: Start accepts. Automaton has 2879 states and 13434 transitions. Word has length 25 [2025-04-13 17:49:21,957 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:49:21,957 INFO L485 AbstractCegarLoop]: Abstraction has 2879 states and 13434 transitions. [2025-04-13 17:49:21,957 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 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 17:49:21,958 INFO L278 IsEmpty]: Start isEmpty. Operand 2879 states and 13434 transitions. [2025-04-13 17:49:21,963 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:49:21,963 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:49:21,963 INFO L218 NwaCegarLoop]: trace histogram [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 17:49:21,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 17:49:22,164 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 17:49:22,164 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 2 more)] === [2025-04-13 17:49:22,164 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:49:22,164 INFO L85 PathProgramCache]: Analyzing trace with hash -837433355, now seen corresponding path program 6 times [2025-04-13 17:49:22,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:49:22,164 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615339596] [2025-04-13 17:49:22,164 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:49:22,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:49:22,168 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:49:22,172 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:49:22,172 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 17:49:22,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:22,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:49:22,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:49:22,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615339596] [2025-04-13 17:49:22,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615339596] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:49:22,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089162791] [2025-04-13 17:49:22,244 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:49:22,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:22,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:49:22,246 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:49:22,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 17:49:22,276 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:49:22,306 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:49:22,306 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 17:49:22,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:22,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:49:22,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:49:23,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:49:23,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:49:24,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:49:24,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089162791] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:49:24,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:49:24,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2025-04-13 17:49:24,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945555478] [2025-04-13 17:49:24,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:49:24,555 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:49:24,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:49:24,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:49:24,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:49:24,555 INFO L87 Difference]: Start difference. First operand 2879 states and 13434 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 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 17:49:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:49:30,111 INFO L93 Difference]: Finished difference Result 3367 states and 15108 transitions. [2025-04-13 17:49:30,111 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 17:49:30,112 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 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 25 [2025-04-13 17:49:30,112 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:49:30,122 INFO L225 Difference]: With dead ends: 3367 [2025-04-13 17:49:30,122 INFO L226 Difference]: Without dead ends: 3123 [2025-04-13 17:49:30,123 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:49:30,124 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 212 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:49:30,124 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 108 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:49:30,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3123 states. [2025-04-13 17:49:30,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3123 to 2915. [2025-04-13 17:49:30,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2915 states, 2914 states have (on average 4.613589567604667) internal successors, (13444), 2914 states have internal predecessors, (13444), 0 states have call successors, (0), 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 17:49:30,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 13444 transitions. [2025-04-13 17:49:30,831 INFO L79 Accepts]: Start accepts. Automaton has 2915 states and 13444 transitions. Word has length 25 [2025-04-13 17:49:30,831 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:49:30,831 INFO L485 AbstractCegarLoop]: Abstraction has 2915 states and 13444 transitions. [2025-04-13 17:49:30,831 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 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 17:49:30,831 INFO L278 IsEmpty]: Start isEmpty. Operand 2915 states and 13444 transitions. [2025-04-13 17:49:30,836 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:49:30,837 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:49:30,837 INFO L218 NwaCegarLoop]: trace histogram [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 17:49:30,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 17:49:31,037 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 17:49:31,037 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 2 more)] === [2025-04-13 17:49:31,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:49:31,038 INFO L85 PathProgramCache]: Analyzing trace with hash 798150418, now seen corresponding path program 7 times [2025-04-13 17:49:31,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:49:31,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308255277] [2025-04-13 17:49:31,038 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:49:31,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:49:31,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 17:49:31,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:49:31,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:49:31,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:49:31,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:49:31,124 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308255277] [2025-04-13 17:49:31,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308255277] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:49:31,124 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948760284] [2025-04-13 17:49:31,124 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:49:31,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:31,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:49:31,125 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:49:31,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 17:49:31,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 17:49:31,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:49:31,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:49:31,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:31,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:49:31,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:49:35,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:49:35,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:49:35,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:49:35,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948760284] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:49:35,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:49:35,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-04-13 17:49:35,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973410585] [2025-04-13 17:49:35,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:49:35,756 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:49:35,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:49:35,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:49:35,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:49:35,757 INFO L87 Difference]: Start difference. First operand 2915 states and 13444 transitions. Second operand has 16 states, 16 states have (on average 4.5) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:37,733 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:49:41,108 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:49:42,810 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:49:45,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:49:45,554 INFO L93 Difference]: Finished difference Result 3549 states and 16028 transitions. [2025-04-13 17:49:45,554 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 17:49:45,554 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 17:49:45,554 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:49:45,564 INFO L225 Difference]: With dead ends: 3549 [2025-04-13 17:49:45,564 INFO L226 Difference]: Without dead ends: 3422 [2025-04-13 17:49:45,565 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:49:45,565 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 244 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:49:45,565 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 132 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2025-04-13 17:49:45,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3422 states. [2025-04-13 17:49:46,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3422 to 2926. [2025-04-13 17:49:46,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2925 states have (on average 4.585641025641026) internal successors, (13413), 2925 states have internal predecessors, (13413), 0 states have call successors, (0), 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 17:49:46,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 13413 transitions. [2025-04-13 17:49:46,304 INFO L79 Accepts]: Start accepts. Automaton has 2926 states and 13413 transitions. Word has length 25 [2025-04-13 17:49:46,304 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:49:46,305 INFO L485 AbstractCegarLoop]: Abstraction has 2926 states and 13413 transitions. [2025-04-13 17:49:46,305 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:46,305 INFO L278 IsEmpty]: Start isEmpty. Operand 2926 states and 13413 transitions. [2025-04-13 17:49:46,309 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:49:46,310 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:49:46,310 INFO L218 NwaCegarLoop]: trace histogram [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 17:49:46,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 17:49:46,510 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 17:49:46,510 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 2 more)] === [2025-04-13 17:49:46,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:49:46,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1418057071, now seen corresponding path program 3 times [2025-04-13 17:49:46,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:49:46,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249536463] [2025-04-13 17:49:46,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:49:46,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:49:46,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:49:46,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:49:46,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:49:46,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:46,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:49:46,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:49:46,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249536463] [2025-04-13 17:49:46,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249536463] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:49:46,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538623265] [2025-04-13 17:49:46,606 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:49:46,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:46,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:49:46,609 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:49:46,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 17:49:46,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:49:46,713 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:49:46,713 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:49:46,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:46,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:49:46,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:07,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:50:07,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:50:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:50:37,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538623265] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:50:37,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:50:37,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2025-04-13 17:50:37,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669891073] [2025-04-13 17:50:37,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:50:37,584 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:50:37,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:37,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:50:37,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=180, Unknown=12, NotChecked=0, Total=240 [2025-04-13 17:50:37,585 INFO L87 Difference]: Start difference. First operand 2926 states and 13413 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 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 17:50:45,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:45,936 INFO L93 Difference]: Finished difference Result 4980 states and 22229 transitions. [2025-04-13 17:50:45,936 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:50:45,937 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 17:50:45,937 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:45,949 INFO L225 Difference]: With dead ends: 4980 [2025-04-13 17:50:45,949 INFO L226 Difference]: Without dead ends: 4560 [2025-04-13 17:50:45,950 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 54.8s TimeCoverageRelationStatistics Valid=94, Invalid=313, Unknown=13, NotChecked=0, Total=420 [2025-04-13 17:50:45,951 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 226 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:45,951 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 118 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-04-13 17:50:45,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4560 states. [2025-04-13 17:50:46,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4560 to 3428. [2025-04-13 17:50:46,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3428 states, 3427 states have (on average 4.7029471841260575) internal successors, (16117), 3427 states have internal predecessors, (16117), 0 states have call successors, (0), 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 17:50:46,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3428 states to 3428 states and 16117 transitions. [2025-04-13 17:50:46,875 INFO L79 Accepts]: Start accepts. Automaton has 3428 states and 16117 transitions. Word has length 25 [2025-04-13 17:50:46,875 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:46,875 INFO L485 AbstractCegarLoop]: Abstraction has 3428 states and 16117 transitions. [2025-04-13 17:50:46,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 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 17:50:46,875 INFO L278 IsEmpty]: Start isEmpty. Operand 3428 states and 16117 transitions. [2025-04-13 17:50:46,881 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:50:46,881 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:46,881 INFO L218 NwaCegarLoop]: trace histogram [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 17:50:46,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-13 17:50:47,085 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:47,085 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 2 more)] === [2025-04-13 17:50:47,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:47,085 INFO L85 PathProgramCache]: Analyzing trace with hash 186246153, now seen corresponding path program 4 times [2025-04-13 17:50:47,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:47,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241541036] [2025-04-13 17:50:47,085 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:50:47,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:47,088 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:50:47,091 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:50:47,091 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:50:47,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:50:47,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:47,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241541036] [2025-04-13 17:50:47,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241541036] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:50:47,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055211296] [2025-04-13 17:50:47,158 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:50:47,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:47,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:47,160 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:50:47,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 17:50:47,191 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:50:47,502 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:50:47,502 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:50:47,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:47,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 17:50:47,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:50,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:50:50,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:51:06,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:51:06,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055211296] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:51:06,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:51:06,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2025-04-13 17:51:06,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712119944] [2025-04-13 17:51:06,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:51:06,209 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:51:06,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:51:06,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:51:06,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=171, Unknown=1, NotChecked=0, Total=240 [2025-04-13 17:51:06,210 INFO L87 Difference]: Start difference. First operand 3428 states and 16117 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 15 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:07,721 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:51:10,487 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:51:32,411 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:51:34,883 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:51:37,933 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:51:43,456 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 17:51:46,542 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:51:59,657 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:52:02,243 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:52:04,714 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:52:08,744 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 17:52:12,746 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 17:52:16,750 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 17:52:20,754 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 17:52:24,760 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 17:52:28,763 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 17:52:32,767 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 17:52:43,394 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2025-04-13 17:52:44,677 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 17:52:44,722 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 17:52:45,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-13 17:52:45,877 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-13 17:52:45,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2025-04-13 17:52:45,891 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 52.0s TimeCoverageRelationStatistics Valid=199, Invalid=551, Unknown=6, NotChecked=0, Total=756 [2025-04-13 17:52:45,892 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 218 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 32 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 63.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:52:45,892 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 83 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 420 Invalid, 8 Unknown, 0 Unchecked, 63.5s Time] [2025-04-13 17:52:45,893 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 17:52:45,893 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 17:52:45,893 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-13 17:52:45,894 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 17:52:45,894 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 17:52:45,896 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 17:52:45,896 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 17:52:45,898 INFO L422 BasicCegarLoop]: Path program histogram: [7, 4, 2, 2, 2, 2, 1] [2025-04-13 17:52:45,900 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 17:52:45,901 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 17:52:45,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:52:45 BasicIcfg [2025-04-13 17:52:45,903 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 17:52:45,903 INFO L158 Benchmark]: Toolchain (without parser) took 876792.15ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 101.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 742.5MB. Max. memory is 8.0GB. [2025-04-13 17:52:45,904 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:52:45,904 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.18ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 86.1MB in the end (delta: 14.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 17:52:45,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.74ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 84.5MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 17:52:45,904 INFO L158 Benchmark]: Boogie Preprocessor took 36.92ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 82.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:52:45,904 INFO L158 Benchmark]: RCFGBuilder took 405.37ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 50.1MB in the end (delta: 32.7MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-13 17:52:45,904 INFO L158 Benchmark]: TraceAbstraction took 876100.23ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 49.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 692.1MB. Max. memory is 8.0GB. [2025-04-13 17:52:45,905 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.15ms. Allocated memory is still 155.2MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.18ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 86.1MB in the end (delta: 14.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.74ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 84.5MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.92ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 82.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 405.37ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 50.1MB in the end (delta: 32.7MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 876100.23ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 49.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 692.1MB. 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: 104]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 44 locations, 51 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 876.0s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 542.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 53 mSolverCounterUnknown, 2655 SdHoareTripleChecker+Valid, 396.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2655 mSDsluCounter, 1533 SdHoareTripleChecker+Invalid, 395.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1265 mSDsCounter, 233 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7657 IncrementalHoareTripleChecker+Invalid, 7944 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 233 mSolverCounterUnsat, 268 mSDtfsCounter, 7657 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 868 GetRequests, 594 SyntacticMatches, 9 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1231 ImplicationChecksByTransitivity, 360.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3428occurred in iteration=19, InterpolantAutomatonStates: 207, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 10274 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 321.3s InterpolantComputationTime, 840 NumberOfCodeBlocks, 840 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 1153 ConstructedInterpolants, 0 QuantifiedInterpolants, 20446 SizeOfPredicates, 33 NumberOfNonLiveVariables, 2379 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 50 InterpolantComputations, 5 PerfectInterpolantSequences, 18/136 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