/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:58:47,614 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:58:47,667 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 21:58:47,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:58:47,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:58:47,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:58:47,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:58:47,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:58:47,692 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:58:47,693 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:58:47,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:58:47,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:58:47,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:58:47,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:58:47,693 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:58:47,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:58:47,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:58:47,693 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:58:47,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:58:47,694 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:58:47,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:58:47,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:58:47,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:58:47,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:58:47,695 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:58:47,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:58:47,695 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:58:47,695 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:58:47,695 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:58:47,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:58:47,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:58:47,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:58:47,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:58:47,695 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:58:47,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:58:47,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:58:47,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:58:47,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:58:47,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:58:47,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:58:47,695 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:58:47,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:58:47,695 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:58:47,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:58:47,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:58:47,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:58:47,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:58:47,696 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 21:58:47,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:58:47,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:58:47,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:58:47,910 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:58:47,911 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:58:47,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2025-04-13 21:58:49,175 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/646f674b5/2ac30510ac91407c864f674e04f6175e/FLAG53e96bf69 [2025-04-13 21:58:49,385 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:58:49,387 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2025-04-13 21:58:49,394 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/646f674b5/2ac30510ac91407c864f674e04f6175e/FLAG53e96bf69 [2025-04-13 21:58:50,226 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/646f674b5/2ac30510ac91407c864f674e04f6175e [2025-04-13 21:58:50,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:58:50,229 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:58:50,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:58:50,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:58:50,233 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:58:50,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:58:50" (1/1) ... [2025-04-13 21:58:50,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49732e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:50, skipping insertion in model container [2025-04-13 21:58:50,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:58:50" (1/1) ... [2025-04-13 21:58:50,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:58:50,393 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-exp1x3.wvr.c[1875,1888] [2025-04-13 21:58:50,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:58:50,403 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:58:50,423 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-exp1x3.wvr.c[1875,1888] [2025-04-13 21:58:50,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:58:50,432 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:58:50,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:50 WrapperNode [2025-04-13 21:58:50,433 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:58:50,434 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:58:50,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:58:50,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:58:50,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:50" (1/1) ... [2025-04-13 21:58:50,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:50" (1/1) ... [2025-04-13 21:58:50,455 INFO L138 Inliner]: procedures = 17, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2025-04-13 21:58:50,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:58:50,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:58:50,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:58:50,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:58:50,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:50" (1/1) ... [2025-04-13 21:58:50,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:50" (1/1) ... [2025-04-13 21:58:50,462 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:50" (1/1) ... [2025-04-13 21:58:50,474 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 21:58:50,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:50" (1/1) ... [2025-04-13 21:58:50,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:50" (1/1) ... [2025-04-13 21:58:50,478 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:50" (1/1) ... [2025-04-13 21:58:50,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:50" (1/1) ... [2025-04-13 21:58:50,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:50" (1/1) ... [2025-04-13 21:58:50,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:50" (1/1) ... [2025-04-13 21:58:50,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:58:50,485 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:58:50,485 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:58:50,485 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:58:50,487 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:50" (1/1) ... [2025-04-13 21:58:50,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:58:50,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:58:50,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 21:58:50,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 21:58:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:58:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 21:58:50,526 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 21:58:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 21:58:50,526 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 21:58:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:58:50,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:58:50,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:58:50,527 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:58:50,579 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:58:50,580 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:58:50,692 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:58:50,693 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:58:50,693 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:58:50,787 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:58:50,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:58:50 BoogieIcfgContainer [2025-04-13 21:58:50,788 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:58:50,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:58:50,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:58:50,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:58:50,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:58:50" (1/3) ... [2025-04-13 21:58:50,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b2b357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:58:50, skipping insertion in model container [2025-04-13 21:58:50,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:50" (2/3) ... [2025-04-13 21:58:50,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b2b357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:58:50, skipping insertion in model container [2025-04-13 21:58:50,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:58:50" (3/3) ... [2025-04-13 21:58:50,795 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2025-04-13 21:58:50,804 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:58:50,805 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp1x3.wvr.c that has 3 procedures, 16 locations, 15 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 21:58:50,805 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:58:50,834 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 21:58:50,855 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 22 places, 17 transitions, 48 flow [2025-04-13 21:58:50,865 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 31 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 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 21:58:50,886 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:58:50,893 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;@68b77e58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:58:50,893 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:58:50,896 INFO L278 IsEmpty]: Start isEmpty. Operand has 31 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 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 21:58:50,899 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 21:58:50,899 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:50,900 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:50,900 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:58:50,903 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:50,903 INFO L85 PathProgramCache]: Analyzing trace with hash 179144664, now seen corresponding path program 1 times [2025-04-13 21:58:50,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:50,908 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345287135] [2025-04-13 21:58:50,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:50,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:50,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 21:58:50,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 21:58:50,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:50,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:51,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:51,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:51,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345287135] [2025-04-13 21:58:51,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345287135] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:51,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:51,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:58:51,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697571332] [2025-04-13 21:58:51,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:51,104 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:58:51,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:51,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:58:51,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:58:51,118 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 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) Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:51,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:51,174 INFO L93 Difference]: Finished difference Result 56 states and 123 transitions. [2025-04-13 21:58:51,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:58:51,175 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-13 21:58:51,175 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:51,179 INFO L225 Difference]: With dead ends: 56 [2025-04-13 21:58:51,180 INFO L226 Difference]: Without dead ends: 51 [2025-04-13 21:58:51,181 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:58:51,183 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:51,183 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 21:58:51,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-04-13 21:58:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-04-13 21:58:51,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 2.28) internal successors, (114), 50 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:51,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 114 transitions. [2025-04-13 21:58:51,208 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 114 transitions. Word has length 12 [2025-04-13 21:58:51,208 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:51,208 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 114 transitions. [2025-04-13 21:58:51,208 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:51,208 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 114 transitions. [2025-04-13 21:58:51,209 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 21:58:51,209 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:51,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:51,209 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:58:51,209 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:58:51,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:51,210 INFO L85 PathProgramCache]: Analyzing trace with hash 514424587, now seen corresponding path program 1 times [2025-04-13 21:58:51,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:51,210 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046404086] [2025-04-13 21:58:51,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:51,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:51,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 21:58:51,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 21:58:51,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:51,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:51,355 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 21:58:51,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:51,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046404086] [2025-04-13 21:58:51,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046404086] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:58:51,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787290715] [2025-04-13 21:58:51,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:51,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:58:51,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:58:51,357 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 21:58:51,359 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 21:58:51,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 21:58:51,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 21:58:51,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:51,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:51,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 21:58:51,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:58:51,529 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 21:58:51,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:58:51,582 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 21:58:51,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787290715] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:58:51,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:58:51,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 21:58:51,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469834302] [2025-04-13 21:58:51,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:58:51,583 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:58:51,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:51,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:58:51,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:58:51,584 INFO L87 Difference]: Start difference. First operand 51 states and 114 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:51,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:51,672 INFO L93 Difference]: Finished difference Result 71 states and 152 transitions. [2025-04-13 21:58:51,672 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:58:51,672 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-13 21:58:51,673 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:51,673 INFO L225 Difference]: With dead ends: 71 [2025-04-13 21:58:51,673 INFO L226 Difference]: Without dead ends: 63 [2025-04-13 21:58:51,674 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 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 21:58:51,674 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:51,674 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 11 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:58:51,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-04-13 21:58:51,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 51. [2025-04-13 21:58:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 118 transitions. [2025-04-13 21:58:51,686 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 118 transitions. Word has length 13 [2025-04-13 21:58:51,686 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:51,686 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 118 transitions. [2025-04-13 21:58:51,686 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:51,686 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 118 transitions. [2025-04-13 21:58:51,687 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 21:58:51,687 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:51,687 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:51,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 21:58:51,892 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:58:51,892 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:58:51,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:51,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1257327450, now seen corresponding path program 1 times [2025-04-13 21:58:51,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:51,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363068867] [2025-04-13 21:58:51,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:51,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:51,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 21:58:51,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 21:58:51,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:51,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:51,973 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 21:58:51,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:51,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363068867] [2025-04-13 21:58:51,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363068867] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:51,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:51,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:58:51,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717807893] [2025-04-13 21:58:51,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:51,974 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:58:51,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:51,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:58:51,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:58:51,975 INFO L87 Difference]: Start difference. First operand 51 states and 118 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:52,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:52,038 INFO L93 Difference]: Finished difference Result 62 states and 133 transitions. [2025-04-13 21:58:52,039 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:58:52,039 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-04-13 21:58:52,039 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:52,039 INFO L225 Difference]: With dead ends: 62 [2025-04-13 21:58:52,039 INFO L226 Difference]: Without dead ends: 51 [2025-04-13 21:58:52,040 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:58:52,040 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:52,040 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 9 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 21:58:52,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-04-13 21:58:52,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-04-13 21:58:52,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 2.28) internal successors, (114), 50 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 114 transitions. [2025-04-13 21:58:52,051 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 114 transitions. Word has length 13 [2025-04-13 21:58:52,051 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:52,051 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 114 transitions. [2025-04-13 21:58:52,051 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:52,051 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 114 transitions. [2025-04-13 21:58:52,051 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 21:58:52,051 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:52,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:52,052 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:58:52,052 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:58:52,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:52,052 INFO L85 PathProgramCache]: Analyzing trace with hash 328660974, now seen corresponding path program 2 times [2025-04-13 21:58:52,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:52,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477083219] [2025-04-13 21:58:52,052 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:58:52,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:52,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 21:58:52,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 21:58:52,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:58:52,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:52,126 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 21:58:52,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:52,126 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477083219] [2025-04-13 21:58:52,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477083219] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:58:52,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904944140] [2025-04-13 21:58:52,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:58:52,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:58:52,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:58:52,129 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 21:58:52,131 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 21:58:52,156 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 21:58:52,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 21:58:52,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:58:52,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:52,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 21:58:52,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:58:52,244 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 21:58:52,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:58:52,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 21:58:52,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904944140] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:58:52,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:58:52,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 21:58:52,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102648717] [2025-04-13 21:58:52,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:58:52,275 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:58:52,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:52,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:58:52,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:58:52,276 INFO L87 Difference]: Start difference. First operand 51 states and 114 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 21:58:52,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:52,339 INFO L93 Difference]: Finished difference Result 63 states and 140 transitions. [2025-04-13 21:58:52,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:58:52,339 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 13 [2025-04-13 21:58:52,339 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:52,339 INFO L225 Difference]: With dead ends: 63 [2025-04-13 21:58:52,340 INFO L226 Difference]: Without dead ends: 56 [2025-04-13 21:58:52,340 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 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 21:58:52,340 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 17 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:52,340 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 11 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 21:58:52,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-13 21:58:52,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2025-04-13 21:58:52,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 2.425531914893617) internal successors, (114), 47 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 114 transitions. [2025-04-13 21:58:52,347 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 114 transitions. Word has length 13 [2025-04-13 21:58:52,347 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:52,347 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 114 transitions. [2025-04-13 21:58:52,347 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 21:58:52,347 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 114 transitions. [2025-04-13 21:58:52,347 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 21:58:52,347 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:52,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:52,353 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 21:58:52,551 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-13 21:58:52,551 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:58:52,551 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:52,551 INFO L85 PathProgramCache]: Analyzing trace with hash 356455977, now seen corresponding path program 2 times [2025-04-13 21:58:52,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:52,552 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504858087] [2025-04-13 21:58:52,552 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:58:52,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:52,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 21:58:52,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 21:58:52,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:58:52,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:52,591 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 21:58:52,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:52,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504858087] [2025-04-13 21:58:52,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504858087] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:52,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:52,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:58:52,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93612374] [2025-04-13 21:58:52,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:52,592 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:58:52,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:52,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:58:52,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:58:52,593 INFO L87 Difference]: Start difference. First operand 48 states and 114 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:52,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:52,644 INFO L93 Difference]: Finished difference Result 64 states and 138 transitions. [2025-04-13 21:58:52,644 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:58:52,644 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-04-13 21:58:52,644 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:52,645 INFO L225 Difference]: With dead ends: 64 [2025-04-13 21:58:52,645 INFO L226 Difference]: Without dead ends: 48 [2025-04-13 21:58:52,645 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:58:52,645 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 14 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:52,645 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 9 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 21:58:52,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-13 21:58:52,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-04-13 21:58:52,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 2.297872340425532) internal successors, (108), 47 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:52,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 108 transitions. [2025-04-13 21:58:52,655 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 108 transitions. Word has length 13 [2025-04-13 21:58:52,655 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:52,655 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 108 transitions. [2025-04-13 21:58:52,655 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:52,655 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 108 transitions. [2025-04-13 21:58:52,655 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 21:58:52,655 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:52,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:52,655 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:58:52,655 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:58:52,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:52,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1233896825, now seen corresponding path program 1 times [2025-04-13 21:58:52,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:52,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921057851] [2025-04-13 21:58:52,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:52,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:52,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 21:58:52,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:58:52,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:52,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:52,937 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 21:58:52,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:52,937 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921057851] [2025-04-13 21:58:52,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921057851] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:58:52,937 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351024666] [2025-04-13 21:58:52,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:52,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:58:52,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:58:52,940 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 21:58:52,941 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 21:58:52,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 21:58:53,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:58:53,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:53,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:53,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 21:58:53,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:19,627 WARN L286 SmtUtils]: Spent 11.65s on a formula simplification. DAG size of input: 28 DAG size of output: 27 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:00:51,272 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 22:00:51,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:01:16,228 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 22:01:16,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351024666] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:01:16,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:01:16,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 14 [2025-04-13 22:01:16,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782933203] [2025-04-13 22:01:16,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:01:16,229 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:01:16,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:16,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:01:16,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=167, Unknown=18, NotChecked=0, Total=240 [2025-04-13 22:01:16,230 INFO L87 Difference]: Start difference. First operand 48 states and 108 transitions. Second operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 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 22:01:20,999 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 22:01:40,636 WARN L286 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 42 DAG size of output: 24 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:01:45,413 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:01:46,639 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 22:01:50,124 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:01:53,472 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:02:01,583 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 34 DAG size of output: 29 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:02:01,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:02:01,967 INFO L93 Difference]: Finished difference Result 141 states and 308 transitions. [2025-04-13 22:02:01,967 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:02:01,967 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 22:02:01,967 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:02:01,968 INFO L225 Difference]: With dead ends: 141 [2025-04-13 22:02:01,968 INFO L226 Difference]: Without dead ends: 116 [2025-04-13 22:02:01,968 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 133.4s TimeCoverageRelationStatistics Valid=113, Invalid=329, Unknown=20, NotChecked=0, Total=462 [2025-04-13 22:02:01,969 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 56 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:02:01,969 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 47 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 345 Invalid, 1 Unknown, 0 Unchecked, 15.7s Time] [2025-04-13 22:02:01,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-04-13 22:02:01,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 64. [2025-04-13 22:02:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 2.5714285714285716) internal successors, (162), 63 states have internal predecessors, (162), 0 states have call successors, (0), 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 22:02:01,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 162 transitions. [2025-04-13 22:02:01,979 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 162 transitions. Word has length 14 [2025-04-13 22:02:01,979 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:02:01,979 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 162 transitions. [2025-04-13 22:02:01,979 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 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 22:02:01,979 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 162 transitions. [2025-04-13 22:02:01,979 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 22:02:01,979 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:02:01,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:02:01,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 22:02:02,184 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:02,184 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:02:02,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:02:02,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1572430697, now seen corresponding path program 2 times [2025-04-13 22:02:02,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:02:02,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075642313] [2025-04-13 22:02:02,185 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:02:02,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:02:02,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 22:02:02,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 22:02:02,194 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:02:02,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:02,367 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 22:02:02,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:02:02,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075642313] [2025-04-13 22:02:02,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075642313] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:02:02,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097138117] [2025-04-13 22:02:02,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:02:02,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:02,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:02:02,370 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 22:02:02,371 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 22:02:02,394 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 22:02:02,427 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 22:02:02,427 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:02:02,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:02,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 22:02:02,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:02:04,204 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 22:02:04,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:02:04,512 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 22:02:04,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097138117] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:02:04,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:02:04,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-04-13 22:02:04,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866288180] [2025-04-13 22:02:04,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:02:04,513 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 22:02:04,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:02:04,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 22:02:04,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:02:04,514 INFO L87 Difference]: Start difference. First operand 64 states and 162 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 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 22:02:10,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:02:10,686 INFO L93 Difference]: Finished difference Result 192 states and 430 transitions. [2025-04-13 22:02:10,686 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:02:10,686 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 22:02:10,686 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:02:10,687 INFO L225 Difference]: With dead ends: 192 [2025-04-13 22:02:10,687 INFO L226 Difference]: Without dead ends: 161 [2025-04-13 22:02:10,688 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=171, Invalid=429, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:02:10,688 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 88 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:02:10,688 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 30 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-04-13 22:02:10,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-04-13 22:02:10,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 92. [2025-04-13 22:02:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 2.7032967032967035) internal successors, (246), 91 states have internal predecessors, (246), 0 states have call successors, (0), 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 22:02:10,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 246 transitions. [2025-04-13 22:02:10,715 INFO L79 Accepts]: Start accepts. Automaton has 92 states and 246 transitions. Word has length 14 [2025-04-13 22:02:10,715 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:02:10,715 INFO L485 AbstractCegarLoop]: Abstraction has 92 states and 246 transitions. [2025-04-13 22:02:10,715 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 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 22:02:10,715 INFO L278 IsEmpty]: Start isEmpty. Operand 92 states and 246 transitions. [2025-04-13 22:02:10,715 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 22:02:10,715 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:02:10,716 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:02:10,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 22:02:10,920 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:10,920 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:02:10,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:02:10,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1678824567, now seen corresponding path program 3 times [2025-04-13 22:02:10,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:02:10,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124479672] [2025-04-13 22:02:10,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:02:10,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:02:10,924 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 22:02:10,930 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 22:02:10,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:02:10,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:11,001 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 22:02:11,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:02:11,002 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124479672] [2025-04-13 22:02:11,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124479672] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:02:11,002 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481590709] [2025-04-13 22:02:11,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:02:11,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:11,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:02:11,004 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 22:02:11,007 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 22:02:11,027 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 22:02:11,039 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 22:02:11,039 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:02:11,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:11,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 22:02:11,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:02:11,251 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 22:02:11,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:02:11,300 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 22:02:11,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481590709] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:02:11,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:02:11,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 22:02:11,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125541770] [2025-04-13 22:02:11,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:02:11,301 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:02:11,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:02:11,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:02:11,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:02:11,302 INFO L87 Difference]: Start difference. First operand 92 states and 246 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 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 22:02:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:02:11,666 INFO L93 Difference]: Finished difference Result 152 states and 377 transitions. [2025-04-13 22:02:11,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:02:11,666 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 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 15 [2025-04-13 22:02:11,666 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:02:11,667 INFO L225 Difference]: With dead ends: 152 [2025-04-13 22:02:11,667 INFO L226 Difference]: Without dead ends: 123 [2025-04-13 22:02:11,667 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:02:11,668 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:02:11,668 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 25 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:02:11,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-04-13 22:02:11,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 102. [2025-04-13 22:02:11,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 2.762376237623762) internal successors, (279), 101 states have internal predecessors, (279), 0 states have call successors, (0), 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 22:02:11,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 279 transitions. [2025-04-13 22:02:11,687 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 279 transitions. Word has length 15 [2025-04-13 22:02:11,687 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:02:11,687 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 279 transitions. [2025-04-13 22:02:11,687 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 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 22:02:11,687 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 279 transitions. [2025-04-13 22:02:11,687 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 22:02:11,687 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:02:11,688 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:02:11,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 22:02:11,888 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:11,888 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:02:11,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:02:11,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1568002047, now seen corresponding path program 4 times [2025-04-13 22:02:11,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:02:11,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552496153] [2025-04-13 22:02:11,889 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:02:11,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:02:11,892 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 22:02:11,897 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 22:02:11,897 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:02:11,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:11,967 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 22:02:11,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:02:11,968 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552496153] [2025-04-13 22:02:11,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552496153] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:02:11,968 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033779388] [2025-04-13 22:02:11,968 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:02:11,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:11,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:02:11,970 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 22:02:11,971 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 22:02:12,000 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 22:02:12,019 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 22:02:12,019 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:02:12,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:12,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 22:02:12,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:02:16,212 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 22:02:16,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:02:16,297 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 22:02:16,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033779388] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:02:16,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:02:16,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 22:02:16,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182905781] [2025-04-13 22:02:16,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:02:16,298 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:02:16,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:02:16,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:02:16,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=98, Unknown=1, NotChecked=0, Total=132 [2025-04-13 22:02:16,298 INFO L87 Difference]: Start difference. First operand 102 states and 279 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 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 22:02:16,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:02:16,629 INFO L93 Difference]: Finished difference Result 148 states and 367 transitions. [2025-04-13 22:02:16,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:02:16,629 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 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 15 [2025-04-13 22:02:16,629 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:02:16,630 INFO L225 Difference]: With dead ends: 148 [2025-04-13 22:02:16,630 INFO L226 Difference]: Without dead ends: 137 [2025-04-13 22:02:16,630 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=43, Invalid=138, Unknown=1, NotChecked=0, Total=182 [2025-04-13 22:02:16,631 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 35 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:02:16,631 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 31 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:02:16,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-04-13 22:02:16,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 100. [2025-04-13 22:02:16,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.727272727272727) internal successors, (270), 99 states have internal predecessors, (270), 0 states have call successors, (0), 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 22:02:16,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 270 transitions. [2025-04-13 22:02:16,654 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 270 transitions. Word has length 15 [2025-04-13 22:02:16,654 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:02:16,654 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 270 transitions. [2025-04-13 22:02:16,655 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 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 22:02:16,655 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 270 transitions. [2025-04-13 22:02:16,655 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 22:02:16,656 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:02:16,656 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:02:16,662 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 22:02:16,858 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:16,859 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:02:16,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:02:16,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1386017803, now seen corresponding path program 5 times [2025-04-13 22:02:16,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:02:16,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377549374] [2025-04-13 22:02:16,859 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:02:16,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:02:16,862 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 3 equivalence classes. [2025-04-13 22:02:16,867 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 22:02:16,867 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:02:16,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:16,963 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 22:02:16,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:02:16,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377549374] [2025-04-13 22:02:16,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377549374] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:02:16,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869224579] [2025-04-13 22:02:16,964 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:02:16,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:16,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:02:16,966 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 22:02:16,967 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 22:02:16,988 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 3 equivalence classes. [2025-04-13 22:02:17,173 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 22:02:17,173 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:02:17,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:17,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 22:02:17,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:02:17,401 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 22:02:17,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:02:17,915 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 22:02:17,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869224579] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:02:17,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:02:17,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 22:02:17,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075063728] [2025-04-13 22:02:17,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:02:17,916 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:02:17,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:02:17,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:02:17,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:02:17,917 INFO L87 Difference]: Start difference. First operand 100 states and 270 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:21,204 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:02:25,230 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 22:02:29,572 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 22:02:29,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:02:29,777 INFO L93 Difference]: Finished difference Result 149 states and 374 transitions. [2025-04-13 22:02:29,778 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:02:29,778 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 22:02:29,778 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:02:29,779 INFO L225 Difference]: With dead ends: 149 [2025-04-13 22:02:29,779 INFO L226 Difference]: Without dead ends: 140 [2025-04-13 22:02:29,779 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:02:29,779 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 69 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:02:29,779 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 25 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 238 Invalid, 2 Unknown, 0 Unchecked, 11.7s Time] [2025-04-13 22:02:29,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-04-13 22:02:29,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 100. [2025-04-13 22:02:29,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.707070707070707) internal successors, (268), 99 states have internal predecessors, (268), 0 states have call successors, (0), 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 22:02:29,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 268 transitions. [2025-04-13 22:02:29,808 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 268 transitions. Word has length 15 [2025-04-13 22:02:29,808 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:02:29,808 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 268 transitions. [2025-04-13 22:02:29,809 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:29,809 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 268 transitions. [2025-04-13 22:02:29,809 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 22:02:29,809 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:02:29,809 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:02:29,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 22:02:30,014 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:30,014 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:02:30,014 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:02:30,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1190605787, now seen corresponding path program 6 times [2025-04-13 22:02:30,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:02:30,015 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846231919] [2025-04-13 22:02:30,015 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:02:30,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:02:30,018 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 3 equivalence classes. [2025-04-13 22:02:30,027 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 22:02:30,028 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:02:30,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:30,156 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 22:02:30,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:02:30,156 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846231919] [2025-04-13 22:02:30,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846231919] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:02:30,156 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246060640] [2025-04-13 22:02:30,156 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:02:30,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:30,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:02:30,158 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 22:02:30,159 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 22:02:30,184 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 3 equivalence classes. [2025-04-13 22:02:30,443 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 22:02:30,443 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:02:30,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:30,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 22:02:30,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:02:56,711 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 22:02:56,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:03:01,056 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 22:03:01,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246060640] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:03:01,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:03:01,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-04-13 22:03:01,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119711676] [2025-04-13 22:03:01,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:03:01,057 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 22:03:01,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:03:01,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 22:03:01,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=207, Unknown=3, NotChecked=0, Total=272 [2025-04-13 22:03:01,057 INFO L87 Difference]: Start difference. First operand 100 states and 268 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 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 22:03:15,963 WARN L286 SmtUtils]: Spent 12.11s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:03:20,758 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 22:03:48,831 WARN L286 SmtUtils]: Spent 16.88s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:03:57,617 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 22:03:59,969 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:04:02,403 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:04:16,681 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 22:04:20,935 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 22:04:24,937 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 22:04:28,898 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.96s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:04:31,956 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:04:36,057 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 22:04:53,758 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 22:04:56,929 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:05:00,934 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 22:05:02,619 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:05:20,235 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:05:25,249 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 22:05:38,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 22:05:42,438 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 22:05:46,471 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 22:05:47,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:05:47,009 INFO L93 Difference]: Finished difference Result 288 states and 675 transitions. [2025-04-13 22:05:47,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:05:47,010 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 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 15 [2025-04-13 22:05:47,010 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:05:47,011 INFO L225 Difference]: With dead ends: 288 [2025-04-13 22:05:47,011 INFO L226 Difference]: Without dead ends: 275 [2025-04-13 22:05:47,011 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 114.3s TimeCoverageRelationStatistics Valid=257, Invalid=857, Unknown=8, NotChecked=0, Total=1122 [2025-04-13 22:05:47,012 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 154 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 26 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 77.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 77.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:05:47,012 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 51 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 588 Invalid, 11 Unknown, 0 Unchecked, 77.4s Time] [2025-04-13 22:05:47,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-04-13 22:05:47,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 124. [2025-04-13 22:05:47,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 2.951219512195122) internal successors, (363), 123 states have internal predecessors, (363), 0 states have call successors, (0), 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 22:05:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 363 transitions. [2025-04-13 22:05:47,055 INFO L79 Accepts]: Start accepts. Automaton has 124 states and 363 transitions. Word has length 15 [2025-04-13 22:05:47,055 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:05:47,055 INFO L485 AbstractCegarLoop]: Abstraction has 124 states and 363 transitions. [2025-04-13 22:05:47,055 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 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 22:05:47,055 INFO L278 IsEmpty]: Start isEmpty. Operand 124 states and 363 transitions. [2025-04-13 22:05:47,056 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 22:05:47,056 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:05:47,056 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:05:47,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 22:05:47,256 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,SelfDestructingSolverStorable10 [2025-04-13 22:05:47,257 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:05:47,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:05:47,257 INFO L85 PathProgramCache]: Analyzing trace with hash -301255064, now seen corresponding path program 7 times [2025-04-13 22:05:47,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:05:47,257 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175939307] [2025-04-13 22:05:47,257 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:05:47,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:05:47,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 22:05:47,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 22:05:47,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:05:47,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:05:47,345 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 22:05:47,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:05:47,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175939307] [2025-04-13 22:05:47,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175939307] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:05:47,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757920485] [2025-04-13 22:05:47,346 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:05:47,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:05:47,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:05:47,348 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 22:05:47,349 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 22:05:47,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 22:05:48,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 22:05:48,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:05:48,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:05:48,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 22:05:48,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:05:50,092 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 22:05:50,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:05:50,762 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 22:05:50,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757920485] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:05:50,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:05:50,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 14 [2025-04-13 22:05:50,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733731236] [2025-04-13 22:05:50,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:05:50,763 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 22:05:50,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:05:50,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 22:05:50,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:05:50,763 INFO L87 Difference]: Start difference. First operand 124 states and 363 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 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 22:05:53,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:05:53,647 INFO L93 Difference]: Finished difference Result 249 states and 663 transitions. [2025-04-13 22:05:53,648 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:05:53,648 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 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 15 [2025-04-13 22:05:53,648 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:05:53,649 INFO L225 Difference]: With dead ends: 249 [2025-04-13 22:05:53,649 INFO L226 Difference]: Without dead ends: 183 [2025-04-13 22:05:53,650 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:05:53,650 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 118 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:05:53,650 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 32 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 22:05:53,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-04-13 22:05:53,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 116. [2025-04-13 22:05:53,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 2.8086956521739133) internal successors, (323), 115 states have internal predecessors, (323), 0 states have call successors, (0), 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 22:05:53,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 323 transitions. [2025-04-13 22:05:53,683 INFO L79 Accepts]: Start accepts. Automaton has 116 states and 323 transitions. Word has length 15 [2025-04-13 22:05:53,683 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:05:53,683 INFO L485 AbstractCegarLoop]: Abstraction has 116 states and 323 transitions. [2025-04-13 22:05:53,683 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 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 22:05:53,683 INFO L278 IsEmpty]: Start isEmpty. Operand 116 states and 323 transitions. [2025-04-13 22:05:53,683 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 22:05:53,683 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:05:53,683 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:05:53,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 22:05:53,884 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:05:53,884 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:05:53,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:05:53,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1367030152, now seen corresponding path program 8 times [2025-04-13 22:05:53,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:05:53,884 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897533563] [2025-04-13 22:05:53,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:05:53,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:05:53,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 22:05:53,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 22:05:53,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:05:53,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:05:54,122 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 22:05:54,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:05:54,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897533563] [2025-04-13 22:05:54,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897533563] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:05:54,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578134184] [2025-04-13 22:05:54,122 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:05:54,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:05:54,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:05:54,124 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 22:05:54,124 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 22:05:54,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 22:05:54,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 22:05:54,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:05:54,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:05:54,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 22:05:54,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:06:04,834 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 22:06:04,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:06:05,716 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 22:06:05,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578134184] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:06:05,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:06:05,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-04-13 22:06:05,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404085975] [2025-04-13 22:06:05,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:06:05,717 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:06:05,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:06:05,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:06:05,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:06:05,717 INFO L87 Difference]: Start difference. First operand 116 states and 323 transitions. Second operand has 21 states, 20 states have (on average 2.0) internal successors, (40), 20 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 22:06:21,191 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 22:06:29,606 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:06:34,727 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 22:06:48,614 WARN L286 SmtUtils]: Spent 8.44s on a formula simplification. DAG size of input: 50 DAG size of output: 26 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:06:55,851 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:07:08,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:07:08,750 INFO L93 Difference]: Finished difference Result 271 states and 614 transitions. [2025-04-13 22:07:08,750 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 22:07:08,751 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.0) internal successors, (40), 20 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 16 [2025-04-13 22:07:08,751 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:07:08,752 INFO L225 Difference]: With dead ends: 271 [2025-04-13 22:07:08,752 INFO L226 Difference]: Without dead ends: 244 [2025-04-13 22:07:08,752 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 55.7s TimeCoverageRelationStatistics Valid=428, Invalid=1640, Unknown=2, NotChecked=0, Total=2070 [2025-04-13 22:07:08,753 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 180 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 35 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:07:08,753 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 74 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 736 Invalid, 1 Unknown, 0 Unchecked, 17.7s Time] [2025-04-13 22:07:08,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-04-13 22:07:08,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 126. [2025-04-13 22:07:08,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.832) internal successors, (354), 125 states have internal predecessors, (354), 0 states have call successors, (0), 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 22:07:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 354 transitions. [2025-04-13 22:07:08,795 INFO L79 Accepts]: Start accepts. Automaton has 126 states and 354 transitions. Word has length 16 [2025-04-13 22:07:08,795 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:07:08,795 INFO L485 AbstractCegarLoop]: Abstraction has 126 states and 354 transitions. [2025-04-13 22:07:08,795 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.0) internal successors, (40), 20 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 22:07:08,795 INFO L278 IsEmpty]: Start isEmpty. Operand 126 states and 354 transitions. [2025-04-13 22:07:08,796 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 22:07:08,796 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:07:08,796 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:07:08,802 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 22:07:08,996 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,SelfDestructingSolverStorable12 [2025-04-13 22:07:08,996 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:07:08,997 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:07:08,997 INFO L85 PathProgramCache]: Analyzing trace with hash -173947353, now seen corresponding path program 9 times [2025-04-13 22:07:08,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:07:08,997 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273837318] [2025-04-13 22:07:08,997 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:07:08,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:07:08,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-13 22:07:09,004 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 22:07:09,005 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:07:09,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:07:09,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:07:09,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:07:09,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273837318] [2025-04-13 22:07:09,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273837318] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:07:09,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577347199] [2025-04-13 22:07:09,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:07:09,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:07:09,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:07:09,151 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 22:07:09,153 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 22:07:09,175 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-13 22:07:09,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 22:07:09,437 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:07:09,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:07:09,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 22:07:09,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:07:11,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:07:11,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:07:16,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:07:16,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577347199] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:07:16,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:07:16,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 15 [2025-04-13 22:07:16,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520882718] [2025-04-13 22:07:16,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:07:16,063 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:07:16,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:07:16,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:07:16,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:07:16,063 INFO L87 Difference]: Start difference. First operand 126 states and 354 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 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 22:07:28,014 WARN L286 SmtUtils]: Spent 9.08s on a formula simplification. DAG size of input: 44 DAG size of output: 42 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:07:31,735 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:07:33,397 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:07:40,065 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:07:44,857 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.84s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:07:46,819 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:07:50,632 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.72s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:07:53,732 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:07:56,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:07:56,151 INFO L93 Difference]: Finished difference Result 294 states and 723 transitions. [2025-04-13 22:07:56,151 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:07:56,151 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 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 16 [2025-04-13 22:07:56,151 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:07:56,152 INFO L225 Difference]: With dead ends: 294 [2025-04-13 22:07:56,152 INFO L226 Difference]: Without dead ends: 275 [2025-04-13 22:07:56,153 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=154, Invalid=657, Unknown=1, NotChecked=0, Total=812 [2025-04-13 22:07:56,153 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 127 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:07:56,153 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 59 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 22.6s Time] [2025-04-13 22:07:56,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-04-13 22:07:56,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 155. [2025-04-13 22:07:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 2.9935064935064934) internal successors, (461), 154 states have internal predecessors, (461), 0 states have call successors, (0), 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 22:07:56,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 461 transitions. [2025-04-13 22:07:56,210 INFO L79 Accepts]: Start accepts. Automaton has 155 states and 461 transitions. Word has length 16 [2025-04-13 22:07:56,210 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:07:56,210 INFO L485 AbstractCegarLoop]: Abstraction has 155 states and 461 transitions. [2025-04-13 22:07:56,210 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 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 22:07:56,210 INFO L278 IsEmpty]: Start isEmpty. Operand 155 states and 461 transitions. [2025-04-13 22:07:56,210 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 22:07:56,210 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:07:56,210 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:07:56,216 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 22:07:56,411 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,SelfDestructingSolverStorable13 [2025-04-13 22:07:56,411 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:07:56,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:07:56,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1533650268, now seen corresponding path program 10 times [2025-04-13 22:07:56,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:07:56,411 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776796659] [2025-04-13 22:07:56,411 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:07:56,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:07:56,414 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 22:07:56,420 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 22:07:56,420 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:07:56,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:07:57,697 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:07:57,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:07:57,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776796659] [2025-04-13 22:07:57,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776796659] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:07:57,698 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787715563] [2025-04-13 22:07:57,698 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:07:57,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:07:57,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:07:57,699 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 22:07:57,700 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 22:07:57,725 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 22:07:58,085 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 22:07:58,085 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:07:58,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:07:58,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 22:07:58,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:09:34,386 WARN L286 SmtUtils]: Spent 10.11s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:09:54,422 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:09:54,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:10:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:10:50,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787715563] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:10:50,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:10:50,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-04-13 22:10:50,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575740055] [2025-04-13 22:10:50,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:10:50,774 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:10:50,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:10:50,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:10:50,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=321, Unknown=26, NotChecked=0, Total=420 [2025-04-13 22:10:50,774 INFO L87 Difference]: Start difference. First operand 155 states and 461 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 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 22:11:19,452 WARN L286 SmtUtils]: Spent 26.12s on a formula simplification. DAG size of input: 109 DAG size of output: 61 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:11:23,898 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 22:11:27,908 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 22:11:31,911 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:11:56,222 WARN L286 SmtUtils]: Spent 5.74s on a formula simplification. DAG size of input: 98 DAG size of output: 55 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:12:00,963 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 22:12:04,967 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 22:12:31,782 WARN L286 SmtUtils]: Spent 16.88s on a formula simplification. DAG size of input: 76 DAG size of output: 71 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:12:36,886 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 22:12:40,890 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 22:12:45,014 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 22:12:49,229 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 22:12:57,391 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 22:13:02,368 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 22:13:06,371 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 22:13:07,417 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 22:13:11,974 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 22:13:15,977 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 22:13:21,411 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 [] Received shutdown request... [2025-04-13 22:13:33,024 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 22:13:33,035 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 22:13:34,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 22:13:34,225 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 22:13:34,235 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 22:13:34,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:13:34,237 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 218.6s TimeCoverageRelationStatistics Valid=131, Invalid=650, Unknown=31, NotChecked=0, Total=812 [2025-04-13 22:13:34,237 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 15 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 69.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 70.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:34,237 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 78 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 349 Invalid, 15 Unknown, 0 Unchecked, 70.0s Time] [2025-04-13 22:13:34,238 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 22:13:34,238 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 22:13:34,240 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (155states) and FLOYD_HOARE automaton (currently 13 states, 21 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. [2025-04-13 22:13:34,241 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 22:13:34,242 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 22:13:34,244 INFO L422 BasicCegarLoop]: Path program histogram: [10, 2, 2, 1] [2025-04-13 22:13:34,246 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:13:34,246 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:13:34,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:13:34 BasicIcfg [2025-04-13 22:13:34,247 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:13:34,247 INFO L158 Benchmark]: Toolchain (without parser) took 884018.26ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 33.9MB in the end (delta: 67.2MB). Peak memory consumption was 65.6MB. Max. memory is 8.0GB. [2025-04-13 22:13:34,247 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 155.2MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:13:34,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.98ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 87.0MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 22:13:34,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.99ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 85.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:13:34,248 INFO L158 Benchmark]: Boogie Preprocessor took 27.39ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 84.4MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:13:34,248 INFO L158 Benchmark]: IcfgBuilder took 303.18ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 62.4MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 22:13:34,248 INFO L158 Benchmark]: TraceAbstraction took 883457.85ms. Allocated memory is still 142.6MB. Free memory was 61.3MB in the beginning and 33.9MB in the end (delta: 27.4MB). Peak memory consumption was 27.8MB. Max. memory is 8.0GB. [2025-04-13 22:13:34,249 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.26ms. Allocated memory is still 155.2MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 202.98ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 87.0MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.99ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 85.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.39ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 84.4MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 303.18ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 62.4MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 883457.85ms. Allocated memory is still 142.6MB. Free memory was 61.3MB in the beginning and 33.9MB in the end (delta: 27.4MB). Peak memory consumption was 27.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (155states) and FLOYD_HOARE automaton (currently 13 states, 21 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (155states) and FLOYD_HOARE automaton (currently 13 states, 21 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (155states) and FLOYD_HOARE automaton (currently 13 states, 21 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 24 locations, 27 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 883.4s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 500.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 30 mSolverCounterUnknown, 979 SdHoareTripleChecker+Valid, 219.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 979 mSDsluCounter, 496 SdHoareTripleChecker+Invalid, 218.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 422 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4213 IncrementalHoareTripleChecker+Invalid, 4432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 74 mSDtfsCounter, 4213 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 506 GetRequests, 237 SyntacticMatches, 11 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 560.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=14, InterpolantAutomatonStates: 195, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 695 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 376.8s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 530 ConstructedInterpolants, 0 QuantifiedInterpolants, 9710 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1035 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 39 InterpolantComputations, 3 PerfectInterpolantSequences, 11/146 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