/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/parallel-lamport.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:31:31,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:31:31,121 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 22:31:31,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:31:31,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:31:31,150 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:31:31,151 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:31:31,151 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:31:31,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:31:31,152 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:31:31,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:31:31,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:31:31,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:31:31,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:31:31,153 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:31:31,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:31:31,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:31:31,153 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:31:31,153 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:31:31,153 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:31:31,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:31:31,153 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:31:31,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:31:31,153 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:31:31,153 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:31:31,153 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:31:31,153 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:31:31,153 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:31:31,154 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:31:31,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:31:31,154 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:31:31,154 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:31:31,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:31:31,154 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:31:31,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:31:31,154 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:31:31,154 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:31:31,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:31:31,154 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:31:31,154 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:31:31,154 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:31:31,154 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:31:31,154 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:31:31,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:31:31,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:31:31,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:31:31,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:31:31,154 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 22:31:31,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:31:31,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:31:31,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:31:31,384 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:31:31,385 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:31:31,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-lamport.wvr.c [2025-04-13 22:31:32,684 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2db487ad5/539c762f8f7540fab59b2708a1d1edf6/FLAGfd669d89f [2025-04-13 22:31:32,855 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:31:32,855 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-lamport.wvr.c [2025-04-13 22:31:32,862 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2db487ad5/539c762f8f7540fab59b2708a1d1edf6/FLAGfd669d89f [2025-04-13 22:31:33,683 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2db487ad5/539c762f8f7540fab59b2708a1d1edf6 [2025-04-13 22:31:33,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:31:33,686 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:31:33,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:31:33,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:31:33,690 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:31:33,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:31:33" (1/1) ... [2025-04-13 22:31:33,691 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d53951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:33, skipping insertion in model container [2025-04-13 22:31:33,691 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:31:33" (1/1) ... [2025-04-13 22:31:33,702 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:31:33,873 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/parallel-lamport.wvr.c[3044,3057] [2025-04-13 22:31:33,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:31:33,899 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:31:33,928 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/parallel-lamport.wvr.c[3044,3057] [2025-04-13 22:31:33,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:31:33,944 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:31:33,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:33 WrapperNode [2025-04-13 22:31:33,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:31:33,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:31:33,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:31:33,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:31:33,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:33" (1/1) ... [2025-04-13 22:31:33,954 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:33" (1/1) ... [2025-04-13 22:31:33,970 INFO L138 Inliner]: procedures = 22, calls = 29, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 204 [2025-04-13 22:31:33,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:31:33,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:31:33,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:31:33,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:31:33,975 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:33" (1/1) ... [2025-04-13 22:31:33,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:33" (1/1) ... [2025-04-13 22:31:33,978 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:33" (1/1) ... [2025-04-13 22:31:33,987 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 22:31:33,987 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:33" (1/1) ... [2025-04-13 22:31:33,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:33" (1/1) ... [2025-04-13 22:31:33,995 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:33" (1/1) ... [2025-04-13 22:31:33,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:33" (1/1) ... [2025-04-13 22:31:33,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:33" (1/1) ... [2025-04-13 22:31:33,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:33" (1/1) ... [2025-04-13 22:31:34,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:31:34,003 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:31:34,003 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:31:34,003 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:31:34,003 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:33" (1/1) ... [2025-04-13 22:31:34,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:31:34,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:31:34,028 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 22:31:34,030 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 22:31:34,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:31:34,045 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:31:34,045 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:31:34,045 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:31:34,046 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:31:34,046 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 22:31:34,046 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 22:31:34,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:31:34,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 22:31:34,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 22:31:34,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 22:31:34,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 22:31:34,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:31:34,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:31:34,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 22:31:34,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 22:31:34,047 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 22:31:34,113 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:31:34,115 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:31:34,329 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:31:34,329 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:31:34,329 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:31:34,522 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:31:34,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:31:34 BoogieIcfgContainer [2025-04-13 22:31:34,522 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:31:34,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:31:34,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:31:34,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:31:34,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:31:33" (1/3) ... [2025-04-13 22:31:34,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193fb040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:31:34, skipping insertion in model container [2025-04-13 22:31:34,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:31:33" (2/3) ... [2025-04-13 22:31:34,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193fb040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:31:34, skipping insertion in model container [2025-04-13 22:31:34,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:31:34" (3/3) ... [2025-04-13 22:31:34,531 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-lamport.wvr.c [2025-04-13 22:31:34,543 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:31:34,544 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-lamport.wvr.c that has 4 procedures, 59 locations, 56 edges, 1 initial locations, 1 loop locations, and 1 error locations. [2025-04-13 22:31:34,544 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:31:34,585 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 22:31:34,605 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 68 places, 59 transitions, 139 flow [2025-04-13 22:31:34,714 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2138 states, 2137 states have (on average 3.0715956948993917) internal successors, (6564), 2137 states have internal predecessors, (6564), 0 states have call successors, (0), 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:31:34,733 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:31:34,743 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;@6777fdf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:31:34,743 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 22:31:34,751 INFO L278 IsEmpty]: Start isEmpty. Operand has 2138 states, 2137 states have (on average 3.0715956948993917) internal successors, (6564), 2137 states have internal predecessors, (6564), 0 states have call successors, (0), 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:31:34,771 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 22:31:34,771 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:34,772 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:34,772 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:34,776 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:34,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1614695982, now seen corresponding path program 1 times [2025-04-13 22:31:34,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:34,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905713123] [2025-04-13 22:31:34,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:34,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:34,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 22:31:34,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 22:31:34,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:34,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:35,232 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 22:31:35,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:35,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905713123] [2025-04-13 22:31:35,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905713123] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:35,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:35,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:31:35,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386630542] [2025-04-13 22:31:35,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:35,239 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:31:35,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:35,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:31:35,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:31:35,260 INFO L87 Difference]: Start difference. First operand has 2138 states, 2137 states have (on average 3.0715956948993917) internal successors, (6564), 2137 states have internal predecessors, (6564), 0 states have call successors, (0), 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, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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:31:35,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:35,406 INFO L93 Difference]: Finished difference Result 4265 states and 13117 transitions. [2025-04-13 22:31:35,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:31:35,408 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-04-13 22:31:35,408 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:35,443 INFO L225 Difference]: With dead ends: 4265 [2025-04-13 22:31:35,444 INFO L226 Difference]: Without dead ends: 2139 [2025-04-13 22:31:35,454 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 22:31:35,460 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:35,460 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:31:35,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2025-04-13 22:31:35,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139. [2025-04-13 22:31:35,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2138 states have (on average 3.070626753975678) internal successors, (6565), 2138 states have internal predecessors, (6565), 0 states have call successors, (0), 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:31:35,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 6565 transitions. [2025-04-13 22:31:35,587 INFO L79 Accepts]: Start accepts. Automaton has 2139 states and 6565 transitions. Word has length 54 [2025-04-13 22:31:35,588 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:35,588 INFO L485 AbstractCegarLoop]: Abstraction has 2139 states and 6565 transitions. [2025-04-13 22:31:35,588 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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:31:35,589 INFO L278 IsEmpty]: Start isEmpty. Operand 2139 states and 6565 transitions. [2025-04-13 22:31:35,594 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 22:31:35,594 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:35,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:35,595 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:31:35,595 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:35,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:35,595 INFO L85 PathProgramCache]: Analyzing trace with hash -768306048, now seen corresponding path program 1 times [2025-04-13 22:31:35,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:35,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739814576] [2025-04-13 22:31:35,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:35,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:35,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-13 22:31:35,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 22:31:35,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:35,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:36,318 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 22:31:36,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:36,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739814576] [2025-04-13 22:31:36,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739814576] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:31:36,319 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569698096] [2025-04-13 22:31:36,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:36,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:31:36,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:31:36,323 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 22:31:36,325 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 22:31:36,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-13 22:31:36,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 22:31:36,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:36,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:36,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 22:31:36,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:31:36,482 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 22:31:37,120 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 22:31:37,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:31:37,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:31:37,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569698096] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:31:37,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:31:37,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [11, 13] total 32 [2025-04-13 22:31:37,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110474638] [2025-04-13 22:31:37,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:37,491 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 22:31:37,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:37,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 22:31:37,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:31:37,492 INFO L87 Difference]: Start difference. First operand 2139 states and 6565 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 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:31:39,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:39,064 INFO L93 Difference]: Finished difference Result 2962 states and 8877 transitions. [2025-04-13 22:31:39,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:31:39,065 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-04-13 22:31:39,065 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:39,079 INFO L225 Difference]: With dead ends: 2962 [2025-04-13 22:31:39,079 INFO L226 Difference]: Without dead ends: 2790 [2025-04-13 22:31:39,080 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=232, Invalid=2318, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:31:39,081 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 341 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 2305 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 2311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:39,081 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 107 Invalid, 2311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2305 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 22:31:39,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2025-04-13 22:31:39,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 2265. [2025-04-13 22:31:39,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2265 states, 2264 states have (on average 3.056095406360424) internal successors, (6919), 2264 states have internal predecessors, (6919), 0 states have call successors, (0), 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:31:39,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 6919 transitions. [2025-04-13 22:31:39,141 INFO L79 Accepts]: Start accepts. Automaton has 2265 states and 6919 transitions. Word has length 55 [2025-04-13 22:31:39,142 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:39,142 INFO L485 AbstractCegarLoop]: Abstraction has 2265 states and 6919 transitions. [2025-04-13 22:31:39,144 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 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:31:39,144 INFO L278 IsEmpty]: Start isEmpty. Operand 2265 states and 6919 transitions. [2025-04-13 22:31:39,152 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 22:31:39,152 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:39,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:39,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 22:31:39,357 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 22:31:39,357 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:39,357 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:39,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2080354976, now seen corresponding path program 2 times [2025-04-13 22:31:39,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:39,358 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588144425] [2025-04-13 22:31:39,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:31:39,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:39,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-13 22:31:39,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 55 statements. [2025-04-13 22:31:39,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:31:39,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:39,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:31:39,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:39,673 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588144425] [2025-04-13 22:31:39,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588144425] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:39,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:39,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:31:39,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732708237] [2025-04-13 22:31:39,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:39,674 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:31:39,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:39,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:31:39,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:31:39,674 INFO L87 Difference]: Start difference. First operand 2265 states and 6919 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:31:40,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:40,467 INFO L93 Difference]: Finished difference Result 2870 states and 8631 transitions. [2025-04-13 22:31:40,467 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:31:40,467 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-04-13 22:31:40,467 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:40,481 INFO L225 Difference]: With dead ends: 2870 [2025-04-13 22:31:40,481 INFO L226 Difference]: Without dead ends: 2614 [2025-04-13 22:31:40,482 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:31:40,483 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 318 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:40,483 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 50 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:31:40,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2614 states. [2025-04-13 22:31:40,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2614 to 2299. [2025-04-13 22:31:40,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2299 states, 2298 states have (on average 3.04786771105309) internal successors, (7004), 2298 states have internal predecessors, (7004), 0 states have call successors, (0), 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:31:40,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 7004 transitions. [2025-04-13 22:31:40,534 INFO L79 Accepts]: Start accepts. Automaton has 2299 states and 7004 transitions. Word has length 55 [2025-04-13 22:31:40,534 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:40,534 INFO L485 AbstractCegarLoop]: Abstraction has 2299 states and 7004 transitions. [2025-04-13 22:31:40,534 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:31:40,534 INFO L278 IsEmpty]: Start isEmpty. Operand 2299 states and 7004 transitions. [2025-04-13 22:31:40,539 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 22:31:40,539 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:40,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:40,539 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:31:40,539 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:40,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:40,540 INFO L85 PathProgramCache]: Analyzing trace with hash -837593310, now seen corresponding path program 3 times [2025-04-13 22:31:40,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:40,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466876280] [2025-04-13 22:31:40,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:31:40,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:40,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 2 equivalence classes. [2025-04-13 22:31:40,583 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 55 statements. [2025-04-13 22:31:40,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:31:40,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:31:40,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:40,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466876280] [2025-04-13 22:31:40,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466876280] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:40,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:40,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:31:40,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969730722] [2025-04-13 22:31:40,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:40,811 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:31:40,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:40,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:31:40,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:31:40,812 INFO L87 Difference]: Start difference. First operand 2299 states and 7004 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:31:41,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:41,559 INFO L93 Difference]: Finished difference Result 3181 states and 9629 transitions. [2025-04-13 22:31:41,559 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:31:41,559 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-04-13 22:31:41,560 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:41,577 INFO L225 Difference]: With dead ends: 3181 [2025-04-13 22:31:41,577 INFO L226 Difference]: Without dead ends: 3068 [2025-04-13 22:31:41,578 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:31:41,579 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 363 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1588 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:41,579 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 79 Invalid, 1591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:31:41,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2025-04-13 22:31:41,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 2479. [2025-04-13 22:31:41,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2479 states, 2478 states have (on average 3.056900726392252) internal successors, (7575), 2478 states have internal predecessors, (7575), 0 states have call successors, (0), 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:31:41,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 7575 transitions. [2025-04-13 22:31:41,638 INFO L79 Accepts]: Start accepts. Automaton has 2479 states and 7575 transitions. Word has length 55 [2025-04-13 22:31:41,638 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:41,638 INFO L485 AbstractCegarLoop]: Abstraction has 2479 states and 7575 transitions. [2025-04-13 22:31:41,639 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:31:41,639 INFO L278 IsEmpty]: Start isEmpty. Operand 2479 states and 7575 transitions. [2025-04-13 22:31:41,643 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 22:31:41,643 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:41,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:41,644 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:31:41,644 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:41,644 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:41,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1371479840, now seen corresponding path program 4 times [2025-04-13 22:31:41,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:41,644 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213732129] [2025-04-13 22:31:41,644 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:31:41,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:41,650 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-04-13 22:31:41,658 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 55 statements. [2025-04-13 22:31:41,659 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:31:41,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:41,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:31:41,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:41,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213732129] [2025-04-13 22:31:41,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213732129] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:41,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:41,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:31:41,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766811547] [2025-04-13 22:31:41,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:41,813 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:31:41,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:41,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:31:41,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:31:41,814 INFO L87 Difference]: Start difference. First operand 2479 states and 7575 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:31:42,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:42,577 INFO L93 Difference]: Finished difference Result 3036 states and 9163 transitions. [2025-04-13 22:31:42,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:31:42,577 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-04-13 22:31:42,577 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:42,589 INFO L225 Difference]: With dead ends: 3036 [2025-04-13 22:31:42,590 INFO L226 Difference]: Without dead ends: 2849 [2025-04-13 22:31:42,591 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=217, Invalid=973, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:31:42,591 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 331 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:42,591 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 50 Invalid, 1429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:31:42,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2025-04-13 22:31:42,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 2488. [2025-04-13 22:31:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2488 states, 2487 states have (on average 3.053880176919984) internal successors, (7595), 2487 states have internal predecessors, (7595), 0 states have call successors, (0), 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:31:42,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 7595 transitions. [2025-04-13 22:31:42,635 INFO L79 Accepts]: Start accepts. Automaton has 2488 states and 7595 transitions. Word has length 55 [2025-04-13 22:31:42,635 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:42,635 INFO L485 AbstractCegarLoop]: Abstraction has 2488 states and 7595 transitions. [2025-04-13 22:31:42,635 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:31:42,635 INFO L278 IsEmpty]: Start isEmpty. Operand 2488 states and 7595 transitions. [2025-04-13 22:31:42,641 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 22:31:42,641 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:42,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:42,641 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:31:42,641 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:42,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:42,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1019413812, now seen corresponding path program 5 times [2025-04-13 22:31:42,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:42,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6255258] [2025-04-13 22:31:42,643 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:31:42,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:42,651 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-13 22:31:42,671 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 22:31:42,671 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:31:42,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:43,428 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 22:31:43,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:43,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6255258] [2025-04-13 22:31:43,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6255258] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:31:43,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3387634] [2025-04-13 22:31:43,429 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:31:43,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:31:43,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:31:43,430 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 22:31:43,432 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 22:31:43,474 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-13 22:31:43,496 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 22:31:43,497 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:31:43,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:43,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:31:43,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:31:43,524 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 22:31:43,655 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 22:31:43,684 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 22:31:43,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:31:44,171 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-04-13 22:31:44,181 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:31:44,181 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-04-13 22:31:44,237 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 22:31:44,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3387634] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:31:44,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:31:44,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 28 [2025-04-13 22:31:44,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344892933] [2025-04-13 22:31:44,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:31:44,238 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:31:44,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:44,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:31:44,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:31:44,241 INFO L87 Difference]: Start difference. First operand 2488 states and 7595 transitions. Second operand has 29 states, 28 states have (on average 4.642857142857143) internal successors, (130), 29 states have internal predecessors, (130), 0 states have call successors, (0), 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:31:48,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:48,182 INFO L93 Difference]: Finished difference Result 7546 states and 22376 transitions. [2025-04-13 22:31:48,182 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2025-04-13 22:31:48,183 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.642857142857143) internal successors, (130), 29 states have internal predecessors, (130), 0 states have call successors, (0), 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 55 [2025-04-13 22:31:48,183 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:48,212 INFO L225 Difference]: With dead ends: 7546 [2025-04-13 22:31:48,212 INFO L226 Difference]: Without dead ends: 6443 [2025-04-13 22:31:48,218 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5521 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2439, Invalid=14853, Unknown=0, NotChecked=0, Total=17292 [2025-04-13 22:31:48,219 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 1462 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 5371 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 5494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 5371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:48,219 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1462 Valid, 324 Invalid, 5494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 5371 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 22:31:48,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6443 states. [2025-04-13 22:31:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6443 to 3718. [2025-04-13 22:31:48,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3718 states, 3717 states have (on average 3.058918482647296) internal successors, (11370), 3717 states have internal predecessors, (11370), 0 states have call successors, (0), 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:31:48,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3718 states to 3718 states and 11370 transitions. [2025-04-13 22:31:48,301 INFO L79 Accepts]: Start accepts. Automaton has 3718 states and 11370 transitions. Word has length 55 [2025-04-13 22:31:48,301 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:48,301 INFO L485 AbstractCegarLoop]: Abstraction has 3718 states and 11370 transitions. [2025-04-13 22:31:48,302 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.642857142857143) internal successors, (130), 29 states have internal predecessors, (130), 0 states have call successors, (0), 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:31:48,302 INFO L278 IsEmpty]: Start isEmpty. Operand 3718 states and 11370 transitions. [2025-04-13 22:31:48,309 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 22:31:48,309 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:48,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:48,315 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 22:31:48,513 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 22:31:48,513 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:48,513 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:48,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1654171100, now seen corresponding path program 6 times [2025-04-13 22:31:48,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:48,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57367725] [2025-04-13 22:31:48,514 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:31:48,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:48,520 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 55 statements into 2 equivalence classes. [2025-04-13 22:31:48,539 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 55 statements. [2025-04-13 22:31:48,539 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:31:48,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:31:48,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:48,750 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57367725] [2025-04-13 22:31:48,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57367725] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:48,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:48,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:31:48,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074001177] [2025-04-13 22:31:48,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:48,750 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:31:48,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:48,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:31:48,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:31:48,751 INFO L87 Difference]: Start difference. First operand 3718 states and 11370 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:31:49,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:49,456 INFO L93 Difference]: Finished difference Result 4265 states and 12929 transitions. [2025-04-13 22:31:49,456 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:31:49,456 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-04-13 22:31:49,456 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:49,469 INFO L225 Difference]: With dead ends: 4265 [2025-04-13 22:31:49,469 INFO L226 Difference]: Without dead ends: 4088 [2025-04-13 22:31:49,471 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:31:49,471 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 257 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:49,472 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 50 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:31:49,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4088 states. [2025-04-13 22:31:49,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4088 to 3709. [2025-04-13 22:31:49,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3709 states, 3708 states have (on average 3.05663430420712) internal successors, (11334), 3708 states have internal predecessors, (11334), 0 states have call successors, (0), 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:31:49,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3709 states to 3709 states and 11334 transitions. [2025-04-13 22:31:49,530 INFO L79 Accepts]: Start accepts. Automaton has 3709 states and 11334 transitions. Word has length 55 [2025-04-13 22:31:49,530 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:49,530 INFO L485 AbstractCegarLoop]: Abstraction has 3709 states and 11334 transitions. [2025-04-13 22:31:49,530 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:31:49,530 INFO L278 IsEmpty]: Start isEmpty. Operand 3709 states and 11334 transitions. [2025-04-13 22:31:49,537 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 22:31:49,537 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:49,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:49,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 22:31:49,537 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:49,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:49,537 INFO L85 PathProgramCache]: Analyzing trace with hash 446496964, now seen corresponding path program 7 times [2025-04-13 22:31:49,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:49,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454103311] [2025-04-13 22:31:49,537 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:31:49,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:49,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-13 22:31:49,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 22:31:49,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:49,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:49,871 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 22:31:49,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:49,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454103311] [2025-04-13 22:31:49,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454103311] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:31:49,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716141254] [2025-04-13 22:31:49,872 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:31:49,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:31:49,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:31:49,873 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 22:31:49,875 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 22:31:49,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-13 22:31:49,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 22:31:49,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:49,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:49,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 22:31:49,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:31:49,957 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 22:31:50,318 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 22:31:50,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:31:50,723 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2025-04-13 22:31:50,746 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:31:50,746 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 116 [2025-04-13 22:31:50,923 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2025-04-13 22:31:50,928 INFO L325 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-04-13 22:31:50,928 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 1 [2025-04-13 22:31:50,946 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 22:31:50,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716141254] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:31:50,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:31:50,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 25 [2025-04-13 22:31:50,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157035941] [2025-04-13 22:31:50,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:31:50,947 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:31:50,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:50,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:31:50,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:31:50,948 INFO L87 Difference]: Start difference. First operand 3709 states and 11334 transitions. Second operand has 26 states, 25 states have (on average 5.6) internal successors, (140), 26 states have internal predecessors, (140), 0 states have call successors, (0), 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:31:53,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:53,418 INFO L93 Difference]: Finished difference Result 6176 states and 18423 transitions. [2025-04-13 22:31:53,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 22:31:53,422 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 5.6) internal successors, (140), 26 states have internal predecessors, (140), 0 states have call successors, (0), 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 55 [2025-04-13 22:31:53,422 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:53,434 INFO L225 Difference]: With dead ends: 6176 [2025-04-13 22:31:53,435 INFO L226 Difference]: Without dead ends: 4578 [2025-04-13 22:31:53,438 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=952, Invalid=3740, Unknown=0, NotChecked=0, Total=4692 [2025-04-13 22:31:53,438 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 1198 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 3380 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 3481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 3380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:53,438 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 206 Invalid, 3481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 3380 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 22:31:53,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4578 states. [2025-04-13 22:31:53,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4578 to 3729. [2025-04-13 22:31:53,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3729 states, 3728 states have (on average 3.0061695278969958) internal successors, (11207), 3728 states have internal predecessors, (11207), 0 states have call successors, (0), 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:31:53,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3729 states to 3729 states and 11207 transitions. [2025-04-13 22:31:53,497 INFO L79 Accepts]: Start accepts. Automaton has 3729 states and 11207 transitions. Word has length 55 [2025-04-13 22:31:53,497 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:53,497 INFO L485 AbstractCegarLoop]: Abstraction has 3729 states and 11207 transitions. [2025-04-13 22:31:53,497 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 5.6) internal successors, (140), 26 states have internal predecessors, (140), 0 states have call successors, (0), 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:31:53,498 INFO L278 IsEmpty]: Start isEmpty. Operand 3729 states and 11207 transitions. [2025-04-13 22:31:53,503 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 22:31:53,503 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:53,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:53,509 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:31:53,707 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:31:53,707 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:53,707 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:53,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1162971746, now seen corresponding path program 8 times [2025-04-13 22:31:53,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:53,707 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471581686] [2025-04-13 22:31:53,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:31:53,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:53,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-13 22:31:53,716 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 55 statements. [2025-04-13 22:31:53,716 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:31:53,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:53,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:31:53,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:53,765 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471581686] [2025-04-13 22:31:53,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471581686] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:53,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:53,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:31:53,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395355181] [2025-04-13 22:31:53,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:53,765 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:31:53,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:53,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:31:53,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:31:53,766 INFO L87 Difference]: Start difference. First operand 3729 states and 11207 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 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:31:53,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:53,901 INFO L93 Difference]: Finished difference Result 5966 states and 17761 transitions. [2025-04-13 22:31:53,902 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:31:53,902 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-04-13 22:31:53,902 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:53,915 INFO L225 Difference]: With dead ends: 5966 [2025-04-13 22:31:53,916 INFO L226 Difference]: Without dead ends: 4397 [2025-04-13 22:31:53,919 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:31:53,919 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 97 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:53,919 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 16 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:31:53,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4397 states. [2025-04-13 22:31:53,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4397 to 4085. [2025-04-13 22:31:53,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4085 states, 4084 states have (on average 2.980656219392752) internal successors, (12173), 4084 states have internal predecessors, (12173), 0 states have call successors, (0), 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:31:53,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4085 states to 4085 states and 12173 transitions. [2025-04-13 22:31:54,002 INFO L79 Accepts]: Start accepts. Automaton has 4085 states and 12173 transitions. Word has length 55 [2025-04-13 22:31:54,002 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:54,002 INFO L485 AbstractCegarLoop]: Abstraction has 4085 states and 12173 transitions. [2025-04-13 22:31:54,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 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:31:54,002 INFO L278 IsEmpty]: Start isEmpty. Operand 4085 states and 12173 transitions. [2025-04-13 22:31:54,010 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 22:31:54,010 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:54,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:54,010 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 22:31:54,010 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:54,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:54,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1510710330, now seen corresponding path program 9 times [2025-04-13 22:31:54,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:54,011 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232625747] [2025-04-13 22:31:54,011 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:31:54,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:54,017 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 2 equivalence classes. [2025-04-13 22:31:54,028 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 55 statements. [2025-04-13 22:31:54,032 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:31:54,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:54,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:31:54,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:54,200 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232625747] [2025-04-13 22:31:54,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232625747] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:54,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:54,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:31:54,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230666779] [2025-04-13 22:31:54,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:54,201 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:31:54,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:54,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:31:54,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:31:54,201 INFO L87 Difference]: Start difference. First operand 4085 states and 12173 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:31:54,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:54,866 INFO L93 Difference]: Finished difference Result 4992 states and 14659 transitions. [2025-04-13 22:31:54,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:31:54,866 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-04-13 22:31:54,866 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:54,886 INFO L225 Difference]: With dead ends: 4992 [2025-04-13 22:31:54,886 INFO L226 Difference]: Without dead ends: 4756 [2025-04-13 22:31:54,888 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:31:54,889 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 313 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1639 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:54,889 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 84 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1639 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:31:54,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4756 states. [2025-04-13 22:31:54,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4756 to 3947. [2025-04-13 22:31:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3947 states, 3946 states have (on average 2.97136340598074) internal successors, (11725), 3946 states have internal predecessors, (11725), 0 states have call successors, (0), 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:31:54,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3947 states to 3947 states and 11725 transitions. [2025-04-13 22:31:54,958 INFO L79 Accepts]: Start accepts. Automaton has 3947 states and 11725 transitions. Word has length 55 [2025-04-13 22:31:54,958 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:54,958 INFO L485 AbstractCegarLoop]: Abstraction has 3947 states and 11725 transitions. [2025-04-13 22:31:54,958 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:31:54,958 INFO L278 IsEmpty]: Start isEmpty. Operand 3947 states and 11725 transitions. [2025-04-13 22:31:54,964 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 22:31:54,964 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:54,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:54,964 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 22:31:54,965 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:54,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:54,965 INFO L85 PathProgramCache]: Analyzing trace with hash -32293750, now seen corresponding path program 10 times [2025-04-13 22:31:54,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:54,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025314771] [2025-04-13 22:31:54,965 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:31:54,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:54,970 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-04-13 22:31:54,975 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 55 statements. [2025-04-13 22:31:54,975 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:31:54,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:55,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:31:55,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:55,087 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025314771] [2025-04-13 22:31:55,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025314771] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:55,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:55,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:31:55,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794469533] [2025-04-13 22:31:55,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:55,087 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:31:55,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:55,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:31:55,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:31:55,088 INFO L87 Difference]: Start difference. First operand 3947 states and 11725 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:31:55,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:55,644 INFO L93 Difference]: Finished difference Result 4710 states and 13881 transitions. [2025-04-13 22:31:55,644 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:31:55,644 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-04-13 22:31:55,645 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:55,658 INFO L225 Difference]: With dead ends: 4710 [2025-04-13 22:31:55,658 INFO L226 Difference]: Without dead ends: 4607 [2025-04-13 22:31:55,659 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:31:55,659 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 310 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1563 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:55,660 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 75 Invalid, 1565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1563 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:31:55,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4607 states. [2025-04-13 22:31:55,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4607 to 3938. [2025-04-13 22:31:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3938 states, 3937 states have (on average 2.9707899415798833) internal successors, (11696), 3937 states have internal predecessors, (11696), 0 states have call successors, (0), 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:31:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3938 states to 3938 states and 11696 transitions. [2025-04-13 22:31:55,715 INFO L79 Accepts]: Start accepts. Automaton has 3938 states and 11696 transitions. Word has length 55 [2025-04-13 22:31:55,715 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:55,715 INFO L485 AbstractCegarLoop]: Abstraction has 3938 states and 11696 transitions. [2025-04-13 22:31:55,715 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:31:55,715 INFO L278 IsEmpty]: Start isEmpty. Operand 3938 states and 11696 transitions. [2025-04-13 22:31:55,721 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 22:31:55,721 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:55,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:55,722 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 22:31:55,722 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:55,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:55,722 INFO L85 PathProgramCache]: Analyzing trace with hash -787392612, now seen corresponding path program 11 times [2025-04-13 22:31:55,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:55,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120278302] [2025-04-13 22:31:55,722 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:31:55,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:55,727 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-13 22:31:55,736 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 22:31:55,736 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:31:55,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:56,194 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 22:31:56,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:56,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120278302] [2025-04-13 22:31:56,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120278302] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:31:56,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374709218] [2025-04-13 22:31:56,194 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:31:56,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:31:56,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:31:56,196 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:31:56,198 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:31:56,236 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-13 22:31:56,257 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 22:31:56,257 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:31:56,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:56,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:31:56,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:31:56,284 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 22:31:56,392 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 22:31:56,407 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 22:31:56,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:31:56,818 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-04-13 22:31:56,825 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:31:56,825 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-04-13 22:31:56,860 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 22:31:56,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374709218] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:31:56,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:31:56,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 27 [2025-04-13 22:31:56,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695455532] [2025-04-13 22:31:56,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:31:56,861 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:31:56,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:56,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:31:56,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:31:56,862 INFO L87 Difference]: Start difference. First operand 3938 states and 11696 transitions. Second operand has 28 states, 27 states have (on average 4.851851851851852) internal successors, (131), 28 states have internal predecessors, (131), 0 states have call successors, (0), 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:31:59,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:59,708 INFO L93 Difference]: Finished difference Result 5273 states and 15136 transitions. [2025-04-13 22:31:59,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-04-13 22:31:59,708 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.851851851851852) internal successors, (131), 28 states have internal predecessors, (131), 0 states have call successors, (0), 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 55 [2025-04-13 22:31:59,708 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:59,720 INFO L225 Difference]: With dead ends: 5273 [2025-04-13 22:31:59,720 INFO L226 Difference]: Without dead ends: 4033 [2025-04-13 22:31:59,724 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2303 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1469, Invalid=7087, Unknown=0, NotChecked=0, Total=8556 [2025-04-13 22:31:59,724 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 1371 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 3826 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 3914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 3826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:59,724 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 209 Invalid, 3914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 3826 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 22:31:59,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4033 states. [2025-04-13 22:31:59,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4033 to 3470. [2025-04-13 22:31:59,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3470 states, 3469 states have (on average 2.9484001153070047) internal successors, (10228), 3469 states have internal predecessors, (10228), 0 states have call successors, (0), 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:31:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3470 states to 3470 states and 10228 transitions. [2025-04-13 22:31:59,771 INFO L79 Accepts]: Start accepts. Automaton has 3470 states and 10228 transitions. Word has length 55 [2025-04-13 22:31:59,771 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:59,771 INFO L485 AbstractCegarLoop]: Abstraction has 3470 states and 10228 transitions. [2025-04-13 22:31:59,772 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.851851851851852) internal successors, (131), 28 states have internal predecessors, (131), 0 states have call successors, (0), 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:31:59,772 INFO L278 IsEmpty]: Start isEmpty. Operand 3470 states and 10228 transitions. [2025-04-13 22:31:59,776 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 22:31:59,776 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:59,777 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:59,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 22:31:59,977 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:31:59,978 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:59,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:59,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1356095870, now seen corresponding path program 12 times [2025-04-13 22:31:59,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:59,978 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301427760] [2025-04-13 22:31:59,978 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:31:59,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:59,983 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 55 statements into 2 equivalence classes. [2025-04-13 22:31:59,986 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 55 statements. [2025-04-13 22:31:59,986 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:31:59,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:00,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:32:00,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:00,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301427760] [2025-04-13 22:32:00,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301427760] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:00,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:00,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:32:00,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413174059] [2025-04-13 22:32:00,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:00,014 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:32:00,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:00,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:32:00,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:32:00,015 INFO L87 Difference]: Start difference. First operand 3470 states and 10228 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:00,091 INFO L93 Difference]: Finished difference Result 5174 states and 15078 transitions. [2025-04-13 22:32:00,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:32:00,091 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-04-13 22:32:00,091 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:00,102 INFO L225 Difference]: With dead ends: 5174 [2025-04-13 22:32:00,102 INFO L226 Difference]: Without dead ends: 3338 [2025-04-13 22:32:00,104 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 22:32:00,105 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 17 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:00,105 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 10 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:32:00,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2025-04-13 22:32:00,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3338. [2025-04-13 22:32:00,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3338 states, 3337 states have (on average 2.9268804315253223) internal successors, (9767), 3337 states have internal predecessors, (9767), 0 states have call successors, (0), 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:32:00,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3338 states to 3338 states and 9767 transitions. [2025-04-13 22:32:00,175 INFO L79 Accepts]: Start accepts. Automaton has 3338 states and 9767 transitions. Word has length 55 [2025-04-13 22:32:00,175 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:00,175 INFO L485 AbstractCegarLoop]: Abstraction has 3338 states and 9767 transitions. [2025-04-13 22:32:00,176 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:00,176 INFO L278 IsEmpty]: Start isEmpty. Operand 3338 states and 9767 transitions. [2025-04-13 22:32:00,180 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 22:32:00,180 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:00,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:00,180 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 22:32:00,180 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:00,181 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:00,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1721397492, now seen corresponding path program 13 times [2025-04-13 22:32:00,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:00,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414615948] [2025-04-13 22:32:00,181 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:32:00,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:00,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-13 22:32:00,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 22:32:00,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:00,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:00,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:32:00,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:00,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414615948] [2025-04-13 22:32:00,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414615948] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:00,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:00,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:32:00,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133741556] [2025-04-13 22:32:00,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:00,231 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:32:00,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:00,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:32:00,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:32:00,231 INFO L87 Difference]: Start difference. First operand 3338 states and 9767 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:00,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:00,336 INFO L93 Difference]: Finished difference Result 4353 states and 12581 transitions. [2025-04-13 22:32:00,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:32:00,336 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-04-13 22:32:00,336 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:00,344 INFO L225 Difference]: With dead ends: 4353 [2025-04-13 22:32:00,344 INFO L226 Difference]: Without dead ends: 2217 [2025-04-13 22:32:00,347 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:32:00,347 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 74 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:00,347 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 15 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:32:00,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2025-04-13 22:32:00,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 1937. [2025-04-13 22:32:00,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1937 states, 1936 states have (on average 2.8827479338842976) internal successors, (5581), 1936 states have internal predecessors, (5581), 0 states have call successors, (0), 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:32:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1937 states and 5581 transitions. [2025-04-13 22:32:00,373 INFO L79 Accepts]: Start accepts. Automaton has 1937 states and 5581 transitions. Word has length 55 [2025-04-13 22:32:00,373 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:00,373 INFO L485 AbstractCegarLoop]: Abstraction has 1937 states and 5581 transitions. [2025-04-13 22:32:00,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:00,373 INFO L278 IsEmpty]: Start isEmpty. Operand 1937 states and 5581 transitions. [2025-04-13 22:32:00,376 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:00,376 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:00,376 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:00,376 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 22:32:00,376 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:00,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:00,376 INFO L85 PathProgramCache]: Analyzing trace with hash -889649170, now seen corresponding path program 14 times [2025-04-13 22:32:00,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:00,376 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544659078] [2025-04-13 22:32:00,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:32:00,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:00,381 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:00,387 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:00,388 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:32:00,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:00,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:00,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:00,523 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544659078] [2025-04-13 22:32:00,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544659078] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:00,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:00,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:32:00,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31361561] [2025-04-13 22:32:00,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:00,524 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:00,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:00,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:00,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:32:00,524 INFO L87 Difference]: Start difference. First operand 1937 states and 5581 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:01,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:01,036 INFO L93 Difference]: Finished difference Result 2044 states and 5847 transitions. [2025-04-13 22:32:01,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:32:01,036 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:01,036 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:01,044 INFO L225 Difference]: With dead ends: 2044 [2025-04-13 22:32:01,044 INFO L226 Difference]: Without dead ends: 1979 [2025-04-13 22:32:01,045 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:32:01,045 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 189 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:01,045 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 53 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:32:01,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2025-04-13 22:32:01,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1942. [2025-04-13 22:32:01,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1942 states, 1941 states have (on average 2.880473982483256) internal successors, (5591), 1941 states have internal predecessors, (5591), 0 states have call successors, (0), 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:32:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 5591 transitions. [2025-04-13 22:32:01,069 INFO L79 Accepts]: Start accepts. Automaton has 1942 states and 5591 transitions. Word has length 56 [2025-04-13 22:32:01,069 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:01,069 INFO L485 AbstractCegarLoop]: Abstraction has 1942 states and 5591 transitions. [2025-04-13 22:32:01,069 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:01,069 INFO L278 IsEmpty]: Start isEmpty. Operand 1942 states and 5591 transitions. [2025-04-13 22:32:01,071 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:01,071 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:01,071 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:01,071 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 22:32:01,071 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:01,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:01,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1855390414, now seen corresponding path program 15 times [2025-04-13 22:32:01,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:01,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063470080] [2025-04-13 22:32:01,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:32:01,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:01,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:01,085 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:01,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:32:01,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:01,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:01,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:01,248 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063470080] [2025-04-13 22:32:01,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063470080] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:01,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:01,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:32:01,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931749705] [2025-04-13 22:32:01,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:01,248 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:32:01,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:01,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:32:01,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:32:01,249 INFO L87 Difference]: Start difference. First operand 1942 states and 5591 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:01,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:01,746 INFO L93 Difference]: Finished difference Result 2057 states and 5883 transitions. [2025-04-13 22:32:01,746 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:32:01,746 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:01,746 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:01,752 INFO L225 Difference]: With dead ends: 2057 [2025-04-13 22:32:01,752 INFO L226 Difference]: Without dead ends: 1938 [2025-04-13 22:32:01,753 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:32:01,753 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 214 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:01,753 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 73 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:32:01,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2025-04-13 22:32:01,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1887. [2025-04-13 22:32:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1887 states, 1886 states have (on average 2.876458112407211) internal successors, (5425), 1886 states have internal predecessors, (5425), 0 states have call successors, (0), 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:32:01,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 5425 transitions. [2025-04-13 22:32:01,775 INFO L79 Accepts]: Start accepts. Automaton has 1887 states and 5425 transitions. Word has length 56 [2025-04-13 22:32:01,776 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:01,776 INFO L485 AbstractCegarLoop]: Abstraction has 1887 states and 5425 transitions. [2025-04-13 22:32:01,776 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:01,776 INFO L278 IsEmpty]: Start isEmpty. Operand 1887 states and 5425 transitions. [2025-04-13 22:32:01,778 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:01,778 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:01,778 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:01,778 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 22:32:01,778 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:01,779 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:01,779 INFO L85 PathProgramCache]: Analyzing trace with hash 422703410, now seen corresponding path program 16 times [2025-04-13 22:32:01,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:01,779 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193118812] [2025-04-13 22:32:01,779 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:32:01,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:01,784 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:01,788 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:32:01,788 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:32:01,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:01,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:01,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:01,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193118812] [2025-04-13 22:32:01,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193118812] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:01,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:01,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:32:01,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822426802] [2025-04-13 22:32:01,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:01,899 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:01,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:01,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:01,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:32:01,899 INFO L87 Difference]: Start difference. First operand 1887 states and 5425 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:02,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:02,347 INFO L93 Difference]: Finished difference Result 1952 states and 5572 transitions. [2025-04-13 22:32:02,347 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:32:02,347 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:02,347 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:02,353 INFO L225 Difference]: With dead ends: 1952 [2025-04-13 22:32:02,353 INFO L226 Difference]: Without dead ends: 1874 [2025-04-13 22:32:02,354 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:32:02,354 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 158 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:02,354 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 52 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:32:02,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2025-04-13 22:32:02,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1863. [2025-04-13 22:32:02,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1863 states, 1862 states have (on average 2.8839957035445756) internal successors, (5370), 1862 states have internal predecessors, (5370), 0 states have call successors, (0), 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:32:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1863 states and 5370 transitions. [2025-04-13 22:32:02,378 INFO L79 Accepts]: Start accepts. Automaton has 1863 states and 5370 transitions. Word has length 56 [2025-04-13 22:32:02,379 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:02,379 INFO L485 AbstractCegarLoop]: Abstraction has 1863 states and 5370 transitions. [2025-04-13 22:32:02,379 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:02,379 INFO L278 IsEmpty]: Start isEmpty. Operand 1863 states and 5370 transitions. [2025-04-13 22:32:02,381 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:02,381 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:02,381 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:02,381 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 22:32:02,381 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:02,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:02,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1864034258, now seen corresponding path program 17 times [2025-04-13 22:32:02,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:02,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615911390] [2025-04-13 22:32:02,382 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:32:02,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:02,388 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:02,411 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:02,411 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:32:02,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:03,665 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:32:03,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:03,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615911390] [2025-04-13 22:32:03,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615911390] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:03,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992097201] [2025-04-13 22:32:03,666 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:32:03,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:03,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:03,668 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:32:03,669 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:32:03,709 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:03,736 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:03,736 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:32:03,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:03,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:32:03,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:03,996 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:03,996 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:32:04,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:04,001 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:32:04,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992097201] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:04,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:32:04,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18] total 26 [2025-04-13 22:32:04,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497599226] [2025-04-13 22:32:04,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:04,001 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:04,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:04,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:04,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:32:04,002 INFO L87 Difference]: Start difference. First operand 1863 states and 5370 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:04,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:04,812 INFO L93 Difference]: Finished difference Result 2031 states and 5813 transitions. [2025-04-13 22:32:04,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:32:04,813 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:04,813 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:04,819 INFO L225 Difference]: With dead ends: 2031 [2025-04-13 22:32:04,819 INFO L226 Difference]: Without dead ends: 1945 [2025-04-13 22:32:04,820 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=1635, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:32:04,820 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 241 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:04,820 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 62 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:32:04,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2025-04-13 22:32:04,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1873. [2025-04-13 22:32:04,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1872 states have (on average 2.8819444444444446) internal successors, (5395), 1872 states have internal predecessors, (5395), 0 states have call successors, (0), 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:32:04,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 5395 transitions. [2025-04-13 22:32:04,843 INFO L79 Accepts]: Start accepts. Automaton has 1873 states and 5395 transitions. Word has length 56 [2025-04-13 22:32:04,843 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:04,844 INFO L485 AbstractCegarLoop]: Abstraction has 1873 states and 5395 transitions. [2025-04-13 22:32:04,844 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:04,844 INFO L278 IsEmpty]: Start isEmpty. Operand 1873 states and 5395 transitions. [2025-04-13 22:32:04,846 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:04,846 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:04,846 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:04,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 22:32:05,046 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 22:32:05,047 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:05,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:05,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1056360990, now seen corresponding path program 18 times [2025-04-13 22:32:05,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:05,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832257035] [2025-04-13 22:32:05,047 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:32:05,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:05,075 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:05,095 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:05,095 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:32:05,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:05,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:05,301 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832257035] [2025-04-13 22:32:05,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832257035] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:05,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:05,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:32:05,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584089199] [2025-04-13 22:32:05,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:05,301 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:32:05,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:05,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:32:05,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:32:05,302 INFO L87 Difference]: Start difference. First operand 1873 states and 5395 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:05,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:05,887 INFO L93 Difference]: Finished difference Result 2042 states and 5835 transitions. [2025-04-13 22:32:05,887 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:32:05,887 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:05,887 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:05,892 INFO L225 Difference]: With dead ends: 2042 [2025-04-13 22:32:05,892 INFO L226 Difference]: Without dead ends: 1935 [2025-04-13 22:32:05,893 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:32:05,893 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 253 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:05,893 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 48 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:32:05,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2025-04-13 22:32:05,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1883. [2025-04-13 22:32:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1883 states, 1882 states have (on average 2.879914984059511) internal successors, (5420), 1882 states have internal predecessors, (5420), 0 states have call successors, (0), 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:32:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 5420 transitions. [2025-04-13 22:32:05,914 INFO L79 Accepts]: Start accepts. Automaton has 1883 states and 5420 transitions. Word has length 56 [2025-04-13 22:32:05,914 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:05,914 INFO L485 AbstractCegarLoop]: Abstraction has 1883 states and 5420 transitions. [2025-04-13 22:32:05,914 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:05,914 INFO L278 IsEmpty]: Start isEmpty. Operand 1883 states and 5420 transitions. [2025-04-13 22:32:05,916 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:05,916 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:05,916 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:05,916 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 22:32:05,916 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:05,917 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:05,917 INFO L85 PathProgramCache]: Analyzing trace with hash -500850078, now seen corresponding path program 19 times [2025-04-13 22:32:05,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:05,917 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908359328] [2025-04-13 22:32:05,917 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:32:05,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:05,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:32:05,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:05,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:05,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:06,706 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:32:06,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:06,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908359328] [2025-04-13 22:32:06,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908359328] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:06,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615285479] [2025-04-13 22:32:06,707 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:32:06,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:06,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:06,708 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:32:06,709 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:32:06,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:32:06,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:06,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:06,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:06,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:32:06,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:06,946 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:06,946 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:32:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:32:06,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:07,105 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:32:07,106 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:32:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:07,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615285479] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:07,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:32:07,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 22:32:07,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211351746] [2025-04-13 22:32:07,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:07,152 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:07,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:07,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:07,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=852, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:32:07,152 INFO L87 Difference]: Start difference. First operand 1883 states and 5420 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:08,143 INFO L93 Difference]: Finished difference Result 2207 states and 6349 transitions. [2025-04-13 22:32:08,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:32:08,144 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:08,144 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:08,149 INFO L225 Difference]: With dead ends: 2207 [2025-04-13 22:32:08,150 INFO L226 Difference]: Without dead ends: 2142 [2025-04-13 22:32:08,151 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=243, Invalid=2837, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 22:32:08,151 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 364 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:08,151 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 98 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:32:08,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2025-04-13 22:32:08,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 1888. [2025-04-13 22:32:08,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1887 states have (on average 2.87758346581876) internal successors, (5430), 1887 states have internal predecessors, (5430), 0 states have call successors, (0), 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:32:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 5430 transitions. [2025-04-13 22:32:08,184 INFO L79 Accepts]: Start accepts. Automaton has 1888 states and 5430 transitions. Word has length 56 [2025-04-13 22:32:08,185 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:08,185 INFO L485 AbstractCegarLoop]: Abstraction has 1888 states and 5430 transitions. [2025-04-13 22:32:08,185 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:08,185 INFO L278 IsEmpty]: Start isEmpty. Operand 1888 states and 5430 transitions. [2025-04-13 22:32:08,187 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:08,187 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:08,187 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:08,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 22:32:08,391 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:08,391 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:08,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:08,391 INFO L85 PathProgramCache]: Analyzing trace with hash 773669730, now seen corresponding path program 20 times [2025-04-13 22:32:08,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:08,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56044965] [2025-04-13 22:32:08,391 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:32:08,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:08,396 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:08,404 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:08,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:32:08,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:08,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:08,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56044965] [2025-04-13 22:32:08,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56044965] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:08,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:08,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:32:08,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019511850] [2025-04-13 22:32:08,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:08,531 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:32:08,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:08,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:32:08,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:32:08,532 INFO L87 Difference]: Start difference. First operand 1888 states and 5430 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:08,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:08,990 INFO L93 Difference]: Finished difference Result 2057 states and 5870 transitions. [2025-04-13 22:32:08,990 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:32:08,990 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:08,991 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:08,995 INFO L225 Difference]: With dead ends: 2057 [2025-04-13 22:32:08,995 INFO L226 Difference]: Without dead ends: 1971 [2025-04-13 22:32:08,996 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:32:08,996 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 225 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:08,996 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 48 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:08,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2025-04-13 22:32:09,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1893. [2025-04-13 22:32:09,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1892 states have (on average 2.875264270613108) internal successors, (5440), 1892 states have internal predecessors, (5440), 0 states have call successors, (0), 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:32:09,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 5440 transitions. [2025-04-13 22:32:09,018 INFO L79 Accepts]: Start accepts. Automaton has 1893 states and 5440 transitions. Word has length 56 [2025-04-13 22:32:09,018 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:09,018 INFO L485 AbstractCegarLoop]: Abstraction has 1893 states and 5440 transitions. [2025-04-13 22:32:09,018 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:09,018 INFO L278 IsEmpty]: Start isEmpty. Operand 1893 states and 5440 transitions. [2025-04-13 22:32:09,020 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:09,020 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:09,020 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:09,020 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 22:32:09,021 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:09,021 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:09,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1356157044, now seen corresponding path program 21 times [2025-04-13 22:32:09,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:09,021 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141220634] [2025-04-13 22:32:09,021 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:32:09,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:09,028 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:09,034 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:09,034 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:32:09,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:09,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:09,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:09,146 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141220634] [2025-04-13 22:32:09,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141220634] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:09,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:09,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:32:09,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204989326] [2025-04-13 22:32:09,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:09,147 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:32:09,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:09,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:32:09,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:32:09,147 INFO L87 Difference]: Start difference. First operand 1893 states and 5440 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:09,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:09,793 INFO L93 Difference]: Finished difference Result 2229 states and 6400 transitions. [2025-04-13 22:32:09,793 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:32:09,793 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:09,793 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:09,799 INFO L225 Difference]: With dead ends: 2229 [2025-04-13 22:32:09,799 INFO L226 Difference]: Without dead ends: 2165 [2025-04-13 22:32:09,800 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=1021, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:32:09,801 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 312 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 1737 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:09,801 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 103 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1737 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:32:09,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2025-04-13 22:32:09,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 1883. [2025-04-13 22:32:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1883 states, 1882 states have (on average 2.8772582359192347) internal successors, (5415), 1882 states have internal predecessors, (5415), 0 states have call successors, (0), 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:32:09,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 5415 transitions. [2025-04-13 22:32:09,822 INFO L79 Accepts]: Start accepts. Automaton has 1883 states and 5415 transitions. Word has length 56 [2025-04-13 22:32:09,822 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:09,823 INFO L485 AbstractCegarLoop]: Abstraction has 1883 states and 5415 transitions. [2025-04-13 22:32:09,823 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:09,823 INFO L278 IsEmpty]: Start isEmpty. Operand 1883 states and 5415 transitions. [2025-04-13 22:32:09,825 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:09,825 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:09,825 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:09,825 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 22:32:09,825 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:09,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:09,825 INFO L85 PathProgramCache]: Analyzing trace with hash 120654366, now seen corresponding path program 22 times [2025-04-13 22:32:09,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:09,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877465859] [2025-04-13 22:32:09,826 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:32:09,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:09,830 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:09,834 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:32:09,834 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:32:09,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:09,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:09,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:09,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877465859] [2025-04-13 22:32:09,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877465859] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:09,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:09,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:32:09,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139574283] [2025-04-13 22:32:09,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:09,937 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:09,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:09,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:09,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:32:09,937 INFO L87 Difference]: Start difference. First operand 1883 states and 5415 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:10,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:10,457 INFO L93 Difference]: Finished difference Result 2031 states and 5798 transitions. [2025-04-13 22:32:10,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:32:10,457 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:10,458 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:10,463 INFO L225 Difference]: With dead ends: 2031 [2025-04-13 22:32:10,463 INFO L226 Difference]: Without dead ends: 1966 [2025-04-13 22:32:10,463 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:32:10,464 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 210 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:10,464 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 53 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:32:10,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2025-04-13 22:32:10,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1888. [2025-04-13 22:32:10,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1887 states have (on average 2.8749337572866986) internal successors, (5425), 1887 states have internal predecessors, (5425), 0 states have call successors, (0), 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:32:10,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 5425 transitions. [2025-04-13 22:32:10,488 INFO L79 Accepts]: Start accepts. Automaton has 1888 states and 5425 transitions. Word has length 56 [2025-04-13 22:32:10,488 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:10,488 INFO L485 AbstractCegarLoop]: Abstraction has 1888 states and 5425 transitions. [2025-04-13 22:32:10,488 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:10,488 INFO L278 IsEmpty]: Start isEmpty. Operand 1888 states and 5425 transitions. [2025-04-13 22:32:10,491 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:10,491 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:10,491 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:10,491 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 22:32:10,491 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:10,492 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:10,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1180986832, now seen corresponding path program 23 times [2025-04-13 22:32:10,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:10,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773705717] [2025-04-13 22:32:10,492 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:32:10,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:10,500 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:10,514 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:10,514 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:32:10,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:11,571 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:32:11,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:11,572 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773705717] [2025-04-13 22:32:11,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773705717] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:11,572 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206900515] [2025-04-13 22:32:11,572 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:32:11,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:11,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:11,574 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:32:11,575 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:32:11,619 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:11,640 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:11,640 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:32:11,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:11,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:32:11,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:11,822 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:11,823 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:32:11,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:32:11,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:12,020 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:32:12,020 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:32:12,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:12,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206900515] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:12,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:32:12,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18, 12] total 32 [2025-04-13 22:32:12,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038218208] [2025-04-13 22:32:12,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:12,053 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:12,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:12,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:12,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=967, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:32:12,053 INFO L87 Difference]: Start difference. First operand 1888 states and 5425 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:12,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:12,828 INFO L93 Difference]: Finished difference Result 2035 states and 5811 transitions. [2025-04-13 22:32:12,828 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:32:12,828 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:12,828 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:12,833 INFO L225 Difference]: With dead ends: 2035 [2025-04-13 22:32:12,833 INFO L226 Difference]: Without dead ends: 1970 [2025-04-13 22:32:12,834 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=222, Invalid=2534, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:32:12,835 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 263 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:12,835 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 75 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:32:12,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2025-04-13 22:32:12,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1893. [2025-04-13 22:32:12,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1892 states have (on average 2.875264270613108) internal successors, (5440), 1892 states have internal predecessors, (5440), 0 states have call successors, (0), 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:32:12,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 5440 transitions. [2025-04-13 22:32:12,854 INFO L79 Accepts]: Start accepts. Automaton has 1893 states and 5440 transitions. Word has length 56 [2025-04-13 22:32:12,854 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:12,854 INFO L485 AbstractCegarLoop]: Abstraction has 1893 states and 5440 transitions. [2025-04-13 22:32:12,854 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:12,855 INFO L278 IsEmpty]: Start isEmpty. Operand 1893 states and 5440 transitions. [2025-04-13 22:32:12,856 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:12,856 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:12,856 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:12,862 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:32:13,057 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:13,057 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:13,057 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:13,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1433006946, now seen corresponding path program 24 times [2025-04-13 22:32:13,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:13,058 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506043583] [2025-04-13 22:32:13,058 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:32:13,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:13,062 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:13,069 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:13,070 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:32:13,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:13,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:13,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:13,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506043583] [2025-04-13 22:32:13,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506043583] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:13,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:13,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:32:13,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078051413] [2025-04-13 22:32:13,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:13,215 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:13,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:13,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:13,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:32:13,216 INFO L87 Difference]: Start difference. First operand 1893 states and 5440 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:13,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:13,697 INFO L93 Difference]: Finished difference Result 2004 states and 5714 transitions. [2025-04-13 22:32:13,697 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:32:13,698 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:13,698 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:13,703 INFO L225 Difference]: With dead ends: 2004 [2025-04-13 22:32:13,703 INFO L226 Difference]: Without dead ends: 1935 [2025-04-13 22:32:13,704 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:32:13,704 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 173 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:13,704 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 52 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:32:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2025-04-13 22:32:13,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1883. [2025-04-13 22:32:13,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1883 states, 1882 states have (on average 2.8772582359192347) internal successors, (5415), 1882 states have internal predecessors, (5415), 0 states have call successors, (0), 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:32:13,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 5415 transitions. [2025-04-13 22:32:13,725 INFO L79 Accepts]: Start accepts. Automaton has 1883 states and 5415 transitions. Word has length 56 [2025-04-13 22:32:13,725 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:13,725 INFO L485 AbstractCegarLoop]: Abstraction has 1883 states and 5415 transitions. [2025-04-13 22:32:13,725 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:13,725 INFO L278 IsEmpty]: Start isEmpty. Operand 1883 states and 5415 transitions. [2025-04-13 22:32:13,727 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:13,727 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:13,727 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:13,727 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 22:32:13,727 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:13,727 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:13,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1256973342, now seen corresponding path program 25 times [2025-04-13 22:32:13,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:13,727 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252144681] [2025-04-13 22:32:13,727 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:32:13,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:13,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:32:13,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:13,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:13,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:14,788 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:32:14,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:14,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252144681] [2025-04-13 22:32:14,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252144681] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:14,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287429299] [2025-04-13 22:32:14,788 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:32:14,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:14,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:14,790 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:32:14,791 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:32:14,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:32:14,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:14,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:14,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:14,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:32:14,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:15,052 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:15,052 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:32:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:32:15,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:15,241 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:32:15,241 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:32:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:15,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287429299] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:15,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:32:15,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 22:32:15,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336618131] [2025-04-13 22:32:15,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:15,266 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:15,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:15,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:15,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=859, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:32:15,267 INFO L87 Difference]: Start difference. First operand 1883 states and 5415 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:15,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:15,975 INFO L93 Difference]: Finished difference Result 2009 states and 5739 transitions. [2025-04-13 22:32:15,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:32:15,975 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:15,975 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:15,980 INFO L225 Difference]: With dead ends: 2009 [2025-04-13 22:32:15,980 INFO L226 Difference]: Without dead ends: 1950 [2025-04-13 22:32:15,981 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=181, Invalid=2171, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:32:15,981 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 230 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:15,981 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 75 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:32:15,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2025-04-13 22:32:15,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1878. [2025-04-13 22:32:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1877 states have (on average 2.876931273308471) internal successors, (5400), 1877 states have internal predecessors, (5400), 0 states have call successors, (0), 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:32:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 5400 transitions. [2025-04-13 22:32:16,000 INFO L79 Accepts]: Start accepts. Automaton has 1878 states and 5400 transitions. Word has length 56 [2025-04-13 22:32:16,001 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:16,001 INFO L485 AbstractCegarLoop]: Abstraction has 1878 states and 5400 transitions. [2025-04-13 22:32:16,001 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:16,001 INFO L278 IsEmpty]: Start isEmpty. Operand 1878 states and 5400 transitions. [2025-04-13 22:32:16,002 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:16,003 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:16,003 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:16,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 22:32:16,203 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,SelfDestructingSolverStorable25 [2025-04-13 22:32:16,205 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:16,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:16,205 INFO L85 PathProgramCache]: Analyzing trace with hash -499263978, now seen corresponding path program 26 times [2025-04-13 22:32:16,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:16,205 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159194286] [2025-04-13 22:32:16,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:32:16,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:16,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:16,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:16,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:32:16,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:16,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:16,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:16,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159194286] [2025-04-13 22:32:16,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159194286] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:16,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:16,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:32:16,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446039896] [2025-04-13 22:32:16,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:16,326 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:32:16,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:16,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:32:16,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:32:16,327 INFO L87 Difference]: Start difference. First operand 1878 states and 5400 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:16,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:16,941 INFO L93 Difference]: Finished difference Result 2016 states and 5753 transitions. [2025-04-13 22:32:16,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:32:16,941 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:16,941 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:16,946 INFO L225 Difference]: With dead ends: 2016 [2025-04-13 22:32:16,947 INFO L226 Difference]: Without dead ends: 1930 [2025-04-13 22:32:16,947 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:32:16,947 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 269 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:16,947 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 68 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:32:16,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2025-04-13 22:32:16,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1888. [2025-04-13 22:32:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1887 states have (on average 2.8749337572866986) internal successors, (5425), 1887 states have internal predecessors, (5425), 0 states have call successors, (0), 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:32:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 5425 transitions. [2025-04-13 22:32:16,968 INFO L79 Accepts]: Start accepts. Automaton has 1888 states and 5425 transitions. Word has length 56 [2025-04-13 22:32:16,968 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:16,968 INFO L485 AbstractCegarLoop]: Abstraction has 1888 states and 5425 transitions. [2025-04-13 22:32:16,968 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:16,968 INFO L278 IsEmpty]: Start isEmpty. Operand 1888 states and 5425 transitions. [2025-04-13 22:32:16,970 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:16,970 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:16,970 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:16,970 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 22:32:16,970 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:16,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:16,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1254347566, now seen corresponding path program 27 times [2025-04-13 22:32:16,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:16,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164526882] [2025-04-13 22:32:16,971 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:32:16,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:16,979 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:16,985 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:16,985 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:32:16,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:17,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:17,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164526882] [2025-04-13 22:32:17,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164526882] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:17,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:17,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:32:17,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538429143] [2025-04-13 22:32:17,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:17,094 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:32:17,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:17,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:32:17,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:32:17,095 INFO L87 Difference]: Start difference. First operand 1888 states and 5425 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:17,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:17,560 INFO L93 Difference]: Finished difference Result 1993 states and 5687 transitions. [2025-04-13 22:32:17,560 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:32:17,560 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:17,561 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:17,566 INFO L225 Difference]: With dead ends: 1993 [2025-04-13 22:32:17,566 INFO L226 Difference]: Without dead ends: 1869 [2025-04-13 22:32:17,566 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:32:17,567 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 215 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1306 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:17,567 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 75 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:32:17,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2025-04-13 22:32:17,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1828. [2025-04-13 22:32:17,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1828 states, 1827 states have (on average 2.873015873015873) internal successors, (5249), 1827 states have internal predecessors, (5249), 0 states have call successors, (0), 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:32:17,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 5249 transitions. [2025-04-13 22:32:17,586 INFO L79 Accepts]: Start accepts. Automaton has 1828 states and 5249 transitions. Word has length 56 [2025-04-13 22:32:17,586 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:17,586 INFO L485 AbstractCegarLoop]: Abstraction has 1828 states and 5249 transitions. [2025-04-13 22:32:17,586 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:17,586 INFO L278 IsEmpty]: Start isEmpty. Operand 1828 states and 5249 transitions. [2025-04-13 22:32:17,588 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:17,588 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:17,588 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:17,588 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 22:32:17,588 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:17,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:17,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1152279342, now seen corresponding path program 28 times [2025-04-13 22:32:17,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:17,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320083269] [2025-04-13 22:32:17,588 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:32:17,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:17,594 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:17,597 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:32:17,597 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:32:17,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:17,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:17,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:17,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320083269] [2025-04-13 22:32:17,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320083269] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:17,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:17,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:32:17,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853456467] [2025-04-13 22:32:17,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:17,706 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:17,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:17,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:17,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:32:17,707 INFO L87 Difference]: Start difference. First operand 1828 states and 5249 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:18,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:18,259 INFO L93 Difference]: Finished difference Result 1966 states and 5602 transitions. [2025-04-13 22:32:18,259 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:32:18,259 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:18,259 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:18,264 INFO L225 Difference]: With dead ends: 1966 [2025-04-13 22:32:18,264 INFO L226 Difference]: Without dead ends: 1901 [2025-04-13 22:32:18,265 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:32:18,265 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 270 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:18,265 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 76 Invalid, 1552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:32:18,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2025-04-13 22:32:18,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1833. [2025-04-13 22:32:18,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1833 states, 1832 states have (on average 2.870633187772926) internal successors, (5259), 1832 states have internal predecessors, (5259), 0 states have call successors, (0), 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:32:18,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 5259 transitions. [2025-04-13 22:32:18,284 INFO L79 Accepts]: Start accepts. Automaton has 1833 states and 5259 transitions. Word has length 56 [2025-04-13 22:32:18,284 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:18,284 INFO L485 AbstractCegarLoop]: Abstraction has 1833 states and 5259 transitions. [2025-04-13 22:32:18,284 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:18,284 INFO L278 IsEmpty]: Start isEmpty. Operand 1833 states and 5259 transitions. [2025-04-13 22:32:18,286 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:18,286 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:18,286 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:18,286 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 22:32:18,286 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:18,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:18,287 INFO L85 PathProgramCache]: Analyzing trace with hash 45840338, now seen corresponding path program 29 times [2025-04-13 22:32:18,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:18,287 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269236946] [2025-04-13 22:32:18,287 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:32:18,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:18,291 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:18,305 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:18,305 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:32:18,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:19,250 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:32:19,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:19,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269236946] [2025-04-13 22:32:19,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269236946] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:19,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980847461] [2025-04-13 22:32:19,250 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:32:19,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:19,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:19,252 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:32:19,253 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:32:19,302 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:19,325 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:19,326 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:32:19,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:19,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:32:19,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:19,544 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:19,544 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:32:19,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:19,548 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:32:19,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980847461] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:19,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:32:19,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 24 [2025-04-13 22:32:19,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115463534] [2025-04-13 22:32:19,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:19,548 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:19,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:19,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:19,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:32:19,549 INFO L87 Difference]: Start difference. First operand 1833 states and 5259 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:20,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:20,498 INFO L93 Difference]: Finished difference Result 1981 states and 5642 transitions. [2025-04-13 22:32:20,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:32:20,498 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:20,498 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:20,503 INFO L225 Difference]: With dead ends: 1981 [2025-04-13 22:32:20,503 INFO L226 Difference]: Without dead ends: 1874 [2025-04-13 22:32:20,504 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=1561, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 22:32:20,504 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 237 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:20,504 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 61 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:32:20,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2025-04-13 22:32:20,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1853. [2025-04-13 22:32:20,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1852 states have (on average 2.8666306695464363) internal successors, (5309), 1852 states have internal predecessors, (5309), 0 states have call successors, (0), 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:32:20,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 5309 transitions. [2025-04-13 22:32:20,524 INFO L79 Accepts]: Start accepts. Automaton has 1853 states and 5309 transitions. Word has length 56 [2025-04-13 22:32:20,524 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:20,524 INFO L485 AbstractCegarLoop]: Abstraction has 1853 states and 5309 transitions. [2025-04-13 22:32:20,525 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:20,525 INFO L278 IsEmpty]: Start isEmpty. Operand 1853 states and 5309 transitions. [2025-04-13 22:32:20,526 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:20,526 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:20,526 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:20,532 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:32:20,727 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:20,727 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:20,727 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:20,727 INFO L85 PathProgramCache]: Analyzing trace with hash 160073238, now seen corresponding path program 30 times [2025-04-13 22:32:20,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:20,727 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091377730] [2025-04-13 22:32:20,727 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:32:20,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:20,731 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:20,737 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:20,737 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:32:20,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:20,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:20,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:20,859 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091377730] [2025-04-13 22:32:20,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091377730] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:20,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:20,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:32:20,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61577967] [2025-04-13 22:32:20,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:20,860 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:20,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:20,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:20,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:32:20,860 INFO L87 Difference]: Start difference. First operand 1853 states and 5309 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:21,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:21,373 INFO L93 Difference]: Finished difference Result 1949 states and 5543 transitions. [2025-04-13 22:32:21,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:32:21,373 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:21,373 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:21,379 INFO L225 Difference]: With dead ends: 1949 [2025-04-13 22:32:21,379 INFO L226 Difference]: Without dead ends: 1885 [2025-04-13 22:32:21,380 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:32:21,380 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 239 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:21,380 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 76 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:32:21,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1885 states. [2025-04-13 22:32:21,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1885 to 1843. [2025-04-13 22:32:21,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1843 states, 1842 states have (on average 2.8686210640608034) internal successors, (5284), 1842 states have internal predecessors, (5284), 0 states have call successors, (0), 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:32:21,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 5284 transitions. [2025-04-13 22:32:21,402 INFO L79 Accepts]: Start accepts. Automaton has 1843 states and 5284 transitions. Word has length 56 [2025-04-13 22:32:21,402 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:21,402 INFO L485 AbstractCegarLoop]: Abstraction has 1843 states and 5284 transitions. [2025-04-13 22:32:21,402 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:21,402 INFO L278 IsEmpty]: Start isEmpty. Operand 1843 states and 5284 transitions. [2025-04-13 22:32:21,404 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:21,404 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:21,404 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:21,404 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 22:32:21,404 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:21,404 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:21,404 INFO L85 PathProgramCache]: Analyzing trace with hash -790433872, now seen corresponding path program 31 times [2025-04-13 22:32:21,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:21,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335632950] [2025-04-13 22:32:21,405 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:32:21,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:21,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:32:21,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:21,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:21,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:22,088 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:32:22,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:22,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335632950] [2025-04-13 22:32:22,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335632950] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:22,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007031727] [2025-04-13 22:32:22,088 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:32:22,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:22,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:22,090 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:32:22,092 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:32:22,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:32:22,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:22,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:22,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:22,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:32:22,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:22,333 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:22,333 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:32:22,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:32:22,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:22,496 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:32:22,497 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:32:22,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:22,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007031727] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:22,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:32:22,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 22:32:22,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936369974] [2025-04-13 22:32:22,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:22,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:22,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:22,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:22,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:32:22,546 INFO L87 Difference]: Start difference. First operand 1843 states and 5284 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:23,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:23,194 INFO L93 Difference]: Finished difference Result 1955 states and 5560 transitions. [2025-04-13 22:32:23,194 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:32:23,194 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:23,194 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:23,199 INFO L225 Difference]: With dead ends: 1955 [2025-04-13 22:32:23,199 INFO L226 Difference]: Without dead ends: 1890 [2025-04-13 22:32:23,200 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=182, Invalid=2074, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:32:23,200 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 193 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:23,200 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 61 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1305 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:32:23,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2025-04-13 22:32:23,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1853. [2025-04-13 22:32:23,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1852 states have (on average 2.863930885529158) internal successors, (5304), 1852 states have internal predecessors, (5304), 0 states have call successors, (0), 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:32:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 5304 transitions. [2025-04-13 22:32:23,222 INFO L79 Accepts]: Start accepts. Automaton has 1853 states and 5304 transitions. Word has length 56 [2025-04-13 22:32:23,222 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:23,222 INFO L485 AbstractCegarLoop]: Abstraction has 1853 states and 5304 transitions. [2025-04-13 22:32:23,222 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:23,222 INFO L278 IsEmpty]: Start isEmpty. Operand 1853 states and 5304 transitions. [2025-04-13 22:32:23,224 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:23,224 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:23,224 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:23,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 22:32:23,424 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,SelfDestructingSolverStorable31 [2025-04-13 22:32:23,424 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:23,425 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:23,425 INFO L85 PathProgramCache]: Analyzing trace with hash 185287872, now seen corresponding path program 32 times [2025-04-13 22:32:23,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:23,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291011388] [2025-04-13 22:32:23,425 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:32:23,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:23,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:23,435 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:23,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:32:23,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:23,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:23,541 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291011388] [2025-04-13 22:32:23,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291011388] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:23,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:23,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:32:23,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62357013] [2025-04-13 22:32:23,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:23,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:23,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:23,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:23,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:32:23,541 INFO L87 Difference]: Start difference. First operand 1853 states and 5304 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:24,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:24,013 INFO L93 Difference]: Finished difference Result 1970 states and 5600 transitions. [2025-04-13 22:32:24,013 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:32:24,013 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:24,013 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:24,019 INFO L225 Difference]: With dead ends: 1970 [2025-04-13 22:32:24,019 INFO L226 Difference]: Without dead ends: 1905 [2025-04-13 22:32:24,020 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:32:24,020 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 233 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:24,020 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 65 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2025-04-13 22:32:24,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1858. [2025-04-13 22:32:24,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1857 states have (on average 2.864297253634895) internal successors, (5319), 1857 states have internal predecessors, (5319), 0 states have call successors, (0), 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:32:24,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 5319 transitions. [2025-04-13 22:32:24,039 INFO L79 Accepts]: Start accepts. Automaton has 1858 states and 5319 transitions. Word has length 56 [2025-04-13 22:32:24,040 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:24,040 INFO L485 AbstractCegarLoop]: Abstraction has 1858 states and 5319 transitions. [2025-04-13 22:32:24,040 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:24,040 INFO L278 IsEmpty]: Start isEmpty. Operand 1858 states and 5319 transitions. [2025-04-13 22:32:24,041 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:24,041 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:24,042 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:24,042 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 22:32:24,042 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:24,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:24,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1066573250, now seen corresponding path program 33 times [2025-04-13 22:32:24,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:24,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855946254] [2025-04-13 22:32:24,042 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:32:24,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:24,047 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:24,052 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:24,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:32:24,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:24,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:24,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:24,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855946254] [2025-04-13 22:32:24,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855946254] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:24,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:24,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:32:24,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952283980] [2025-04-13 22:32:24,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:24,179 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:24,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:24,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:24,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:32:24,179 INFO L87 Difference]: Start difference. First operand 1858 states and 5319 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:24,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:24,674 INFO L93 Difference]: Finished difference Result 1964 states and 5578 transitions. [2025-04-13 22:32:24,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:32:24,674 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:24,674 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:24,679 INFO L225 Difference]: With dead ends: 1964 [2025-04-13 22:32:24,679 INFO L226 Difference]: Without dead ends: 1895 [2025-04-13 22:32:24,679 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:32:24,680 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 180 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:24,680 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 61 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:32:24,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2025-04-13 22:32:24,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1858. [2025-04-13 22:32:24,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1857 states have (on average 2.8616047388260637) internal successors, (5314), 1857 states have internal predecessors, (5314), 0 states have call successors, (0), 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:32:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 5314 transitions. [2025-04-13 22:32:24,699 INFO L79 Accepts]: Start accepts. Automaton has 1858 states and 5314 transitions. Word has length 56 [2025-04-13 22:32:24,699 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:24,699 INFO L485 AbstractCegarLoop]: Abstraction has 1858 states and 5314 transitions. [2025-04-13 22:32:24,699 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:24,699 INFO L278 IsEmpty]: Start isEmpty. Operand 1858 states and 5314 transitions. [2025-04-13 22:32:24,701 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:24,701 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:24,701 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:24,701 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 22:32:24,701 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:24,701 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:24,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1497640452, now seen corresponding path program 34 times [2025-04-13 22:32:24,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:24,701 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532088793] [2025-04-13 22:32:24,701 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:32:24,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:24,705 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:24,708 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:32:24,708 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:32:24,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:24,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:24,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:24,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532088793] [2025-04-13 22:32:24,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532088793] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:24,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:24,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:32:24,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742773667] [2025-04-13 22:32:24,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:24,803 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:24,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:24,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:24,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:32:24,803 INFO L87 Difference]: Start difference. First operand 1858 states and 5314 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:25,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:25,261 INFO L93 Difference]: Finished difference Result 1954 states and 5548 transitions. [2025-04-13 22:32:25,261 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:32:25,261 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:25,262 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:25,267 INFO L225 Difference]: With dead ends: 1954 [2025-04-13 22:32:25,267 INFO L226 Difference]: Without dead ends: 1895 [2025-04-13 22:32:25,267 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:32:25,268 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 199 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:25,268 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 65 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:25,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2025-04-13 22:32:25,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1853. [2025-04-13 22:32:25,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1852 states have (on average 2.861231101511879) internal successors, (5299), 1852 states have internal predecessors, (5299), 0 states have call successors, (0), 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:32:25,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 5299 transitions. [2025-04-13 22:32:25,287 INFO L79 Accepts]: Start accepts. Automaton has 1853 states and 5299 transitions. Word has length 56 [2025-04-13 22:32:25,287 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:25,287 INFO L485 AbstractCegarLoop]: Abstraction has 1853 states and 5299 transitions. [2025-04-13 22:32:25,287 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:25,287 INFO L278 IsEmpty]: Start isEmpty. Operand 1853 states and 5299 transitions. [2025-04-13 22:32:25,289 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:25,289 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:25,289 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:25,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 22:32:25,289 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:25,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:25,289 INFO L85 PathProgramCache]: Analyzing trace with hash -2119131292, now seen corresponding path program 35 times [2025-04-13 22:32:25,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:25,289 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551921246] [2025-04-13 22:32:25,289 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:32:25,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:25,294 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:25,303 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:25,303 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:32:25,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:26,275 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:32:26,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:26,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551921246] [2025-04-13 22:32:26,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551921246] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:26,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199712978] [2025-04-13 22:32:26,275 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:32:26,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:26,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:26,277 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:32:26,278 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:32:26,328 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:26,348 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:26,349 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:32:26,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:26,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:32:26,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:26,529 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:26,529 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:32:26,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:26,540 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:32:26,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199712978] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:26,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:32:26,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18] total 25 [2025-04-13 22:32:26,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283085716] [2025-04-13 22:32:26,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:26,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:26,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:26,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:26,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:32:26,541 INFO L87 Difference]: Start difference. First operand 1853 states and 5299 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:27,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:27,355 INFO L93 Difference]: Finished difference Result 1945 states and 5525 transitions. [2025-04-13 22:32:27,358 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:32:27,359 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:27,359 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:27,364 INFO L225 Difference]: With dead ends: 1945 [2025-04-13 22:32:27,364 INFO L226 Difference]: Without dead ends: 1880 [2025-04-13 22:32:27,364 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=1720, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:32:27,365 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 218 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:27,365 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 61 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:32:27,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2025-04-13 22:32:27,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1838. [2025-04-13 22:32:27,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 2.865541643984758) internal successors, (5264), 1837 states have internal predecessors, (5264), 0 states have call successors, (0), 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:32:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 5264 transitions. [2025-04-13 22:32:27,383 INFO L79 Accepts]: Start accepts. Automaton has 1838 states and 5264 transitions. Word has length 56 [2025-04-13 22:32:27,383 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:27,383 INFO L485 AbstractCegarLoop]: Abstraction has 1838 states and 5264 transitions. [2025-04-13 22:32:27,383 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:27,383 INFO L278 IsEmpty]: Start isEmpty. Operand 1838 states and 5264 transitions. [2025-04-13 22:32:27,385 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:27,385 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:27,385 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:27,391 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:32:27,585 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,SelfDestructingSolverStorable35 [2025-04-13 22:32:27,586 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:27,586 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:27,586 INFO L85 PathProgramCache]: Analyzing trace with hash -273956108, now seen corresponding path program 36 times [2025-04-13 22:32:27,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:27,586 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080295583] [2025-04-13 22:32:27,586 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:32:27,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:27,590 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:27,595 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:27,595 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:32:27,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:27,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:27,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:27,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080295583] [2025-04-13 22:32:27,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080295583] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:27,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:27,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:32:27,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054443393] [2025-04-13 22:32:27,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:27,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:27,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:27,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:27,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:32:27,708 INFO L87 Difference]: Start difference. First operand 1838 states and 5264 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:28,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:28,172 INFO L93 Difference]: Finished difference Result 1913 states and 5436 transitions. [2025-04-13 22:32:28,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:32:28,172 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:28,172 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:28,178 INFO L225 Difference]: With dead ends: 1913 [2025-04-13 22:32:28,178 INFO L226 Difference]: Without dead ends: 1825 [2025-04-13 22:32:28,178 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=796, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:32:28,178 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 201 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:28,179 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 64 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:32:28,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2025-04-13 22:32:28,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1814. [2025-04-13 22:32:28,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1814 states, 1813 states have (on average 2.873138444567016) internal successors, (5209), 1813 states have internal predecessors, (5209), 0 states have call successors, (0), 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:32:28,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 5209 transitions. [2025-04-13 22:32:28,197 INFO L79 Accepts]: Start accepts. Automaton has 1814 states and 5209 transitions. Word has length 56 [2025-04-13 22:32:28,197 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:28,197 INFO L485 AbstractCegarLoop]: Abstraction has 1814 states and 5209 transitions. [2025-04-13 22:32:28,197 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:28,197 INFO L278 IsEmpty]: Start isEmpty. Operand 1814 states and 5209 transitions. [2025-04-13 22:32:28,199 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:28,199 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:28,199 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:28,199 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 22:32:28,199 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:28,200 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:28,200 INFO L85 PathProgramCache]: Analyzing trace with hash -437294382, now seen corresponding path program 37 times [2025-04-13 22:32:28,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:28,200 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561545420] [2025-04-13 22:32:28,200 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:32:28,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:28,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:32:28,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:28,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:28,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:28,841 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:32:28,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:28,841 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561545420] [2025-04-13 22:32:28,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561545420] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:28,841 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701056975] [2025-04-13 22:32:28,841 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:32:28,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:28,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:28,843 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:32:28,844 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:32:28,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:32:28,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:28,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:28,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:28,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:32:28,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:29,075 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:29,076 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:32:29,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:32:29,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:29,245 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:32:29,245 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:32:29,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:29,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701056975] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:29,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:32:29,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 22:32:29,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833783852] [2025-04-13 22:32:29,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:29,270 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:29,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:29,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:29,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:32:29,271 INFO L87 Difference]: Start difference. First operand 1814 states and 5209 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:29,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:29,988 INFO L93 Difference]: Finished difference Result 1931 states and 5505 transitions. [2025-04-13 22:32:29,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:32:29,988 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:29,989 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:29,994 INFO L225 Difference]: With dead ends: 1931 [2025-04-13 22:32:29,994 INFO L226 Difference]: Without dead ends: 1866 [2025-04-13 22:32:29,994 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=204, Invalid=2346, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:32:29,995 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 230 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:29,995 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 68 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:32:29,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2025-04-13 22:32:30,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1824. [2025-04-13 22:32:30,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1823 states have (on average 2.8710916072408117) internal successors, (5234), 1823 states have internal predecessors, (5234), 0 states have call successors, (0), 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:32:30,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 5234 transitions. [2025-04-13 22:32:30,014 INFO L79 Accepts]: Start accepts. Automaton has 1824 states and 5234 transitions. Word has length 56 [2025-04-13 22:32:30,014 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:30,014 INFO L485 AbstractCegarLoop]: Abstraction has 1824 states and 5234 transitions. [2025-04-13 22:32:30,014 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:30,014 INFO L278 IsEmpty]: Start isEmpty. Operand 1824 states and 5234 transitions. [2025-04-13 22:32:30,016 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:30,016 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:30,016 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:30,022 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:32:30,217 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-13 22:32:30,217 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:30,217 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:30,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1696930412, now seen corresponding path program 38 times [2025-04-13 22:32:30,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:30,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537763962] [2025-04-13 22:32:30,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:32:30,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:30,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:30,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:30,226 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:32:30,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:30,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:30,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:30,335 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537763962] [2025-04-13 22:32:30,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537763962] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:30,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:30,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:32:30,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303772440] [2025-04-13 22:32:30,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:30,335 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:30,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:30,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:30,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:32:30,336 INFO L87 Difference]: Start difference. First operand 1824 states and 5234 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:30,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:30,799 INFO L93 Difference]: Finished difference Result 1920 states and 5468 transitions. [2025-04-13 22:32:30,799 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:32:30,799 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:30,799 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:30,805 INFO L225 Difference]: With dead ends: 1920 [2025-04-13 22:32:30,805 INFO L226 Difference]: Without dead ends: 1861 [2025-04-13 22:32:30,805 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:32:30,806 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 205 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:30,806 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 74 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:32:30,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2025-04-13 22:32:30,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1819. [2025-04-13 22:32:30,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1819 states, 1818 states have (on average 2.8707370737073705) internal successors, (5219), 1818 states have internal predecessors, (5219), 0 states have call successors, (0), 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:32:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 5219 transitions. [2025-04-13 22:32:30,839 INFO L79 Accepts]: Start accepts. Automaton has 1819 states and 5219 transitions. Word has length 56 [2025-04-13 22:32:30,839 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:30,839 INFO L485 AbstractCegarLoop]: Abstraction has 1819 states and 5219 transitions. [2025-04-13 22:32:30,839 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:30,839 INFO L278 IsEmpty]: Start isEmpty. Operand 1819 states and 5219 transitions. [2025-04-13 22:32:30,841 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:30,841 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:30,841 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:30,841 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 22:32:30,841 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:30,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:30,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1422338516, now seen corresponding path program 39 times [2025-04-13 22:32:30,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:30,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245696355] [2025-04-13 22:32:30,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:32:30,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:30,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:30,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:30,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:32:30,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:30,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:30,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:30,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245696355] [2025-04-13 22:32:30,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245696355] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:30,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:30,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:32:30,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413910441] [2025-04-13 22:32:30,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:30,961 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:30,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:30,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:30,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:32:30,962 INFO L87 Difference]: Start difference. First operand 1819 states and 5219 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:31,420 INFO L93 Difference]: Finished difference Result 1894 states and 5391 transitions. [2025-04-13 22:32:31,420 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:32:31,421 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:31,421 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:31,426 INFO L225 Difference]: With dead ends: 1894 [2025-04-13 22:32:31,426 INFO L226 Difference]: Without dead ends: 1663 [2025-04-13 22:32:31,426 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:32:31,427 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 209 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:31,427 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 73 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:31,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2025-04-13 22:32:31,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1652. [2025-04-13 22:32:31,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1652 states, 1651 states have (on average 2.8976377952755907) internal successors, (4784), 1651 states have internal predecessors, (4784), 0 states have call successors, (0), 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:32:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 4784 transitions. [2025-04-13 22:32:31,444 INFO L79 Accepts]: Start accepts. Automaton has 1652 states and 4784 transitions. Word has length 56 [2025-04-13 22:32:31,444 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:31,444 INFO L485 AbstractCegarLoop]: Abstraction has 1652 states and 4784 transitions. [2025-04-13 22:32:31,444 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:31,444 INFO L278 IsEmpty]: Start isEmpty. Operand 1652 states and 4784 transitions. [2025-04-13 22:32:31,446 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:31,446 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:31,446 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:31,446 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-13 22:32:31,446 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:31,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:31,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1140498896, now seen corresponding path program 40 times [2025-04-13 22:32:31,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:31,447 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126871716] [2025-04-13 22:32:31,447 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:32:31,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:31,451 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:31,453 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:32:31,453 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:32:31,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:31,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:31,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:31,518 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126871716] [2025-04-13 22:32:31,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126871716] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:31,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:31,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:32:31,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567530282] [2025-04-13 22:32:31,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:31,518 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:32:31,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:31,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:32:31,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:32:31,519 INFO L87 Difference]: Start difference. First operand 1652 states and 4784 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:31,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:31,949 INFO L93 Difference]: Finished difference Result 2069 states and 6022 transitions. [2025-04-13 22:32:31,950 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:32:31,950 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:31,950 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:31,955 INFO L225 Difference]: With dead ends: 2069 [2025-04-13 22:32:31,955 INFO L226 Difference]: Without dead ends: 2004 [2025-04-13 22:32:31,956 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:32:31,956 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 179 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:31,956 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 79 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:31,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2025-04-13 22:32:31,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1782. [2025-04-13 22:32:31,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1781 states have (on average 2.9124087591240877) internal successors, (5187), 1781 states have internal predecessors, (5187), 0 states have call successors, (0), 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:32:31,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 5187 transitions. [2025-04-13 22:32:31,974 INFO L79 Accepts]: Start accepts. Automaton has 1782 states and 5187 transitions. Word has length 56 [2025-04-13 22:32:31,975 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:31,975 INFO L485 AbstractCegarLoop]: Abstraction has 1782 states and 5187 transitions. [2025-04-13 22:32:31,975 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:31,975 INFO L278 IsEmpty]: Start isEmpty. Operand 1782 states and 5187 transitions. [2025-04-13 22:32:31,977 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:31,977 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:31,977 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:31,977 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-13 22:32:31,977 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:31,977 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:31,977 INFO L85 PathProgramCache]: Analyzing trace with hash 457573678, now seen corresponding path program 41 times [2025-04-13 22:32:31,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:31,977 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884450443] [2025-04-13 22:32:31,977 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:32:31,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:31,981 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:31,991 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:31,991 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:32:31,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:33,345 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:32:33,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:33,346 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884450443] [2025-04-13 22:32:33,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884450443] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:33,346 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889491383] [2025-04-13 22:32:33,346 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:32:33,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:33,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:33,347 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:32:33,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 22:32:33,393 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:33,411 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:33,411 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:32:33,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:33,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:32:33,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:33,622 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:33,622 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:32:33,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:33,643 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:32:33,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889491383] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:33,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:32:33,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 26 [2025-04-13 22:32:33,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262394205] [2025-04-13 22:32:33,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:33,644 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:33,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:33,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:33,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:32:33,644 INFO L87 Difference]: Start difference. First operand 1782 states and 5187 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:34,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:34,592 INFO L93 Difference]: Finished difference Result 2097 states and 6049 transitions. [2025-04-13 22:32:34,592 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:32:34,592 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:34,592 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:34,598 INFO L225 Difference]: With dead ends: 2097 [2025-04-13 22:32:34,598 INFO L226 Difference]: Without dead ends: 1933 [2025-04-13 22:32:34,598 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=1716, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:32:34,599 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 223 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:34,599 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 87 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:32:34,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2025-04-13 22:32:34,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1782. [2025-04-13 22:32:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1781 states have (on average 2.884334643458731) internal successors, (5137), 1781 states have internal predecessors, (5137), 0 states have call successors, (0), 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:32:34,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 5137 transitions. [2025-04-13 22:32:34,617 INFO L79 Accepts]: Start accepts. Automaton has 1782 states and 5137 transitions. Word has length 56 [2025-04-13 22:32:34,617 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:34,617 INFO L485 AbstractCegarLoop]: Abstraction has 1782 states and 5137 transitions. [2025-04-13 22:32:34,617 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:34,617 INFO L278 IsEmpty]: Start isEmpty. Operand 1782 states and 5137 transitions. [2025-04-13 22:32:34,619 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:34,619 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:34,619 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:34,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 22:32:34,819 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-04-13 22:32:34,819 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:34,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:34,820 INFO L85 PathProgramCache]: Analyzing trace with hash 887725420, now seen corresponding path program 42 times [2025-04-13 22:32:34,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:34,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241565726] [2025-04-13 22:32:34,820 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:32:34,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:34,825 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:34,829 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:34,830 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:32:34,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:34,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:34,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:34,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241565726] [2025-04-13 22:32:34,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241565726] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:34,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:34,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:32:34,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609935495] [2025-04-13 22:32:34,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:34,933 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:32:34,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:34,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:32:34,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:32:34,934 INFO L87 Difference]: Start difference. First operand 1782 states and 5137 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:35,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:35,353 INFO L93 Difference]: Finished difference Result 2008 states and 5779 transitions. [2025-04-13 22:32:35,353 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:32:35,353 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:35,354 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:35,359 INFO L225 Difference]: With dead ends: 2008 [2025-04-13 22:32:35,359 INFO L226 Difference]: Without dead ends: 1949 [2025-04-13 22:32:35,360 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=733, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:32:35,360 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 188 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:35,360 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 76 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:35,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2025-04-13 22:32:35,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1777. [2025-04-13 22:32:35,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1776 states have (on average 2.884009009009009) internal successors, (5122), 1776 states have internal predecessors, (5122), 0 states have call successors, (0), 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:32:35,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 5122 transitions. [2025-04-13 22:32:35,379 INFO L79 Accepts]: Start accepts. Automaton has 1777 states and 5122 transitions. Word has length 56 [2025-04-13 22:32:35,379 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:35,379 INFO L485 AbstractCegarLoop]: Abstraction has 1777 states and 5122 transitions. [2025-04-13 22:32:35,380 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:35,380 INFO L278 IsEmpty]: Start isEmpty. Operand 1777 states and 5122 transitions. [2025-04-13 22:32:35,381 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:35,381 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:35,381 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:35,382 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-13 22:32:35,382 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:35,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:35,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1840529264, now seen corresponding path program 43 times [2025-04-13 22:32:35,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:35,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110367411] [2025-04-13 22:32:35,382 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:32:35,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:35,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:32:35,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:35,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:35,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:36,184 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:32:36,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:36,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110367411] [2025-04-13 22:32:36,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110367411] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:36,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836372680] [2025-04-13 22:32:36,184 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:32:36,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:36,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:36,186 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:32:36,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 22:32:36,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:32:36,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:36,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:36,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:36,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:32:36,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:36,476 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:36,476 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:32:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:32:36,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:36,677 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:32:36,678 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:32:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:36,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836372680] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:36,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:32:36,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 32 [2025-04-13 22:32:36,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587040683] [2025-04-13 22:32:36,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:36,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:36,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:36,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:36,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=978, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:32:36,700 INFO L87 Difference]: Start difference. First operand 1777 states and 5122 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:37,359 INFO L93 Difference]: Finished difference Result 1982 states and 5702 transitions. [2025-04-13 22:32:37,360 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:32:37,360 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:37,360 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:37,365 INFO L225 Difference]: With dead ends: 1982 [2025-04-13 22:32:37,365 INFO L226 Difference]: Without dead ends: 1863 [2025-04-13 22:32:37,366 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=196, Invalid=2354, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:32:37,366 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 199 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:37,366 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 78 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:32:37,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2025-04-13 22:32:37,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1722. [2025-04-13 22:32:37,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1722 states, 1721 states have (on average 2.8797210923881464) internal successors, (4956), 1721 states have internal predecessors, (4956), 0 states have call successors, (0), 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:32:37,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 4956 transitions. [2025-04-13 22:32:37,385 INFO L79 Accepts]: Start accepts. Automaton has 1722 states and 4956 transitions. Word has length 56 [2025-04-13 22:32:37,385 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:37,385 INFO L485 AbstractCegarLoop]: Abstraction has 1722 states and 4956 transitions. [2025-04-13 22:32:37,385 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:37,385 INFO L278 IsEmpty]: Start isEmpty. Operand 1722 states and 4956 transitions. [2025-04-13 22:32:37,386 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:37,387 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:37,387 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:37,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-13 22:32:37,587 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:37,587 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:37,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:37,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2065326562, now seen corresponding path program 44 times [2025-04-13 22:32:37,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:37,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837725551] [2025-04-13 22:32:37,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:32:37,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:37,592 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:37,596 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:37,596 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:32:37,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:37,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:37,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:37,700 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837725551] [2025-04-13 22:32:37,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837725551] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:37,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:37,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:32:37,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074962452] [2025-04-13 22:32:37,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:37,701 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:32:37,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:37,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:32:37,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:32:37,701 INFO L87 Difference]: Start difference. First operand 1722 states and 4956 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:38,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:38,207 INFO L93 Difference]: Finished difference Result 1980 states and 5687 transitions. [2025-04-13 22:32:38,207 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:32:38,208 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:38,208 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:38,213 INFO L225 Difference]: With dead ends: 1980 [2025-04-13 22:32:38,213 INFO L226 Difference]: Without dead ends: 1894 [2025-04-13 22:32:38,214 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:32:38,214 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 247 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:38,214 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 91 Invalid, 1412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:32:38,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2025-04-13 22:32:38,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1792. [2025-04-13 22:32:38,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1791 states have (on average 2.8866554997208262) internal successors, (5170), 1791 states have internal predecessors, (5170), 0 states have call successors, (0), 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:32:38,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 5170 transitions. [2025-04-13 22:32:38,240 INFO L79 Accepts]: Start accepts. Automaton has 1792 states and 5170 transitions. Word has length 56 [2025-04-13 22:32:38,240 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:38,240 INFO L485 AbstractCegarLoop]: Abstraction has 1792 states and 5170 transitions. [2025-04-13 22:32:38,240 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:38,240 INFO L278 IsEmpty]: Start isEmpty. Operand 1792 states and 5170 transitions. [2025-04-13 22:32:38,242 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:38,242 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:38,243 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:38,243 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-13 22:32:38,243 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:38,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:38,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1939352578, now seen corresponding path program 45 times [2025-04-13 22:32:38,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:38,243 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338512496] [2025-04-13 22:32:38,243 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:32:38,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:38,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:38,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:38,256 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:32:38,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:38,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:38,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:38,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338512496] [2025-04-13 22:32:38,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338512496] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:38,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:38,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:32:38,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713527926] [2025-04-13 22:32:38,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:38,370 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:32:38,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:38,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:32:38,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:32:38,370 INFO L87 Difference]: Start difference. First operand 1792 states and 5170 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:38,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:38,794 INFO L93 Difference]: Finished difference Result 2010 states and 5770 transitions. [2025-04-13 22:32:38,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:32:38,794 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:38,794 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:38,800 INFO L225 Difference]: With dead ends: 2010 [2025-04-13 22:32:38,800 INFO L226 Difference]: Without dead ends: 1945 [2025-04-13 22:32:38,800 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:32:38,801 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 205 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:38,801 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 86 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:38,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2025-04-13 22:32:38,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1807. [2025-04-13 22:32:38,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1806 states have (on average 2.882059800664452) internal successors, (5205), 1806 states have internal predecessors, (5205), 0 states have call successors, (0), 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:32:38,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 5205 transitions. [2025-04-13 22:32:38,820 INFO L79 Accepts]: Start accepts. Automaton has 1807 states and 5205 transitions. Word has length 56 [2025-04-13 22:32:38,820 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:38,820 INFO L485 AbstractCegarLoop]: Abstraction has 1807 states and 5205 transitions. [2025-04-13 22:32:38,821 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:38,821 INFO L278 IsEmpty]: Start isEmpty. Operand 1807 states and 5205 transitions. [2025-04-13 22:32:38,823 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:38,823 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:38,823 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:38,823 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-04-13 22:32:38,823 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:38,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:38,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1194257950, now seen corresponding path program 46 times [2025-04-13 22:32:38,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:38,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559898009] [2025-04-13 22:32:38,823 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:32:38,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:38,827 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:38,830 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:32:38,830 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:32:38,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:38,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:38,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559898009] [2025-04-13 22:32:38,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559898009] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:38,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:38,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:32:38,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146590980] [2025-04-13 22:32:38,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:38,913 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:32:38,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:38,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:32:38,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:32:38,913 INFO L87 Difference]: Start difference. First operand 1807 states and 5205 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:39,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:39,321 INFO L93 Difference]: Finished difference Result 1973 states and 5661 transitions. [2025-04-13 22:32:39,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:32:39,321 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:39,321 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:39,326 INFO L225 Difference]: With dead ends: 1973 [2025-04-13 22:32:39,326 INFO L226 Difference]: Without dead ends: 1909 [2025-04-13 22:32:39,327 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:32:39,327 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 177 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:39,327 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 85 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:39,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2025-04-13 22:32:39,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 1797. [2025-04-13 22:32:39,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1796 states have (on average 2.884187082405345) internal successors, (5180), 1796 states have internal predecessors, (5180), 0 states have call successors, (0), 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:32:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 5180 transitions. [2025-04-13 22:32:39,345 INFO L79 Accepts]: Start accepts. Automaton has 1797 states and 5180 transitions. Word has length 56 [2025-04-13 22:32:39,346 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:39,346 INFO L485 AbstractCegarLoop]: Abstraction has 1797 states and 5180 transitions. [2025-04-13 22:32:39,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:39,346 INFO L278 IsEmpty]: Start isEmpty. Operand 1797 states and 5180 transitions. [2025-04-13 22:32:39,347 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:39,347 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:39,347 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:39,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-04-13 22:32:39,348 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:39,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:39,348 INFO L85 PathProgramCache]: Analyzing trace with hash -673777808, now seen corresponding path program 47 times [2025-04-13 22:32:39,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:39,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502566809] [2025-04-13 22:32:39,348 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:32:39,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:39,352 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:39,361 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:39,361 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:32:39,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:40,684 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:32:40,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:40,685 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502566809] [2025-04-13 22:32:40,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502566809] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:40,685 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259157589] [2025-04-13 22:32:40,685 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:32:40,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:40,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:40,686 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:32:40,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 22:32:40,734 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:40,754 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:40,754 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:32:40,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:40,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:32:40,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:40,937 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:40,937 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:32:40,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:40,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:32:40,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259157589] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:40,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:32:40,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 25 [2025-04-13 22:32:40,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261967166] [2025-04-13 22:32:40,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:40,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:40,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:40,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:40,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=593, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:32:40,960 INFO L87 Difference]: Start difference. First operand 1797 states and 5180 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:41,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:41,792 INFO L93 Difference]: Finished difference Result 2015 states and 5785 transitions. [2025-04-13 22:32:41,792 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:32:41,792 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:41,792 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:41,797 INFO L225 Difference]: With dead ends: 2015 [2025-04-13 22:32:41,797 INFO L226 Difference]: Without dead ends: 1950 [2025-04-13 22:32:41,798 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=1705, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:32:41,798 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 200 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:41,798 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 75 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:32:41,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2025-04-13 22:32:41,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1807. [2025-04-13 22:32:41,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1806 states have (on average 2.882059800664452) internal successors, (5205), 1806 states have internal predecessors, (5205), 0 states have call successors, (0), 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:32:41,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 5205 transitions. [2025-04-13 22:32:41,817 INFO L79 Accepts]: Start accepts. Automaton has 1807 states and 5205 transitions. Word has length 56 [2025-04-13 22:32:41,817 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:41,817 INFO L485 AbstractCegarLoop]: Abstraction has 1807 states and 5205 transitions. [2025-04-13 22:32:41,817 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:41,817 INFO L278 IsEmpty]: Start isEmpty. Operand 1807 states and 5205 transitions. [2025-04-13 22:32:41,819 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:41,819 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:41,819 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:41,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 22:32:42,019 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-04-13 22:32:42,020 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:42,020 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:42,020 INFO L85 PathProgramCache]: Analyzing trace with hash -290831376, now seen corresponding path program 48 times [2025-04-13 22:32:42,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:42,020 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098669654] [2025-04-13 22:32:42,020 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:32:42,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:42,024 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:42,028 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:42,029 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:32:42,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:42,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:42,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:42,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098669654] [2025-04-13 22:32:42,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098669654] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:42,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:42,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:32:42,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198647052] [2025-04-13 22:32:42,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:42,118 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:32:42,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:42,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:32:42,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:32:42,118 INFO L87 Difference]: Start difference. First operand 1807 states and 5205 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:42,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:42,530 INFO L93 Difference]: Finished difference Result 2004 states and 5748 transitions. [2025-04-13 22:32:42,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:32:42,530 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:42,530 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:42,535 INFO L225 Difference]: With dead ends: 2004 [2025-04-13 22:32:42,535 INFO L226 Difference]: Without dead ends: 1945 [2025-04-13 22:32:42,536 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:32:42,536 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 170 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:42,536 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 78 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:42,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2025-04-13 22:32:42,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1802. [2025-04-13 22:32:42,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1801 states have (on average 2.881732370905053) internal successors, (5190), 1801 states have internal predecessors, (5190), 0 states have call successors, (0), 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:32:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 5190 transitions. [2025-04-13 22:32:42,555 INFO L79 Accepts]: Start accepts. Automaton has 1802 states and 5190 transitions. Word has length 56 [2025-04-13 22:32:42,555 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:42,555 INFO L485 AbstractCegarLoop]: Abstraction has 1802 states and 5190 transitions. [2025-04-13 22:32:42,555 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:42,555 INFO L278 IsEmpty]: Start isEmpty. Operand 1802 states and 5190 transitions. [2025-04-13 22:32:42,557 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:42,557 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:42,557 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:42,557 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-04-13 22:32:42,557 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:42,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:42,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1185855090, now seen corresponding path program 49 times [2025-04-13 22:32:42,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:42,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367207352] [2025-04-13 22:32:42,557 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:32:42,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:42,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:32:42,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:42,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:42,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:43,326 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:32:43,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:43,326 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367207352] [2025-04-13 22:32:43,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367207352] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:43,326 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319078953] [2025-04-13 22:32:43,326 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:32:43,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:43,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:43,328 INFO L229 MonitoredProcess]: Starting monitored process 17 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:32:43,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 22:32:43,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:32:43,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:43,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:43,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:43,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:32:43,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:43,600 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:43,600 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:32:43,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:32:43,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:43,811 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:32:43,811 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:32:43,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:43,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319078953] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:43,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:32:43,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 34 [2025-04-13 22:32:43,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383570180] [2025-04-13 22:32:43,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:43,833 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:43,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:43,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:43,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1098, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:32:43,834 INFO L87 Difference]: Start difference. First operand 1802 states and 5190 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:44,525 INFO L93 Difference]: Finished difference Result 1978 states and 5671 transitions. [2025-04-13 22:32:44,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:32:44,525 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:44,525 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:44,530 INFO L225 Difference]: With dead ends: 1978 [2025-04-13 22:32:44,530 INFO L226 Difference]: Without dead ends: 1854 [2025-04-13 22:32:44,531 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=237, Invalid=2733, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 22:32:44,531 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 205 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:44,532 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 70 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:32:44,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2025-04-13 22:32:44,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1742. [2025-04-13 22:32:44,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1742 states, 1741 states have (on average 2.902929350947731) internal successors, (5054), 1741 states have internal predecessors, (5054), 0 states have call successors, (0), 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:32:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 5054 transitions. [2025-04-13 22:32:44,551 INFO L79 Accepts]: Start accepts. Automaton has 1742 states and 5054 transitions. Word has length 56 [2025-04-13 22:32:44,551 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:44,551 INFO L485 AbstractCegarLoop]: Abstraction has 1742 states and 5054 transitions. [2025-04-13 22:32:44,551 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:44,551 INFO L278 IsEmpty]: Start isEmpty. Operand 1742 states and 5054 transitions. [2025-04-13 22:32:44,554 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:44,554 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:44,554 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:44,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 22:32:44,754 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-04-13 22:32:44,754 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:44,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:44,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1453709298, now seen corresponding path program 50 times [2025-04-13 22:32:44,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:44,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465136446] [2025-04-13 22:32:44,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:32:44,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:44,759 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:44,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:44,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:32:44,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:44,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:44,859 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465136446] [2025-04-13 22:32:44,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465136446] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:44,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:44,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:32:44,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306383671] [2025-04-13 22:32:44,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:44,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:44,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:44,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:44,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:32:44,860 INFO L87 Difference]: Start difference. First operand 1742 states and 5054 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:45,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:45,310 INFO L93 Difference]: Finished difference Result 1999 states and 5794 transitions. [2025-04-13 22:32:45,310 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:32:45,310 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:45,311 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:45,316 INFO L225 Difference]: With dead ends: 1999 [2025-04-13 22:32:45,316 INFO L226 Difference]: Without dead ends: 1934 [2025-04-13 22:32:45,316 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:32:45,317 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 189 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:45,317 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 89 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:45,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2025-04-13 22:32:45,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1812. [2025-04-13 22:32:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1811 states have (on average 2.9088901159580343) internal successors, (5268), 1811 states have internal predecessors, (5268), 0 states have call successors, (0), 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:32:45,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 5268 transitions. [2025-04-13 22:32:45,336 INFO L79 Accepts]: Start accepts. Automaton has 1812 states and 5268 transitions. Word has length 56 [2025-04-13 22:32:45,336 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:45,336 INFO L485 AbstractCegarLoop]: Abstraction has 1812 states and 5268 transitions. [2025-04-13 22:32:45,336 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:45,337 INFO L278 IsEmpty]: Start isEmpty. Operand 1812 states and 5268 transitions. [2025-04-13 22:32:45,339 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:45,339 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:45,339 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:45,339 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-04-13 22:32:45,339 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:45,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:45,339 INFO L85 PathProgramCache]: Analyzing trace with hash -726350932, now seen corresponding path program 51 times [2025-04-13 22:32:45,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:45,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968269374] [2025-04-13 22:32:45,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:32:45,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:45,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:45,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:45,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:32:45,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:45,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:45,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:45,467 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968269374] [2025-04-13 22:32:45,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968269374] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:45,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:45,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:32:45,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504320322] [2025-04-13 22:32:45,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:45,468 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:45,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:45,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:45,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:32:45,468 INFO L87 Difference]: Start difference. First operand 1812 states and 5268 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:45,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:45,942 INFO L93 Difference]: Finished difference Result 2097 states and 6037 transitions. [2025-04-13 22:32:45,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:32:45,943 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:45,943 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:45,948 INFO L225 Difference]: With dead ends: 2097 [2025-04-13 22:32:45,948 INFO L226 Difference]: Without dead ends: 1933 [2025-04-13 22:32:45,949 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=855, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:32:45,949 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 259 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:45,949 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 93 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:45,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2025-04-13 22:32:45,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1812. [2025-04-13 22:32:45,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1811 states have (on average 2.8812810601877414) internal successors, (5218), 1811 states have internal predecessors, (5218), 0 states have call successors, (0), 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:32:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 5218 transitions. [2025-04-13 22:32:45,968 INFO L79 Accepts]: Start accepts. Automaton has 1812 states and 5218 transitions. Word has length 56 [2025-04-13 22:32:45,969 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:45,969 INFO L485 AbstractCegarLoop]: Abstraction has 1812 states and 5218 transitions. [2025-04-13 22:32:45,969 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:45,969 INFO L278 IsEmpty]: Start isEmpty. Operand 1812 states and 5218 transitions. [2025-04-13 22:32:45,970 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:45,970 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:45,970 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:45,971 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-04-13 22:32:45,971 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:45,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:45,971 INFO L85 PathProgramCache]: Analyzing trace with hash -813033682, now seen corresponding path program 52 times [2025-04-13 22:32:45,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:45,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281117765] [2025-04-13 22:32:45,971 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:32:45,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:45,975 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:45,978 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:32:45,978 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:32:45,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:46,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:46,048 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281117765] [2025-04-13 22:32:46,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281117765] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:46,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:46,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:32:46,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087323519] [2025-04-13 22:32:46,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:46,049 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:46,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:46,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:46,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:32:46,049 INFO L87 Difference]: Start difference. First operand 1812 states and 5218 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:46,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:46,494 INFO L93 Difference]: Finished difference Result 1988 states and 5707 transitions. [2025-04-13 22:32:46,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:32:46,494 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:46,494 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:46,499 INFO L225 Difference]: With dead ends: 1988 [2025-04-13 22:32:46,500 INFO L226 Difference]: Without dead ends: 1929 [2025-04-13 22:32:46,500 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:32:46,500 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 199 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:46,500 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 87 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:46,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2025-04-13 22:32:46,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1807. [2025-04-13 22:32:46,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1806 states have (on average 2.880952380952381) internal successors, (5203), 1806 states have internal predecessors, (5203), 0 states have call successors, (0), 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:32:46,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 5203 transitions. [2025-04-13 22:32:46,518 INFO L79 Accepts]: Start accepts. Automaton has 1807 states and 5203 transitions. Word has length 56 [2025-04-13 22:32:46,518 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:46,518 INFO L485 AbstractCegarLoop]: Abstraction has 1807 states and 5203 transitions. [2025-04-13 22:32:46,519 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:46,519 INFO L278 IsEmpty]: Start isEmpty. Operand 1807 states and 5203 transitions. [2025-04-13 22:32:46,520 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:46,520 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:46,520 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:46,520 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-04-13 22:32:46,520 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:46,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:46,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1270513422, now seen corresponding path program 53 times [2025-04-13 22:32:46,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:46,521 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674830096] [2025-04-13 22:32:46,521 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:32:46,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:46,525 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:46,533 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:46,534 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:32:46,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:47,452 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:32:47,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:47,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674830096] [2025-04-13 22:32:47,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674830096] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:47,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333907524] [2025-04-13 22:32:47,452 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:32:47,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:47,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:47,454 INFO L229 MonitoredProcess]: Starting monitored process 18 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:32:47,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 22:32:47,504 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:47,525 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:47,525 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:32:47,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:47,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-13 22:32:47,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:47,563 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 22:32:47,957 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:47,958 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 28 [2025-04-13 22:32:47,964 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:32:47,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:48,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333907524] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:48,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:32:48,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16, 16] total 39 [2025-04-13 22:32:48,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710746401] [2025-04-13 22:32:48,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:48,381 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 22:32:48,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:48,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 22:32:48,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1441, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:32:48,382 INFO L87 Difference]: Start difference. First operand 1807 states and 5203 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:49,405 INFO L93 Difference]: Finished difference Result 1993 states and 5717 transitions. [2025-04-13 22:32:49,406 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:32:49,406 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:49,406 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:49,411 INFO L225 Difference]: With dead ends: 1993 [2025-04-13 22:32:49,411 INFO L226 Difference]: Without dead ends: 1874 [2025-04-13 22:32:49,412 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=266, Invalid=3274, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 22:32:49,412 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 225 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:49,412 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 103 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:32:49,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2025-04-13 22:32:49,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1752. [2025-04-13 22:32:49,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1751 states have (on average 2.899486007995431) internal successors, (5077), 1751 states have internal predecessors, (5077), 0 states have call successors, (0), 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:32:49,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 5077 transitions. [2025-04-13 22:32:49,431 INFO L79 Accepts]: Start accepts. Automaton has 1752 states and 5077 transitions. Word has length 56 [2025-04-13 22:32:49,431 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:49,431 INFO L485 AbstractCegarLoop]: Abstraction has 1752 states and 5077 transitions. [2025-04-13 22:32:49,431 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:49,431 INFO L278 IsEmpty]: Start isEmpty. Operand 1752 states and 5077 transitions. [2025-04-13 22:32:49,432 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:49,432 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:49,433 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:49,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-13 22:32:49,633 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:49,634 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:49,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:49,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1182648542, now seen corresponding path program 54 times [2025-04-13 22:32:49,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:49,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306733522] [2025-04-13 22:32:49,634 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:32:49,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:49,638 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:49,642 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:49,642 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:32:49,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:49,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:49,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306733522] [2025-04-13 22:32:49,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306733522] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:49,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:49,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:32:49,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037659957] [2025-04-13 22:32:49,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:49,741 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:49,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:49,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:49,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:32:49,741 INFO L87 Difference]: Start difference. First operand 1752 states and 5077 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:50,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:50,163 INFO L93 Difference]: Finished difference Result 1977 states and 5656 transitions. [2025-04-13 22:32:50,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:32:50,163 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:50,163 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:50,168 INFO L225 Difference]: With dead ends: 1977 [2025-04-13 22:32:50,168 INFO L226 Difference]: Without dead ends: 1773 [2025-04-13 22:32:50,169 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:32:50,169 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 194 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:50,169 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 94 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:50,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2025-04-13 22:32:50,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1732. [2025-04-13 22:32:50,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1731 states have (on average 2.900635470826112) internal successors, (5021), 1731 states have internal predecessors, (5021), 0 states have call successors, (0), 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:32:50,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 5021 transitions. [2025-04-13 22:32:50,187 INFO L79 Accepts]: Start accepts. Automaton has 1732 states and 5021 transitions. Word has length 56 [2025-04-13 22:32:50,187 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:50,187 INFO L485 AbstractCegarLoop]: Abstraction has 1732 states and 5021 transitions. [2025-04-13 22:32:50,187 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:50,187 INFO L278 IsEmpty]: Start isEmpty. Operand 1732 states and 5021 transitions. [2025-04-13 22:32:50,189 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:50,189 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:50,189 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:50,189 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-04-13 22:32:50,189 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:50,189 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:50,189 INFO L85 PathProgramCache]: Analyzing trace with hash -875293938, now seen corresponding path program 55 times [2025-04-13 22:32:50,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:50,189 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521208299] [2025-04-13 22:32:50,189 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:32:50,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:50,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:32:50,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:50,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:50,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:51,206 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:32:51,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:51,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521208299] [2025-04-13 22:32:51,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521208299] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:51,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033815370] [2025-04-13 22:32:51,206 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:32:51,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:51,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:51,208 INFO L229 MonitoredProcess]: Starting monitored process 19 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:32:51,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 22:32:51,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:32:51,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:51,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:51,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:51,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:32:51,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:51,488 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:51,488 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:32:51,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:32:51,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:51,691 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:32:51,691 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:32:51,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:51,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033815370] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:51,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:32:51,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 34 [2025-04-13 22:32:51,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268273040] [2025-04-13 22:32:51,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:51,714 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:51,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:51,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:51,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1093, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:32:51,714 INFO L87 Difference]: Start difference. First operand 1732 states and 5021 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:52,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:52,364 INFO L93 Difference]: Finished difference Result 2087 states and 5997 transitions. [2025-04-13 22:32:52,364 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:32:52,364 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:52,364 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:52,370 INFO L225 Difference]: With dead ends: 2087 [2025-04-13 22:32:52,370 INFO L226 Difference]: Without dead ends: 1923 [2025-04-13 22:32:52,370 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=203, Invalid=2347, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:32:52,371 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 263 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:52,371 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 78 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:32:52,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2025-04-13 22:32:52,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1862. [2025-04-13 22:32:52,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1861 states have (on average 2.8871574422353574) internal successors, (5373), 1861 states have internal predecessors, (5373), 0 states have call successors, (0), 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:32:52,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 5373 transitions. [2025-04-13 22:32:52,390 INFO L79 Accepts]: Start accepts. Automaton has 1862 states and 5373 transitions. Word has length 56 [2025-04-13 22:32:52,390 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:52,390 INFO L485 AbstractCegarLoop]: Abstraction has 1862 states and 5373 transitions. [2025-04-13 22:32:52,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:52,390 INFO L278 IsEmpty]: Start isEmpty. Operand 1862 states and 5373 transitions. [2025-04-13 22:32:52,392 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:52,392 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:52,392 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:52,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 22:32:52,592 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:52,593 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:52,593 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:52,593 INFO L85 PathProgramCache]: Analyzing trace with hash 479073360, now seen corresponding path program 56 times [2025-04-13 22:32:52,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:52,593 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056554843] [2025-04-13 22:32:52,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:32:52,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:52,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:52,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:52,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:32:52,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:52,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:52,693 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056554843] [2025-04-13 22:32:52,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056554843] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:52,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:52,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:32:52,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786332639] [2025-04-13 22:32:52,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:52,693 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:32:52,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:52,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:32:52,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:32:52,694 INFO L87 Difference]: Start difference. First operand 1862 states and 5373 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:53,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:53,153 INFO L93 Difference]: Finished difference Result 2019 states and 5789 transitions. [2025-04-13 22:32:53,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:32:53,154 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:53,154 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:53,161 INFO L225 Difference]: With dead ends: 2019 [2025-04-13 22:32:53,161 INFO L226 Difference]: Without dead ends: 1954 [2025-04-13 22:32:53,161 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:32:53,162 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 205 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:53,162 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 81 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2025-04-13 22:32:53,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1872. [2025-04-13 22:32:53,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1871 states have (on average 2.8850881881346875) internal successors, (5398), 1871 states have internal predecessors, (5398), 0 states have call successors, (0), 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:32:53,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 5398 transitions. [2025-04-13 22:32:53,189 INFO L79 Accepts]: Start accepts. Automaton has 1872 states and 5398 transitions. Word has length 56 [2025-04-13 22:32:53,189 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:53,189 INFO L485 AbstractCegarLoop]: Abstraction has 1872 states and 5398 transitions. [2025-04-13 22:32:53,189 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:53,189 INFO L278 IsEmpty]: Start isEmpty. Operand 1872 states and 5398 transitions. [2025-04-13 22:32:53,191 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:53,191 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:53,191 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:53,191 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-04-13 22:32:53,192 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:53,192 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:53,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1118944640, now seen corresponding path program 57 times [2025-04-13 22:32:53,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:53,192 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389529298] [2025-04-13 22:32:53,192 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:32:53,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:53,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:53,204 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:53,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:32:53,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:53,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:53,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:53,337 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389529298] [2025-04-13 22:32:53,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389529298] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:53,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:53,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:32:53,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840332546] [2025-04-13 22:32:53,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:53,338 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:32:53,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:53,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:32:53,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:32:53,338 INFO L87 Difference]: Start difference. First operand 1872 states and 5398 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:53,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:53,760 INFO L93 Difference]: Finished difference Result 2008 states and 5752 transitions. [2025-04-13 22:32:53,760 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:32:53,760 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:53,761 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:53,766 INFO L225 Difference]: With dead ends: 2008 [2025-04-13 22:32:53,766 INFO L226 Difference]: Without dead ends: 1949 [2025-04-13 22:32:53,767 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:32:53,767 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 222 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:53,767 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 78 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:53,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2025-04-13 22:32:53,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1867. [2025-04-13 22:32:53,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1867 states, 1866 states have (on average 2.884780278670954) internal successors, (5383), 1866 states have internal predecessors, (5383), 0 states have call successors, (0), 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:32:53,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 5383 transitions. [2025-04-13 22:32:53,786 INFO L79 Accepts]: Start accepts. Automaton has 1867 states and 5383 transitions. Word has length 56 [2025-04-13 22:32:53,786 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:53,786 INFO L485 AbstractCegarLoop]: Abstraction has 1867 states and 5383 transitions. [2025-04-13 22:32:53,786 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:53,786 INFO L278 IsEmpty]: Start isEmpty. Operand 1867 states and 5383 transitions. [2025-04-13 22:32:53,788 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:53,788 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:53,788 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:53,788 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-04-13 22:32:53,788 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:53,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:53,788 INFO L85 PathProgramCache]: Analyzing trace with hash -872588132, now seen corresponding path program 58 times [2025-04-13 22:32:53,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:53,788 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451702542] [2025-04-13 22:32:53,788 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:32:53,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:53,793 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:53,795 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:32:53,795 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:32:53,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:53,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:53,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:53,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451702542] [2025-04-13 22:32:53,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451702542] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:53,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:53,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:32:53,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402806908] [2025-04-13 22:32:53,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:53,860 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:32:53,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:53,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:32:53,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:32:53,861 INFO L87 Difference]: Start difference. First operand 1867 states and 5383 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:54,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:54,260 INFO L93 Difference]: Finished difference Result 1982 states and 5675 transitions. [2025-04-13 22:32:54,260 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:32:54,260 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:54,260 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:54,266 INFO L225 Difference]: With dead ends: 1982 [2025-04-13 22:32:54,266 INFO L226 Difference]: Without dead ends: 1863 [2025-04-13 22:32:54,266 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:32:54,267 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 207 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:54,267 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 78 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:54,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2025-04-13 22:32:54,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1812. [2025-04-13 22:32:54,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1811 states have (on average 2.8586416344561014) internal successors, (5177), 1811 states have internal predecessors, (5177), 0 states have call successors, (0), 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:32:54,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 5177 transitions. [2025-04-13 22:32:54,285 INFO L79 Accepts]: Start accepts. Automaton has 1812 states and 5177 transitions. Word has length 56 [2025-04-13 22:32:54,285 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:54,285 INFO L485 AbstractCegarLoop]: Abstraction has 1812 states and 5177 transitions. [2025-04-13 22:32:54,285 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:54,285 INFO L278 IsEmpty]: Start isEmpty. Operand 1812 states and 5177 transitions. [2025-04-13 22:32:54,286 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:54,286 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:54,286 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:54,287 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-04-13 22:32:54,287 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:54,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:54,287 INFO L85 PathProgramCache]: Analyzing trace with hash 606484962, now seen corresponding path program 59 times [2025-04-13 22:32:54,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:54,287 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99539524] [2025-04-13 22:32:54,287 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:32:54,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:54,291 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:54,298 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:54,298 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:32:54,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:55,127 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:32:55,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:55,128 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99539524] [2025-04-13 22:32:55,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99539524] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:55,128 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544960925] [2025-04-13 22:32:55,128 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:32:55,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:55,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:55,129 INFO L229 MonitoredProcess]: Starting monitored process 20 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:32:55,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-13 22:32:55,180 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:55,199 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:55,199 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:32:55,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:55,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:32:55,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:55,358 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:55,358 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:32:55,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:55,378 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:32:55,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544960925] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:55,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:32:55,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 25 [2025-04-13 22:32:55,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119635703] [2025-04-13 22:32:55,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:55,379 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:55,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:55,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:55,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:32:55,379 INFO L87 Difference]: Start difference. First operand 1812 states and 5177 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:56,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:56,252 INFO L93 Difference]: Finished difference Result 2054 states and 5807 transitions. [2025-04-13 22:32:56,253 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:32:56,253 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:56,253 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:56,258 INFO L225 Difference]: With dead ends: 2054 [2025-04-13 22:32:56,258 INFO L226 Difference]: Without dead ends: 1956 [2025-04-13 22:32:56,259 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=1952, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 22:32:56,259 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 242 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:56,259 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 68 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1347 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:32:56,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2025-04-13 22:32:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1827. [2025-04-13 22:32:56,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1827 states, 1826 states have (on average 2.857064622124863) internal successors, (5217), 1826 states have internal predecessors, (5217), 0 states have call successors, (0), 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:32:56,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 5217 transitions. [2025-04-13 22:32:56,279 INFO L79 Accepts]: Start accepts. Automaton has 1827 states and 5217 transitions. Word has length 56 [2025-04-13 22:32:56,280 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:56,280 INFO L485 AbstractCegarLoop]: Abstraction has 1827 states and 5217 transitions. [2025-04-13 22:32:56,280 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:56,280 INFO L278 IsEmpty]: Start isEmpty. Operand 1827 states and 5217 transitions. [2025-04-13 22:32:56,281 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:56,281 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:56,281 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:56,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-13 22:32:56,482 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:56,482 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:56,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:56,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1481137090, now seen corresponding path program 60 times [2025-04-13 22:32:56,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:56,483 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102072860] [2025-04-13 22:32:56,483 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:32:56,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:56,487 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:56,491 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:56,491 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:32:56,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:56,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:56,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102072860] [2025-04-13 22:32:56,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102072860] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:56,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:56,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:32:56,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559378157] [2025-04-13 22:32:56,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:56,579 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:32:56,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:56,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:32:56,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:32:56,580 INFO L87 Difference]: Start difference. First operand 1827 states and 5217 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:57,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:57,012 INFO L93 Difference]: Finished difference Result 1989 states and 5638 transitions. [2025-04-13 22:32:57,013 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:32:57,013 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:57,013 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:57,019 INFO L225 Difference]: With dead ends: 1989 [2025-04-13 22:32:57,019 INFO L226 Difference]: Without dead ends: 1925 [2025-04-13 22:32:57,019 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:32:57,019 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 227 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:57,020 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 84 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:57,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-04-13 22:32:57,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1817. [2025-04-13 22:32:57,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1816 states have (on average 2.8562775330396475) internal successors, (5187), 1816 states have internal predecessors, (5187), 0 states have call successors, (0), 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:32:57,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 5187 transitions. [2025-04-13 22:32:57,041 INFO L79 Accepts]: Start accepts. Automaton has 1817 states and 5187 transitions. Word has length 56 [2025-04-13 22:32:57,041 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:57,041 INFO L485 AbstractCegarLoop]: Abstraction has 1817 states and 5187 transitions. [2025-04-13 22:32:57,041 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:57,041 INFO L278 IsEmpty]: Start isEmpty. Operand 1817 states and 5187 transitions. [2025-04-13 22:32:57,043 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:57,043 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:57,043 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:57,043 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-04-13 22:32:57,043 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:57,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:57,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2006645424, now seen corresponding path program 61 times [2025-04-13 22:32:57,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:57,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250901859] [2025-04-13 22:32:57,043 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:32:57,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:57,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:32:57,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:57,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:57,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:57,816 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:32:57,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:57,817 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250901859] [2025-04-13 22:32:57,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250901859] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:57,817 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350422795] [2025-04-13 22:32:57,817 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:32:57,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:57,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:32:57,819 INFO L229 MonitoredProcess]: Starting monitored process 21 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:32:57,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-13 22:32:57,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:32:57,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:32:57,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:32:57,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:57,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:32:57,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:32:58,062 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:32:58,063 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:32:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:32:58,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:32:58,241 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:32:58,241 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:32:58,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:58,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350422795] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:32:58,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:32:58,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 32 [2025-04-13 22:32:58,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927836829] [2025-04-13 22:32:58,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:58,276 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:32:58,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:58,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:32:58,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:32:58,277 INFO L87 Difference]: Start difference. First operand 1817 states and 5187 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:59,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:59,011 INFO L93 Difference]: Finished difference Result 2027 states and 5744 transitions. [2025-04-13 22:32:59,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:32:59,012 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:59,012 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:59,017 INFO L225 Difference]: With dead ends: 2027 [2025-04-13 22:32:59,017 INFO L226 Difference]: Without dead ends: 1962 [2025-04-13 22:32:59,018 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=242, Invalid=2728, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 22:32:59,018 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 267 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:59,018 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 73 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:32:59,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-04-13 22:32:59,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1827. [2025-04-13 22:32:59,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1827 states, 1826 states have (on average 2.8543263964950714) internal successors, (5212), 1826 states have internal predecessors, (5212), 0 states have call successors, (0), 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:32:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 5212 transitions. [2025-04-13 22:32:59,037 INFO L79 Accepts]: Start accepts. Automaton has 1827 states and 5212 transitions. Word has length 56 [2025-04-13 22:32:59,037 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:59,037 INFO L485 AbstractCegarLoop]: Abstraction has 1827 states and 5212 transitions. [2025-04-13 22:32:59,037 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:59,037 INFO L278 IsEmpty]: Start isEmpty. Operand 1827 states and 5212 transitions. [2025-04-13 22:32:59,039 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:59,039 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:59,039 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:59,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-13 22:32:59,239 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2025-04-13 22:32:59,239 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:59,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:59,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1328740880, now seen corresponding path program 62 times [2025-04-13 22:32:59,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:59,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913473728] [2025-04-13 22:32:59,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:32:59,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:59,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:59,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:59,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:32:59,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:59,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:59,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:59,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913473728] [2025-04-13 22:32:59,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913473728] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:59,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:59,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:32:59,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966244808] [2025-04-13 22:32:59,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:59,348 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:32:59,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:59,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:32:59,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:32:59,348 INFO L87 Difference]: Start difference. First operand 1827 states and 5212 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:59,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:32:59,776 INFO L93 Difference]: Finished difference Result 2000 states and 5665 transitions. [2025-04-13 22:32:59,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:32:59,777 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:32:59,777 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:32:59,782 INFO L225 Difference]: With dead ends: 2000 [2025-04-13 22:32:59,782 INFO L226 Difference]: Without dead ends: 1941 [2025-04-13 22:32:59,783 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:32:59,783 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 215 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:32:59,783 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 77 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:32:59,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2025-04-13 22:32:59,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1822. [2025-04-13 22:32:59,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1821 states have (on average 2.85392641405821) internal successors, (5197), 1821 states have internal predecessors, (5197), 0 states have call successors, (0), 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:32:59,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 5197 transitions. [2025-04-13 22:32:59,801 INFO L79 Accepts]: Start accepts. Automaton has 1822 states and 5197 transitions. Word has length 56 [2025-04-13 22:32:59,802 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:32:59,802 INFO L485 AbstractCegarLoop]: Abstraction has 1822 states and 5197 transitions. [2025-04-13 22:32:59,802 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:59,802 INFO L278 IsEmpty]: Start isEmpty. Operand 1822 states and 5197 transitions. [2025-04-13 22:32:59,803 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:32:59,803 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:32:59,803 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:32:59,804 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-04-13 22:32:59,804 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:32:59,804 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:32:59,804 INFO L85 PathProgramCache]: Analyzing trace with hash -147012526, now seen corresponding path program 63 times [2025-04-13 22:32:59,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:32:59,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147017242] [2025-04-13 22:32:59,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:32:59,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:32:59,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:32:59,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:32:59,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:32:59,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:32:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:32:59,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:32:59,901 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147017242] [2025-04-13 22:32:59,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147017242] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:32:59,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:32:59,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:32:59,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068144502] [2025-04-13 22:32:59,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:32:59,901 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:32:59,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:32:59,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:32:59,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:32:59,902 INFO L87 Difference]: Start difference. First operand 1822 states and 5197 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:00,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:00,342 INFO L93 Difference]: Finished difference Result 2013 states and 5668 transitions. [2025-04-13 22:33:00,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:33:00,342 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:00,343 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:00,348 INFO L225 Difference]: With dead ends: 2013 [2025-04-13 22:33:00,348 INFO L226 Difference]: Without dead ends: 1889 [2025-04-13 22:33:00,349 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:33:00,349 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 235 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:00,349 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 76 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:00,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2025-04-13 22:33:00,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1762. [2025-04-13 22:33:00,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1762 states, 1761 states have (on average 2.8710959681998864) internal successors, (5056), 1761 states have internal predecessors, (5056), 0 states have call successors, (0), 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:33:00,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 5056 transitions. [2025-04-13 22:33:00,367 INFO L79 Accepts]: Start accepts. Automaton has 1762 states and 5056 transitions. Word has length 56 [2025-04-13 22:33:00,367 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:00,367 INFO L485 AbstractCegarLoop]: Abstraction has 1762 states and 5056 transitions. [2025-04-13 22:33:00,368 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:00,368 INFO L278 IsEmpty]: Start isEmpty. Operand 1762 states and 5056 transitions. [2025-04-13 22:33:00,369 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:00,369 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:00,369 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:00,369 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-04-13 22:33:00,369 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:00,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:00,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1560205760, now seen corresponding path program 64 times [2025-04-13 22:33:00,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:00,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547488425] [2025-04-13 22:33:00,370 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:33:00,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:00,374 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:00,376 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:33:00,377 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:33:00,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:00,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:00,449 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547488425] [2025-04-13 22:33:00,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547488425] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:00,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:00,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:33:00,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976044805] [2025-04-13 22:33:00,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:00,449 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:33:00,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:00,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:33:00,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:33:00,449 INFO L87 Difference]: Start difference. First operand 1762 states and 5056 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:01,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:01,018 INFO L93 Difference]: Finished difference Result 2134 states and 6109 transitions. [2025-04-13 22:33:01,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:33:01,018 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:01,018 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:01,024 INFO L225 Difference]: With dead ends: 2134 [2025-04-13 22:33:01,024 INFO L226 Difference]: Without dead ends: 1944 [2025-04-13 22:33:01,025 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=182, Invalid=1078, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:33:01,025 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 336 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:01,025 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 101 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1672 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:33:01,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2025-04-13 22:33:01,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1808. [2025-04-13 22:33:01,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1807 states have (on average 2.88267847260653) internal successors, (5209), 1807 states have internal predecessors, (5209), 0 states have call successors, (0), 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:33:01,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 5209 transitions. [2025-04-13 22:33:01,044 INFO L79 Accepts]: Start accepts. Automaton has 1808 states and 5209 transitions. Word has length 56 [2025-04-13 22:33:01,044 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:01,044 INFO L485 AbstractCegarLoop]: Abstraction has 1808 states and 5209 transitions. [2025-04-13 22:33:01,044 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:01,044 INFO L278 IsEmpty]: Start isEmpty. Operand 1808 states and 5209 transitions. [2025-04-13 22:33:01,046 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:01,046 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:01,046 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:01,046 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-04-13 22:33:01,046 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:01,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:01,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1562184110, now seen corresponding path program 65 times [2025-04-13 22:33:01,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:01,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250053344] [2025-04-13 22:33:01,047 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:33:01,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:01,051 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:01,058 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:01,058 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:01,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:01,787 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:33:01,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:01,787 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250053344] [2025-04-13 22:33:01,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250053344] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:01,787 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872564186] [2025-04-13 22:33:01,787 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:33:01,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:01,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:01,789 INFO L229 MonitoredProcess]: Starting monitored process 22 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:33:01,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-13 22:33:01,841 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:01,860 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:01,860 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:01,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:01,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:33:01,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:02,066 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:33:02,066 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:33:02,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:02,069 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:33:02,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872564186] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:02,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:33:02,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 24 [2025-04-13 22:33:02,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725888761] [2025-04-13 22:33:02,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:02,069 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:02,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:02,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:02,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:33:02,070 INFO L87 Difference]: Start difference. First operand 1808 states and 5209 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:02,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:02,968 INFO L93 Difference]: Finished difference Result 1956 states and 5592 transitions. [2025-04-13 22:33:02,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:33:02,969 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:02,969 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:02,974 INFO L225 Difference]: With dead ends: 1956 [2025-04-13 22:33:02,974 INFO L226 Difference]: Without dead ends: 1849 [2025-04-13 22:33:02,975 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=1493, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:33:02,975 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 214 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:02,975 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 60 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:33:02,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2025-04-13 22:33:02,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1828. [2025-04-13 22:33:02,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1828 states, 1827 states have (on average 2.8784893267651888) internal successors, (5259), 1827 states have internal predecessors, (5259), 0 states have call successors, (0), 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:33:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 5259 transitions. [2025-04-13 22:33:02,994 INFO L79 Accepts]: Start accepts. Automaton has 1828 states and 5259 transitions. Word has length 56 [2025-04-13 22:33:02,994 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:02,994 INFO L485 AbstractCegarLoop]: Abstraction has 1828 states and 5259 transitions. [2025-04-13 22:33:02,994 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:02,994 INFO L278 IsEmpty]: Start isEmpty. Operand 1828 states and 5259 transitions. [2025-04-13 22:33:02,995 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:02,995 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:02,996 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:03,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 22:33:03,196 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2025-04-13 22:33:03,196 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:03,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:03,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1359266482, now seen corresponding path program 66 times [2025-04-13 22:33:03,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:03,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364356256] [2025-04-13 22:33:03,197 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:33:03,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:03,201 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:03,205 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:03,205 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:33:03,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:03,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:03,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364356256] [2025-04-13 22:33:03,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364356256] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:03,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:03,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:33:03,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889537424] [2025-04-13 22:33:03,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:03,302 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:03,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:03,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:03,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:33:03,303 INFO L87 Difference]: Start difference. First operand 1828 states and 5259 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:03,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:03,697 INFO L93 Difference]: Finished difference Result 1945 states and 5555 transitions. [2025-04-13 22:33:03,697 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:33:03,697 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:03,697 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:03,702 INFO L225 Difference]: With dead ends: 1945 [2025-04-13 22:33:03,703 INFO L226 Difference]: Without dead ends: 1880 [2025-04-13 22:33:03,703 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:33:03,703 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 160 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:03,703 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 63 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:03,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2025-04-13 22:33:03,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1833. [2025-04-13 22:33:03,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1833 states, 1832 states have (on average 2.8760917030567685) internal successors, (5269), 1832 states have internal predecessors, (5269), 0 states have call successors, (0), 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:33:03,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 5269 transitions. [2025-04-13 22:33:03,723 INFO L79 Accepts]: Start accepts. Automaton has 1833 states and 5269 transitions. Word has length 56 [2025-04-13 22:33:03,723 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:03,723 INFO L485 AbstractCegarLoop]: Abstraction has 1833 states and 5269 transitions. [2025-04-13 22:33:03,723 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:03,723 INFO L278 IsEmpty]: Start isEmpty. Operand 1833 states and 5269 transitions. [2025-04-13 22:33:03,725 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:03,725 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:03,725 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:03,725 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-04-13 22:33:03,725 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:03,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:03,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1712050274, now seen corresponding path program 67 times [2025-04-13 22:33:03,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:03,725 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43451445] [2025-04-13 22:33:03,725 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:33:03,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:03,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:33:03,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:03,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:03,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:04,483 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:33:04,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:04,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43451445] [2025-04-13 22:33:04,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43451445] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:04,484 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297224460] [2025-04-13 22:33:04,484 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:33:04,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:04,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:04,485 INFO L229 MonitoredProcess]: Starting monitored process 23 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:33:04,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 22:33:04,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:33:04,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:04,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:04,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:04,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:33:04,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:04,732 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:33:04,732 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:33:04,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:33:04,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:04,932 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:33:04,932 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:33:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:04,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297224460] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:04,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:33:04,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 33 [2025-04-13 22:33:04,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132928280] [2025-04-13 22:33:04,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:04,955 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:04,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:04,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:04,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:33:04,955 INFO L87 Difference]: Start difference. First operand 1833 states and 5269 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:05,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:05,525 INFO L93 Difference]: Finished difference Result 1908 states and 5436 transitions. [2025-04-13 22:33:05,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:33:05,525 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:05,525 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:05,531 INFO L225 Difference]: With dead ends: 1908 [2025-04-13 22:33:05,531 INFO L226 Difference]: Without dead ends: 1839 [2025-04-13 22:33:05,531 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=2166, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:33:05,532 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 146 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:05,532 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 59 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:05,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2025-04-13 22:33:05,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1828. [2025-04-13 22:33:05,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1828 states, 1827 states have (on average 2.875752599890531) internal successors, (5254), 1827 states have internal predecessors, (5254), 0 states have call successors, (0), 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:33:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 5254 transitions. [2025-04-13 22:33:05,551 INFO L79 Accepts]: Start accepts. Automaton has 1828 states and 5254 transitions. Word has length 56 [2025-04-13 22:33:05,551 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:05,551 INFO L485 AbstractCegarLoop]: Abstraction has 1828 states and 5254 transitions. [2025-04-13 22:33:05,551 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:05,551 INFO L278 IsEmpty]: Start isEmpty. Operand 1828 states and 5254 transitions. [2025-04-13 22:33:05,553 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:05,553 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:05,553 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:05,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-13 22:33:05,753 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:05,753 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:05,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:05,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1713715782, now seen corresponding path program 68 times [2025-04-13 22:33:05,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:05,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659941260] [2025-04-13 22:33:05,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:33:05,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:05,759 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:05,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:05,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:33:05,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:05,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:05,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:05,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659941260] [2025-04-13 22:33:05,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659941260] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:05,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:05,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:33:05,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848558674] [2025-04-13 22:33:05,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:05,857 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:05,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:05,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:05,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:33:05,858 INFO L87 Difference]: Start difference. First operand 1828 states and 5254 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:06,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:06,293 INFO L93 Difference]: Finished difference Result 1924 states and 5488 transitions. [2025-04-13 22:33:06,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:33:06,293 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:06,293 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:06,299 INFO L225 Difference]: With dead ends: 1924 [2025-04-13 22:33:06,299 INFO L226 Difference]: Without dead ends: 1860 [2025-04-13 22:33:06,299 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:33:06,300 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 198 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:06,300 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 85 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:06,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2025-04-13 22:33:06,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1818. [2025-04-13 22:33:06,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1817 states have (on average 2.8778205833791963) internal successors, (5229), 1817 states have internal predecessors, (5229), 0 states have call successors, (0), 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:33:06,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 5229 transitions. [2025-04-13 22:33:06,319 INFO L79 Accepts]: Start accepts. Automaton has 1818 states and 5229 transitions. Word has length 56 [2025-04-13 22:33:06,319 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:06,319 INFO L485 AbstractCegarLoop]: Abstraction has 1818 states and 5229 transitions. [2025-04-13 22:33:06,319 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:06,319 INFO L278 IsEmpty]: Start isEmpty. Operand 1818 states and 5229 transitions. [2025-04-13 22:33:06,321 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:06,321 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:06,321 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:06,321 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-04-13 22:33:06,321 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:06,321 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:06,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1079049390, now seen corresponding path program 69 times [2025-04-13 22:33:06,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:06,321 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310326416] [2025-04-13 22:33:06,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:33:06,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:06,326 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:06,333 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:06,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:33:06,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:06,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:06,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310326416] [2025-04-13 22:33:06,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310326416] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:06,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:06,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:33:06,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850752212] [2025-04-13 22:33:06,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:06,437 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:06,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:06,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:06,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:33:06,437 INFO L87 Difference]: Start difference. First operand 1818 states and 5229 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:06,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:06,878 INFO L93 Difference]: Finished difference Result 1935 states and 5525 transitions. [2025-04-13 22:33:06,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:33:06,879 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:06,879 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:06,884 INFO L225 Difference]: With dead ends: 1935 [2025-04-13 22:33:06,884 INFO L226 Difference]: Without dead ends: 1870 [2025-04-13 22:33:06,885 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:33:06,885 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 216 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:06,885 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 78 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:06,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2025-04-13 22:33:06,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1828. [2025-04-13 22:33:06,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1828 states, 1827 states have (on average 2.875752599890531) internal successors, (5254), 1827 states have internal predecessors, (5254), 0 states have call successors, (0), 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:33:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 5254 transitions. [2025-04-13 22:33:06,904 INFO L79 Accepts]: Start accepts. Automaton has 1828 states and 5254 transitions. Word has length 56 [2025-04-13 22:33:06,904 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:06,904 INFO L485 AbstractCegarLoop]: Abstraction has 1828 states and 5254 transitions. [2025-04-13 22:33:06,904 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:06,904 INFO L278 IsEmpty]: Start isEmpty. Operand 1828 states and 5254 transitions. [2025-04-13 22:33:06,906 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:06,906 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:06,906 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:06,906 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-04-13 22:33:06,906 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:06,906 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:06,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1096162188, now seen corresponding path program 70 times [2025-04-13 22:33:06,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:06,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027316588] [2025-04-13 22:33:06,907 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:33:06,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:06,911 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:06,913 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:33:06,913 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:33:06,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:06,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:06,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:06,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027316588] [2025-04-13 22:33:06,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027316588] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:06,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:06,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:33:06,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122712099] [2025-04-13 22:33:06,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:06,989 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:06,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:06,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:06,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:33:06,990 INFO L87 Difference]: Start difference. First operand 1828 states and 5254 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:07,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:07,412 INFO L93 Difference]: Finished difference Result 1924 states and 5488 transitions. [2025-04-13 22:33:07,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:33:07,412 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:07,412 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:07,418 INFO L225 Difference]: With dead ends: 1924 [2025-04-13 22:33:07,418 INFO L226 Difference]: Without dead ends: 1865 [2025-04-13 22:33:07,419 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:33:07,419 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 185 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:07,419 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 77 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:07,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2025-04-13 22:33:07,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1823. [2025-04-13 22:33:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1823 states, 1822 states have (on average 2.875411635565313) internal successors, (5239), 1822 states have internal predecessors, (5239), 0 states have call successors, (0), 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:33:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 5239 transitions. [2025-04-13 22:33:07,438 INFO L79 Accepts]: Start accepts. Automaton has 1823 states and 5239 transitions. Word has length 56 [2025-04-13 22:33:07,438 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:07,438 INFO L485 AbstractCegarLoop]: Abstraction has 1823 states and 5239 transitions. [2025-04-13 22:33:07,438 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:07,438 INFO L278 IsEmpty]: Start isEmpty. Operand 1823 states and 5239 transitions. [2025-04-13 22:33:07,440 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:07,440 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:07,440 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:07,440 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-04-13 22:33:07,440 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:07,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:07,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1356285008, now seen corresponding path program 71 times [2025-04-13 22:33:07,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:07,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455900639] [2025-04-13 22:33:07,440 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:33:07,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:07,444 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:07,453 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:07,453 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:07,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:08,309 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:33:08,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:08,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455900639] [2025-04-13 22:33:08,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455900639] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:08,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489596314] [2025-04-13 22:33:08,309 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:33:08,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:08,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:08,311 INFO L229 MonitoredProcess]: Starting monitored process 24 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:33:08,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 22:33:08,365 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:08,383 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:08,383 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:08,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:08,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:33:08,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:08,581 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:33:08,581 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:33:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:08,587 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:33:08,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489596314] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:08,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:33:08,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18] total 26 [2025-04-13 22:33:08,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262850686] [2025-04-13 22:33:08,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:08,587 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:08,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:08,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:08,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=644, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:33:08,588 INFO L87 Difference]: Start difference. First operand 1823 states and 5239 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:09,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:09,381 INFO L93 Difference]: Finished difference Result 1898 states and 5411 transitions. [2025-04-13 22:33:09,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:33:09,382 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:09,382 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:09,387 INFO L225 Difference]: With dead ends: 1898 [2025-04-13 22:33:09,387 INFO L226 Difference]: Without dead ends: 1737 [2025-04-13 22:33:09,388 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=1650, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:33:09,388 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 165 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:09,388 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 61 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:33:09,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2025-04-13 22:33:09,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1726. [2025-04-13 22:33:09,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1725 states have (on average 2.907246376811594) internal successors, (5015), 1725 states have internal predecessors, (5015), 0 states have call successors, (0), 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:33:09,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 5015 transitions. [2025-04-13 22:33:09,406 INFO L79 Accepts]: Start accepts. Automaton has 1726 states and 5015 transitions. Word has length 56 [2025-04-13 22:33:09,406 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:09,406 INFO L485 AbstractCegarLoop]: Abstraction has 1726 states and 5015 transitions. [2025-04-13 22:33:09,406 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:09,406 INFO L278 IsEmpty]: Start isEmpty. Operand 1726 states and 5015 transitions. [2025-04-13 22:33:09,408 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:09,408 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:09,408 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:09,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-13 22:33:09,608 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:09,608 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:09,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:09,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1367605498, now seen corresponding path program 72 times [2025-04-13 22:33:09,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:09,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147371483] [2025-04-13 22:33:09,609 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:33:09,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:09,613 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:09,617 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:09,617 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:33:09,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:09,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:09,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147371483] [2025-04-13 22:33:09,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147371483] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:09,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:09,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:33:09,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414950177] [2025-04-13 22:33:09,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:09,709 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:33:09,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:09,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:33:09,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:33:09,710 INFO L87 Difference]: Start difference. First operand 1726 states and 5015 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:10,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:10,155 INFO L93 Difference]: Finished difference Result 2325 states and 6805 transitions. [2025-04-13 22:33:10,158 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:33:10,158 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:10,158 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:10,165 INFO L225 Difference]: With dead ends: 2325 [2025-04-13 22:33:10,165 INFO L226 Difference]: Without dead ends: 2260 [2025-04-13 22:33:10,165 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:33:10,165 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 220 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:10,165 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 74 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:10,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2025-04-13 22:33:10,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 1866. [2025-04-13 22:33:10,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1865 states have (on average 2.9227882037533512) internal successors, (5451), 1865 states have internal predecessors, (5451), 0 states have call successors, (0), 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:33:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 5451 transitions. [2025-04-13 22:33:10,185 INFO L79 Accepts]: Start accepts. Automaton has 1866 states and 5451 transitions. Word has length 56 [2025-04-13 22:33:10,185 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:10,185 INFO L485 AbstractCegarLoop]: Abstraction has 1866 states and 5451 transitions. [2025-04-13 22:33:10,185 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:10,185 INFO L278 IsEmpty]: Start isEmpty. Operand 1866 states and 5451 transitions. [2025-04-13 22:33:10,187 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:10,187 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:10,187 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:10,187 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-04-13 22:33:10,187 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:10,187 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:10,187 INFO L85 PathProgramCache]: Analyzing trace with hash 295221992, now seen corresponding path program 73 times [2025-04-13 22:33:10,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:10,188 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223693108] [2025-04-13 22:33:10,188 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:33:10,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:10,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:33:10,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:10,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:10,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:10,831 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:33:10,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:10,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223693108] [2025-04-13 22:33:10,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223693108] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:10,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748834692] [2025-04-13 22:33:10,831 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:33:10,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:10,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:10,833 INFO L229 MonitoredProcess]: Starting monitored process 25 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:33:10,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 22:33:10,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:33:10,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:10,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:10,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:10,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:33:10,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:11,115 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:33:11,115 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:33:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:33:11,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:11,289 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:33:11,289 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:33:11,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:11,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748834692] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:11,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:33:11,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 32 [2025-04-13 22:33:11,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839115082] [2025-04-13 22:33:11,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:11,316 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:11,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:11,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:11,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=968, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:33:11,317 INFO L87 Difference]: Start difference. First operand 1866 states and 5451 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:12,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:12,039 INFO L93 Difference]: Finished difference Result 2353 states and 6832 transitions. [2025-04-13 22:33:12,039 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:33:12,039 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:12,039 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:12,045 INFO L225 Difference]: With dead ends: 2353 [2025-04-13 22:33:12,045 INFO L226 Difference]: Without dead ends: 2189 [2025-04-13 22:33:12,046 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=210, Invalid=2442, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:33:12,046 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 282 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:12,047 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 87 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:33:12,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2025-04-13 22:33:12,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 1866. [2025-04-13 22:33:12,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1865 states have (on average 2.8959785522788204) internal successors, (5401), 1865 states have internal predecessors, (5401), 0 states have call successors, (0), 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:33:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 5401 transitions. [2025-04-13 22:33:12,068 INFO L79 Accepts]: Start accepts. Automaton has 1866 states and 5401 transitions. Word has length 56 [2025-04-13 22:33:12,068 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:12,068 INFO L485 AbstractCegarLoop]: Abstraction has 1866 states and 5401 transitions. [2025-04-13 22:33:12,068 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:12,068 INFO L278 IsEmpty]: Start isEmpty. Operand 1866 states and 5401 transitions. [2025-04-13 22:33:12,070 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:12,070 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:12,070 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:12,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-04-13 22:33:12,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:12,270 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:12,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:12,270 INFO L85 PathProgramCache]: Analyzing trace with hash -899137482, now seen corresponding path program 74 times [2025-04-13 22:33:12,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:12,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926154934] [2025-04-13 22:33:12,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:33:12,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:12,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:12,279 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:12,279 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:33:12,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:12,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:12,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:12,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926154934] [2025-04-13 22:33:12,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926154934] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:12,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:12,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:33:12,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499200222] [2025-04-13 22:33:12,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:12,370 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:33:12,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:12,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:33:12,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:33:12,370 INFO L87 Difference]: Start difference. First operand 1866 states and 5401 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:12,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:12,817 INFO L93 Difference]: Finished difference Result 2264 states and 6562 transitions. [2025-04-13 22:33:12,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:33:12,818 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:12,818 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:12,824 INFO L225 Difference]: With dead ends: 2264 [2025-04-13 22:33:12,824 INFO L226 Difference]: Without dead ends: 2205 [2025-04-13 22:33:12,825 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=838, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:33:12,825 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 229 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:12,825 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 72 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:12,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2025-04-13 22:33:12,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 1861. [2025-04-13 22:33:12,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1861 states, 1860 states have (on average 2.8956989247311826) internal successors, (5386), 1860 states have internal predecessors, (5386), 0 states have call successors, (0), 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:33:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1861 states to 1861 states and 5386 transitions. [2025-04-13 22:33:12,846 INFO L79 Accepts]: Start accepts. Automaton has 1861 states and 5386 transitions. Word has length 56 [2025-04-13 22:33:12,846 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:12,846 INFO L485 AbstractCegarLoop]: Abstraction has 1861 states and 5386 transitions. [2025-04-13 22:33:12,846 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:12,846 INFO L278 IsEmpty]: Start isEmpty. Operand 1861 states and 5386 transitions. [2025-04-13 22:33:12,848 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:12,848 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:12,848 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:12,848 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-04-13 22:33:12,848 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:12,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:12,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2002880950, now seen corresponding path program 75 times [2025-04-13 22:33:12,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:12,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301174961] [2025-04-13 22:33:12,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:33:12,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:12,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:12,857 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:12,857 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:33:12,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:12,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:12,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301174961] [2025-04-13 22:33:12,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301174961] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:12,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:12,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:33:12,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868843250] [2025-04-13 22:33:12,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:12,958 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:33:12,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:12,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:33:12,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:33:12,959 INFO L87 Difference]: Start difference. First operand 1861 states and 5386 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:13,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:13,402 INFO L93 Difference]: Finished difference Result 2238 states and 6485 transitions. [2025-04-13 22:33:13,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:33:13,403 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:13,403 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:13,408 INFO L225 Difference]: With dead ends: 2238 [2025-04-13 22:33:13,409 INFO L226 Difference]: Without dead ends: 2119 [2025-04-13 22:33:13,409 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:33:13,409 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 222 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:13,409 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 72 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:13,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2025-04-13 22:33:13,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1806. [2025-04-13 22:33:13,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1805 states have (on average 2.89196675900277) internal successors, (5220), 1805 states have internal predecessors, (5220), 0 states have call successors, (0), 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:33:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 5220 transitions. [2025-04-13 22:33:13,430 INFO L79 Accepts]: Start accepts. Automaton has 1806 states and 5220 transitions. Word has length 56 [2025-04-13 22:33:13,430 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:13,430 INFO L485 AbstractCegarLoop]: Abstraction has 1806 states and 5220 transitions. [2025-04-13 22:33:13,430 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:13,430 INFO L278 IsEmpty]: Start isEmpty. Operand 1806 states and 5220 transitions. [2025-04-13 22:33:13,432 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:13,432 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:13,432 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:13,432 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-04-13 22:33:13,432 INFO L403 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:13,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:13,432 INFO L85 PathProgramCache]: Analyzing trace with hash 442777832, now seen corresponding path program 76 times [2025-04-13 22:33:13,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:13,433 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626364382] [2025-04-13 22:33:13,433 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:33:13,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:13,437 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:13,440 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:33:13,440 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:33:13,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:13,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:13,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:13,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626364382] [2025-04-13 22:33:13,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626364382] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:13,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:13,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:33:13,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653996250] [2025-04-13 22:33:13,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:13,512 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:33:13,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:13,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:33:13,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:33:13,512 INFO L87 Difference]: Start difference. First operand 1806 states and 5220 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:14,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:14,037 INFO L93 Difference]: Finished difference Result 2256 states and 6530 transitions. [2025-04-13 22:33:14,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:33:14,038 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:14,038 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:14,044 INFO L225 Difference]: With dead ends: 2256 [2025-04-13 22:33:14,044 INFO L226 Difference]: Without dead ends: 2170 [2025-04-13 22:33:14,044 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=172, Invalid=1018, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:33:14,045 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 306 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:14,045 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 91 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1462 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:33:14,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2025-04-13 22:33:14,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 1916. [2025-04-13 22:33:14,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1916 states, 1915 states have (on average 2.901827676240209) internal successors, (5557), 1915 states have internal predecessors, (5557), 0 states have call successors, (0), 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:33:14,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 5557 transitions. [2025-04-13 22:33:14,065 INFO L79 Accepts]: Start accepts. Automaton has 1916 states and 5557 transitions. Word has length 56 [2025-04-13 22:33:14,065 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:14,065 INFO L485 AbstractCegarLoop]: Abstraction has 1916 states and 5557 transitions. [2025-04-13 22:33:14,065 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:14,065 INFO L278 IsEmpty]: Start isEmpty. Operand 1916 states and 5557 transitions. [2025-04-13 22:33:14,067 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:14,067 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:14,067 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:14,067 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2025-04-13 22:33:14,067 INFO L403 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:14,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:14,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1777000892, now seen corresponding path program 77 times [2025-04-13 22:33:14,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:14,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486843406] [2025-04-13 22:33:14,067 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:33:14,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:14,072 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:14,079 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:14,079 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:14,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:14,829 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:33:14,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:14,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486843406] [2025-04-13 22:33:14,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486843406] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:14,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442146618] [2025-04-13 22:33:14,830 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:33:14,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:14,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:14,832 INFO L229 MonitoredProcess]: Starting monitored process 26 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:33:14,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-13 22:33:14,888 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:14,906 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:14,906 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:14,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:14,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:33:14,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:15,053 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:33:15,053 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:33:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:15,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:33:15,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442146618] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:15,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:33:15,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 23 [2025-04-13 22:33:15,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075376586] [2025-04-13 22:33:15,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:15,059 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:15,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:15,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:15,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:33:15,060 INFO L87 Difference]: Start difference. First operand 1916 states and 5557 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:15,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:15,898 INFO L93 Difference]: Finished difference Result 2299 states and 6623 transitions. [2025-04-13 22:33:15,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:33:15,898 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:15,898 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:15,904 INFO L225 Difference]: With dead ends: 2299 [2025-04-13 22:33:15,904 INFO L226 Difference]: Without dead ends: 2201 [2025-04-13 22:33:15,905 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=1869, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:33:15,905 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 264 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:15,905 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 72 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:33:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2201 states. [2025-04-13 22:33:15,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2201 to 1931. [2025-04-13 22:33:15,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1930 states have (on average 2.8974093264248704) internal successors, (5592), 1930 states have internal predecessors, (5592), 0 states have call successors, (0), 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:33:15,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 5592 transitions. [2025-04-13 22:33:15,925 INFO L79 Accepts]: Start accepts. Automaton has 1931 states and 5592 transitions. Word has length 56 [2025-04-13 22:33:15,925 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:15,925 INFO L485 AbstractCegarLoop]: Abstraction has 1931 states and 5592 transitions. [2025-04-13 22:33:15,925 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:15,925 INFO L278 IsEmpty]: Start isEmpty. Operand 1931 states and 5592 transitions. [2025-04-13 22:33:15,927 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:15,927 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:15,927 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:15,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-04-13 22:33:16,127 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2025-04-13 22:33:16,127 INFO L403 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:16,128 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:16,128 INFO L85 PathProgramCache]: Analyzing trace with hash -592604952, now seen corresponding path program 78 times [2025-04-13 22:33:16,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:16,128 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754412177] [2025-04-13 22:33:16,128 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:33:16,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:16,132 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:16,136 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:16,136 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:33:16,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:16,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:16,224 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754412177] [2025-04-13 22:33:16,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754412177] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:16,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:16,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:33:16,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230575333] [2025-04-13 22:33:16,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:16,225 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:33:16,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:16,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:33:16,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:33:16,225 INFO L87 Difference]: Start difference. First operand 1931 states and 5592 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:16,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:16,680 INFO L93 Difference]: Finished difference Result 2229 states and 6444 transitions. [2025-04-13 22:33:16,680 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:33:16,680 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:16,680 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:16,687 INFO L225 Difference]: With dead ends: 2229 [2025-04-13 22:33:16,687 INFO L226 Difference]: Without dead ends: 2165 [2025-04-13 22:33:16,687 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:33:16,687 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 220 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:16,687 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 82 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:16,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2025-04-13 22:33:16,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 1921. [2025-04-13 22:33:16,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1921 states, 1920 states have (on average 2.8994791666666666) internal successors, (5567), 1920 states have internal predecessors, (5567), 0 states have call successors, (0), 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:33:16,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 5567 transitions. [2025-04-13 22:33:16,708 INFO L79 Accepts]: Start accepts. Automaton has 1921 states and 5567 transitions. Word has length 56 [2025-04-13 22:33:16,708 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:16,708 INFO L485 AbstractCegarLoop]: Abstraction has 1921 states and 5567 transitions. [2025-04-13 22:33:16,708 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:16,708 INFO L278 IsEmpty]: Start isEmpty. Operand 1921 states and 5567 transitions. [2025-04-13 22:33:16,710 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:16,710 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:16,710 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:16,710 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2025-04-13 22:33:16,710 INFO L403 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:16,710 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:16,710 INFO L85 PathProgramCache]: Analyzing trace with hash -836129494, now seen corresponding path program 79 times [2025-04-13 22:33:16,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:16,710 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442073699] [2025-04-13 22:33:16,710 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:33:16,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:16,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:33:16,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:16,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:16,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:17,458 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:33:17,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:17,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442073699] [2025-04-13 22:33:17,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442073699] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:17,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893908077] [2025-04-13 22:33:17,459 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:33:17,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:17,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:17,465 INFO L229 MonitoredProcess]: Starting monitored process 27 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:33:17,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-13 22:33:17,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:33:17,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:17,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:17,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:17,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:33:17,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:17,722 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:33:17,722 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:33:17,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:33:17,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:17,892 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:33:17,892 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:33:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:17,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893908077] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:17,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:33:17,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 22:33:17,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211992743] [2025-04-13 22:33:17,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:17,922 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:17,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:17,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:17,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:33:17,922 INFO L87 Difference]: Start difference. First operand 1921 states and 5567 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:18,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:18,688 INFO L93 Difference]: Finished difference Result 2271 states and 6568 transitions. [2025-04-13 22:33:18,688 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:33:18,688 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:18,688 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:18,694 INFO L225 Difference]: With dead ends: 2271 [2025-04-13 22:33:18,694 INFO L226 Difference]: Without dead ends: 2206 [2025-04-13 22:33:18,695 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=2733, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 22:33:18,695 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 270 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:18,695 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 78 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:33:18,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2025-04-13 22:33:18,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 1931. [2025-04-13 22:33:18,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1930 states have (on average 2.8974093264248704) internal successors, (5592), 1930 states have internal predecessors, (5592), 0 states have call successors, (0), 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:33:18,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 5592 transitions. [2025-04-13 22:33:18,716 INFO L79 Accepts]: Start accepts. Automaton has 1931 states and 5592 transitions. Word has length 56 [2025-04-13 22:33:18,716 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:18,716 INFO L485 AbstractCegarLoop]: Abstraction has 1931 states and 5592 transitions. [2025-04-13 22:33:18,716 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:18,716 INFO L278 IsEmpty]: Start isEmpty. Operand 1931 states and 5592 transitions. [2025-04-13 22:33:18,717 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:18,717 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:18,717 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:18,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-04-13 22:33:18,918 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2025-04-13 22:33:18,918 INFO L403 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:18,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:18,918 INFO L85 PathProgramCache]: Analyzing trace with hash -2077694278, now seen corresponding path program 80 times [2025-04-13 22:33:18,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:18,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491239231] [2025-04-13 22:33:18,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:33:18,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:18,923 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:18,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:18,927 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:33:18,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:19,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:19,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:19,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491239231] [2025-04-13 22:33:19,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491239231] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:19,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:19,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:33:19,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131741436] [2025-04-13 22:33:19,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:19,015 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:33:19,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:19,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:33:19,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:33:19,016 INFO L87 Difference]: Start difference. First operand 1931 states and 5592 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:19,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:19,468 INFO L93 Difference]: Finished difference Result 2260 states and 6531 transitions. [2025-04-13 22:33:19,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:33:19,468 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:19,468 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:19,474 INFO L225 Difference]: With dead ends: 2260 [2025-04-13 22:33:19,474 INFO L226 Difference]: Without dead ends: 2201 [2025-04-13 22:33:19,475 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:33:19,475 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 209 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:19,475 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 75 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2201 states. [2025-04-13 22:33:19,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2201 to 1926. [2025-04-13 22:33:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1925 states have (on average 2.8971428571428572) internal successors, (5577), 1925 states have internal predecessors, (5577), 0 states have call successors, (0), 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:33:19,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 5577 transitions. [2025-04-13 22:33:19,495 INFO L79 Accepts]: Start accepts. Automaton has 1926 states and 5577 transitions. Word has length 56 [2025-04-13 22:33:19,495 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:19,495 INFO L485 AbstractCegarLoop]: Abstraction has 1926 states and 5577 transitions. [2025-04-13 22:33:19,495 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:19,496 INFO L278 IsEmpty]: Start isEmpty. Operand 1926 states and 5577 transitions. [2025-04-13 22:33:19,497 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:19,497 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:19,497 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:19,497 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2025-04-13 22:33:19,497 INFO L403 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:19,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:19,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1023503404, now seen corresponding path program 81 times [2025-04-13 22:33:19,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:19,498 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806947829] [2025-04-13 22:33:19,498 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:33:19,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:19,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:19,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:19,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:33:19,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:19,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:19,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:19,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806947829] [2025-04-13 22:33:19,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806947829] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:19,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:19,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:33:19,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220621723] [2025-04-13 22:33:19,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:19,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:33:19,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:19,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:33:19,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:33:19,608 INFO L87 Difference]: Start difference. First operand 1926 states and 5577 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:20,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:20,094 INFO L93 Difference]: Finished difference Result 2234 states and 6454 transitions. [2025-04-13 22:33:20,094 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:33:20,094 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:20,094 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:20,101 INFO L225 Difference]: With dead ends: 2234 [2025-04-13 22:33:20,101 INFO L226 Difference]: Without dead ends: 2110 [2025-04-13 22:33:20,101 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=156, Invalid=900, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:33:20,101 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 217 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:20,101 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 74 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:33:20,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2025-04-13 22:33:20,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 1866. [2025-04-13 22:33:20,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1865 states have (on average 2.917426273458445) internal successors, (5441), 1865 states have internal predecessors, (5441), 0 states have call successors, (0), 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:33:20,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 5441 transitions. [2025-04-13 22:33:20,121 INFO L79 Accepts]: Start accepts. Automaton has 1866 states and 5441 transitions. Word has length 56 [2025-04-13 22:33:20,121 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:20,121 INFO L485 AbstractCegarLoop]: Abstraction has 1866 states and 5441 transitions. [2025-04-13 22:33:20,121 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:20,121 INFO L278 IsEmpty]: Start isEmpty. Operand 1866 states and 5441 transitions. [2025-04-13 22:33:20,123 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:20,123 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:20,123 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:20,123 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2025-04-13 22:33:20,123 INFO L403 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:20,123 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:20,123 INFO L85 PathProgramCache]: Analyzing trace with hash -333153604, now seen corresponding path program 82 times [2025-04-13 22:33:20,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:20,123 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195105983] [2025-04-13 22:33:20,123 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:33:20,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:20,127 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:20,130 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:33:20,130 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:33:20,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:20,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:20,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:20,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195105983] [2025-04-13 22:33:20,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195105983] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:20,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:20,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:33:20,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589894960] [2025-04-13 22:33:20,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:20,202 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:20,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:20,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:20,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:33:20,202 INFO L87 Difference]: Start difference. First operand 1866 states and 5441 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:20,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:20,682 INFO L93 Difference]: Finished difference Result 2255 states and 6577 transitions. [2025-04-13 22:33:20,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:33:20,683 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:20,683 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:20,689 INFO L225 Difference]: With dead ends: 2255 [2025-04-13 22:33:20,690 INFO L226 Difference]: Without dead ends: 2190 [2025-04-13 22:33:20,690 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:33:20,690 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 223 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:20,690 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 84 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:33:20,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2025-04-13 22:33:20,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 1936. [2025-04-13 22:33:20,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1935 states have (on average 2.9224806201550386) internal successors, (5655), 1935 states have internal predecessors, (5655), 0 states have call successors, (0), 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:33:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 5655 transitions. [2025-04-13 22:33:20,711 INFO L79 Accepts]: Start accepts. Automaton has 1936 states and 5655 transitions. Word has length 56 [2025-04-13 22:33:20,711 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:20,711 INFO L485 AbstractCegarLoop]: Abstraction has 1936 states and 5655 transitions. [2025-04-13 22:33:20,711 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:20,711 INFO L278 IsEmpty]: Start isEmpty. Operand 1936 states and 5655 transitions. [2025-04-13 22:33:20,712 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:20,712 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:20,713 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:20,713 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2025-04-13 22:33:20,713 INFO L403 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:20,713 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:20,713 INFO L85 PathProgramCache]: Analyzing trace with hash -888702618, now seen corresponding path program 83 times [2025-04-13 22:33:20,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:20,713 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010140565] [2025-04-13 22:33:20,713 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:33:20,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:20,717 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:20,724 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:20,724 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:20,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:21,559 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:33:21,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:21,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010140565] [2025-04-13 22:33:21,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010140565] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:21,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954432845] [2025-04-13 22:33:21,559 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:33:21,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:21,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:21,561 INFO L229 MonitoredProcess]: Starting monitored process 28 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:33:21,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-13 22:33:21,619 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:21,641 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:21,641 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:21,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:21,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:33:21,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:21,855 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:33:21,856 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:33:21,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:21,863 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:33:21,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954432845] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:21,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:33:21,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 24 [2025-04-13 22:33:21,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579216244] [2025-04-13 22:33:21,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:21,863 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:21,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:21,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:21,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:33:21,864 INFO L87 Difference]: Start difference. First operand 1936 states and 5655 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:22,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:22,876 INFO L93 Difference]: Finished difference Result 2353 states and 6820 transitions. [2025-04-13 22:33:22,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:33:22,877 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:22,877 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:22,884 INFO L225 Difference]: With dead ends: 2353 [2025-04-13 22:33:22,884 INFO L226 Difference]: Without dead ends: 2189 [2025-04-13 22:33:22,884 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=1729, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:33:22,884 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 258 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:22,885 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 89 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:33:22,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2025-04-13 22:33:22,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 1936. [2025-04-13 22:33:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1935 states have (on average 2.896640826873385) internal successors, (5605), 1935 states have internal predecessors, (5605), 0 states have call successors, (0), 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:33:22,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 5605 transitions. [2025-04-13 22:33:22,906 INFO L79 Accepts]: Start accepts. Automaton has 1936 states and 5605 transitions. Word has length 56 [2025-04-13 22:33:22,906 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:22,906 INFO L485 AbstractCegarLoop]: Abstraction has 1936 states and 5605 transitions. [2025-04-13 22:33:22,906 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:22,906 INFO L278 IsEmpty]: Start isEmpty. Operand 1936 states and 5605 transitions. [2025-04-13 22:33:22,908 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:22,908 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:22,908 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:22,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-13 22:33:23,108 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:23,108 INFO L403 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:23,108 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:23,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1695070712, now seen corresponding path program 84 times [2025-04-13 22:33:23,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:23,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388717590] [2025-04-13 22:33:23,109 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:33:23,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:23,113 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:23,117 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:23,117 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:33:23,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:23,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:23,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388717590] [2025-04-13 22:33:23,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388717590] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:23,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:23,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:33:23,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867991643] [2025-04-13 22:33:23,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:23,214 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:23,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:23,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:23,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:33:23,215 INFO L87 Difference]: Start difference. First operand 1936 states and 5605 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:23,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:23,677 INFO L93 Difference]: Finished difference Result 2244 states and 6490 transitions. [2025-04-13 22:33:23,677 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:33:23,677 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:23,677 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:23,684 INFO L225 Difference]: With dead ends: 2244 [2025-04-13 22:33:23,684 INFO L226 Difference]: Without dead ends: 2185 [2025-04-13 22:33:23,684 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:33:23,684 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 233 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:23,685 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 83 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:23,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2025-04-13 22:33:23,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 1931. [2025-04-13 22:33:23,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1930 states have (on average 2.8963730569948187) internal successors, (5590), 1930 states have internal predecessors, (5590), 0 states have call successors, (0), 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:33:23,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 5590 transitions. [2025-04-13 22:33:23,705 INFO L79 Accepts]: Start accepts. Automaton has 1931 states and 5590 transitions. Word has length 56 [2025-04-13 22:33:23,705 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:23,705 INFO L485 AbstractCegarLoop]: Abstraction has 1931 states and 5590 transitions. [2025-04-13 22:33:23,705 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:23,705 INFO L278 IsEmpty]: Start isEmpty. Operand 1931 states and 5590 transitions. [2025-04-13 22:33:23,707 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:23,707 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:23,707 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:23,707 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2025-04-13 22:33:23,707 INFO L403 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:23,707 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:23,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1108161736, now seen corresponding path program 85 times [2025-04-13 22:33:23,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:23,707 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664528011] [2025-04-13 22:33:23,707 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:33:23,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:23,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:33:23,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:23,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:23,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:24,662 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:33:24,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:24,663 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664528011] [2025-04-13 22:33:24,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664528011] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:24,663 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291501751] [2025-04-13 22:33:24,663 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:33:24,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:24,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:24,665 INFO L229 MonitoredProcess]: Starting monitored process 29 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:33:24,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-13 22:33:24,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:33:24,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:24,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:24,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:24,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:33:24,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:24,972 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:33:24,973 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:33:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:33:24,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:25,189 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:33:25,189 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:33:25,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:25,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291501751] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:25,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:33:25,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 34 [2025-04-13 22:33:25,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187742859] [2025-04-13 22:33:25,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:25,224 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:25,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:25,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:25,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1104, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:33:25,224 INFO L87 Difference]: Start difference. First operand 1931 states and 5590 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:25,914 INFO L93 Difference]: Finished difference Result 2249 states and 6500 transitions. [2025-04-13 22:33:25,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:33:25,914 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:25,914 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:25,921 INFO L225 Difference]: With dead ends: 2249 [2025-04-13 22:33:25,921 INFO L226 Difference]: Without dead ends: 2130 [2025-04-13 22:33:25,921 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=2551, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:33:25,921 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 219 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:25,922 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 81 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:33:25,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2025-04-13 22:33:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 1876. [2025-04-13 22:33:25,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1876 states, 1875 states have (on average 2.9141333333333335) internal successors, (5464), 1875 states have internal predecessors, (5464), 0 states have call successors, (0), 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:33:25,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 5464 transitions. [2025-04-13 22:33:25,942 INFO L79 Accepts]: Start accepts. Automaton has 1876 states and 5464 transitions. Word has length 56 [2025-04-13 22:33:25,942 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:25,942 INFO L485 AbstractCegarLoop]: Abstraction has 1876 states and 5464 transitions. [2025-04-13 22:33:25,942 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:25,942 INFO L278 IsEmpty]: Start isEmpty. Operand 1876 states and 5464 transitions. [2025-04-13 22:33:25,944 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:25,944 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:25,944 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:25,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-13 22:33:26,144 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:26,145 INFO L403 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:26,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:26,145 INFO L85 PathProgramCache]: Analyzing trace with hash -604214360, now seen corresponding path program 86 times [2025-04-13 22:33:26,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:26,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466547001] [2025-04-13 22:33:26,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:33:26,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:26,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:26,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:26,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:33:26,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:26,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:26,256 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466547001] [2025-04-13 22:33:26,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466547001] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:26,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:26,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:33:26,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050885537] [2025-04-13 22:33:26,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:26,256 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:26,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:26,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:26,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:33:26,257 INFO L87 Difference]: Start difference. First operand 1876 states and 5464 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:26,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:26,727 INFO L93 Difference]: Finished difference Result 2253 states and 6505 transitions. [2025-04-13 22:33:26,727 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:33:26,728 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:26,728 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:26,734 INFO L225 Difference]: With dead ends: 2253 [2025-04-13 22:33:26,734 INFO L226 Difference]: Without dead ends: 2049 [2025-04-13 22:33:26,734 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=800, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:33:26,735 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 250 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:26,735 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 99 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:33:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2025-04-13 22:33:26,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 1856. [2025-04-13 22:33:26,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1855 states have (on average 2.915363881401617) internal successors, (5408), 1855 states have internal predecessors, (5408), 0 states have call successors, (0), 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:33:26,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 5408 transitions. [2025-04-13 22:33:26,754 INFO L79 Accepts]: Start accepts. Automaton has 1856 states and 5408 transitions. Word has length 56 [2025-04-13 22:33:26,754 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:26,754 INFO L485 AbstractCegarLoop]: Abstraction has 1856 states and 5408 transitions. [2025-04-13 22:33:26,754 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:26,754 INFO L278 IsEmpty]: Start isEmpty. Operand 1856 states and 5408 transitions. [2025-04-13 22:33:26,756 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:26,756 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:26,756 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:26,756 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2025-04-13 22:33:26,756 INFO L403 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:26,757 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:26,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1037645624, now seen corresponding path program 87 times [2025-04-13 22:33:26,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:26,757 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769524228] [2025-04-13 22:33:26,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:33:26,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:26,761 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:26,765 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:26,765 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:33:26,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:26,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:26,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:26,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769524228] [2025-04-13 22:33:26,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769524228] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:26,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:26,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:33:26,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632719422] [2025-04-13 22:33:26,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:26,860 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:33:26,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:26,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:33:26,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:33:26,861 INFO L87 Difference]: Start difference. First operand 1856 states and 5408 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:27,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:27,318 INFO L93 Difference]: Finished difference Result 2273 states and 6570 transitions. [2025-04-13 22:33:27,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:33:27,318 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:27,318 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:27,325 INFO L225 Difference]: With dead ends: 2273 [2025-04-13 22:33:27,325 INFO L226 Difference]: Without dead ends: 2109 [2025-04-13 22:33:27,325 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:33:27,325 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 314 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:27,326 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 93 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:27,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2025-04-13 22:33:27,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 1906. [2025-04-13 22:33:27,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1906 states, 1905 states have (on average 2.894488188976378) internal successors, (5514), 1905 states have internal predecessors, (5514), 0 states have call successors, (0), 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:33:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 5514 transitions. [2025-04-13 22:33:27,346 INFO L79 Accepts]: Start accepts. Automaton has 1906 states and 5514 transitions. Word has length 56 [2025-04-13 22:33:27,346 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:27,346 INFO L485 AbstractCegarLoop]: Abstraction has 1906 states and 5514 transitions. [2025-04-13 22:33:27,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:27,346 INFO L278 IsEmpty]: Start isEmpty. Operand 1906 states and 5514 transitions. [2025-04-13 22:33:27,348 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:27,348 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:27,348 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:27,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2025-04-13 22:33:27,348 INFO L403 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:27,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:27,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1307789542, now seen corresponding path program 88 times [2025-04-13 22:33:27,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:27,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819584203] [2025-04-13 22:33:27,348 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:33:27,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:27,353 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:27,355 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:33:27,355 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:33:27,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:27,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:27,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:27,420 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819584203] [2025-04-13 22:33:27,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819584203] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:27,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:27,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:33:27,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498951971] [2025-04-13 22:33:27,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:27,421 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:33:27,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:27,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:33:27,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:33:27,421 INFO L87 Difference]: Start difference. First operand 1906 states and 5514 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:27,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:27,858 INFO L93 Difference]: Finished difference Result 2185 states and 6296 transitions. [2025-04-13 22:33:27,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:33:27,858 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:27,858 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:27,865 INFO L225 Difference]: With dead ends: 2185 [2025-04-13 22:33:27,865 INFO L226 Difference]: Without dead ends: 2120 [2025-04-13 22:33:27,865 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:33:27,865 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 251 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:27,865 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 73 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:27,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2025-04-13 22:33:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 1916. [2025-04-13 22:33:27,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1916 states, 1915 states have (on average 2.8924281984334206) internal successors, (5539), 1915 states have internal predecessors, (5539), 0 states have call successors, (0), 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:33:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 5539 transitions. [2025-04-13 22:33:27,886 INFO L79 Accepts]: Start accepts. Automaton has 1916 states and 5539 transitions. Word has length 56 [2025-04-13 22:33:27,886 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:27,886 INFO L485 AbstractCegarLoop]: Abstraction has 1916 states and 5539 transitions. [2025-04-13 22:33:27,886 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:27,886 INFO L278 IsEmpty]: Start isEmpty. Operand 1916 states and 5539 transitions. [2025-04-13 22:33:27,888 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:27,888 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:27,888 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:27,888 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2025-04-13 22:33:27,888 INFO L403 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:27,888 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:27,888 INFO L85 PathProgramCache]: Analyzing trace with hash 956592954, now seen corresponding path program 89 times [2025-04-13 22:33:27,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:27,888 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138554000] [2025-04-13 22:33:27,888 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:33:27,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:27,893 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:27,901 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:27,901 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:27,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:28,489 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:33:28,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:28,490 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138554000] [2025-04-13 22:33:28,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138554000] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:28,490 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096653212] [2025-04-13 22:33:28,490 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:33:28,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:28,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:28,491 INFO L229 MonitoredProcess]: Starting monitored process 30 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:33:28,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-13 22:33:28,552 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:28,569 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:28,569 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:28,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:28,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:33:28,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:28,734 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:33:28,734 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:33:28,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:33:28,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:28,880 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:33:28,881 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:33:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:28,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096653212] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:28,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:33:28,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 22:33:28,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146468235] [2025-04-13 22:33:28,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:28,907 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:28,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:28,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:28,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=849, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:33:28,907 INFO L87 Difference]: Start difference. First operand 1916 states and 5539 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:29,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:29,593 INFO L93 Difference]: Finished difference Result 2174 states and 6259 transitions. [2025-04-13 22:33:29,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:33:29,593 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:29,593 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:29,600 INFO L225 Difference]: With dead ends: 2174 [2025-04-13 22:33:29,600 INFO L226 Difference]: Without dead ends: 2115 [2025-04-13 22:33:29,600 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=225, Invalid=2427, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:33:29,601 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 290 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:29,601 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 75 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:33:29,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2115 states. [2025-04-13 22:33:29,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2115 to 1911. [2025-04-13 22:33:29,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1911 states, 1910 states have (on average 2.892146596858639) internal successors, (5524), 1910 states have internal predecessors, (5524), 0 states have call successors, (0), 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:33:29,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 5524 transitions. [2025-04-13 22:33:29,621 INFO L79 Accepts]: Start accepts. Automaton has 1911 states and 5524 transitions. Word has length 56 [2025-04-13 22:33:29,621 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:29,621 INFO L485 AbstractCegarLoop]: Abstraction has 1911 states and 5524 transitions. [2025-04-13 22:33:29,622 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:29,622 INFO L278 IsEmpty]: Start isEmpty. Operand 1911 states and 5524 transitions. [2025-04-13 22:33:29,623 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:29,623 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:29,623 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:29,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-04-13 22:33:29,824 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:29,824 INFO L403 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:29,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:29,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1635516262, now seen corresponding path program 90 times [2025-04-13 22:33:29,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:29,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926134542] [2025-04-13 22:33:29,824 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:33:29,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:29,829 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:29,833 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:29,833 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:33:29,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:29,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:29,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:29,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926134542] [2025-04-13 22:33:29,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926134542] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:29,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:29,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:33:29,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920336062] [2025-04-13 22:33:29,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:29,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:33:29,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:29,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:33:29,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:33:29,927 INFO L87 Difference]: Start difference. First operand 1911 states and 5524 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:30,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:30,365 INFO L93 Difference]: Finished difference Result 2148 states and 6182 transitions. [2025-04-13 22:33:30,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:33:30,365 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:30,365 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:30,371 INFO L225 Difference]: With dead ends: 2148 [2025-04-13 22:33:30,371 INFO L226 Difference]: Without dead ends: 2029 [2025-04-13 22:33:30,372 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:33:30,372 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 253 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:30,372 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 72 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:30,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2025-04-13 22:33:30,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1856. [2025-04-13 22:33:30,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1855 states have (on average 2.8884097035040432) internal successors, (5358), 1855 states have internal predecessors, (5358), 0 states have call successors, (0), 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:33:30,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 5358 transitions. [2025-04-13 22:33:30,393 INFO L79 Accepts]: Start accepts. Automaton has 1856 states and 5358 transitions. Word has length 56 [2025-04-13 22:33:30,393 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:30,393 INFO L485 AbstractCegarLoop]: Abstraction has 1856 states and 5358 transitions. [2025-04-13 22:33:30,394 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:30,394 INFO L278 IsEmpty]: Start isEmpty. Operand 1856 states and 5358 transitions. [2025-04-13 22:33:30,395 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:30,395 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:30,395 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:30,396 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2025-04-13 22:33:30,396 INFO L403 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:30,396 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:30,396 INFO L85 PathProgramCache]: Analyzing trace with hash 444133276, now seen corresponding path program 91 times [2025-04-13 22:33:30,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:30,396 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76441046] [2025-04-13 22:33:30,396 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:33:30,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:30,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:33:30,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:30,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:30,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:31,124 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:33:31,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:31,124 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76441046] [2025-04-13 22:33:31,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76441046] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:31,124 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702835446] [2025-04-13 22:33:31,124 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:33:31,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:31,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:31,126 INFO L229 MonitoredProcess]: Starting monitored process 31 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:33:31,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-13 22:33:31,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:33:31,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:31,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:31,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:31,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:33:31,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:31,376 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:33:31,376 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:33:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:33:31,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:31,548 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:33:31,548 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:33:31,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:31,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702835446] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:31,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:33:31,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 32 [2025-04-13 22:33:31,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907741088] [2025-04-13 22:33:31,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:31,572 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:31,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:31,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:31,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:33:31,572 INFO L87 Difference]: Start difference. First operand 1856 states and 5358 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:32,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:32,424 INFO L93 Difference]: Finished difference Result 2146 states and 6167 transitions. [2025-04-13 22:33:32,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 22:33:32,424 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:32,424 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:32,431 INFO L225 Difference]: With dead ends: 2146 [2025-04-13 22:33:32,432 INFO L226 Difference]: Without dead ends: 2081 [2025-04-13 22:33:32,432 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=278, Invalid=3144, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 22:33:32,432 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 337 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:32,433 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 75 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:33:32,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2081 states. [2025-04-13 22:33:32,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 1861. [2025-04-13 22:33:32,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1861 states, 1860 states have (on average 2.8860215053763443) internal successors, (5368), 1860 states have internal predecessors, (5368), 0 states have call successors, (0), 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:33:32,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1861 states to 1861 states and 5368 transitions. [2025-04-13 22:33:32,452 INFO L79 Accepts]: Start accepts. Automaton has 1861 states and 5368 transitions. Word has length 56 [2025-04-13 22:33:32,452 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:32,452 INFO L485 AbstractCegarLoop]: Abstraction has 1861 states and 5368 transitions. [2025-04-13 22:33:32,452 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:32,452 INFO L278 IsEmpty]: Start isEmpty. Operand 1861 states and 5368 transitions. [2025-04-13 22:33:32,454 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:32,454 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:32,454 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:32,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-13 22:33:32,654 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable91 [2025-04-13 22:33:32,655 INFO L403 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:32,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:32,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1026967304, now seen corresponding path program 92 times [2025-04-13 22:33:32,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:32,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926883621] [2025-04-13 22:33:32,655 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:33:32,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:32,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:32,665 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:32,665 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:33:32,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:32,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:32,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:32,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926883621] [2025-04-13 22:33:32,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926883621] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:32,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:32,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:33:32,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023788129] [2025-04-13 22:33:32,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:32,767 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:33:32,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:32,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:33:32,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:33:32,767 INFO L87 Difference]: Start difference. First operand 1861 states and 5368 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:33,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:33,229 INFO L93 Difference]: Finished difference Result 2109 states and 6058 transitions. [2025-04-13 22:33:33,229 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:33:33,230 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:33,230 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:33,236 INFO L225 Difference]: With dead ends: 2109 [2025-04-13 22:33:33,236 INFO L226 Difference]: Without dead ends: 2045 [2025-04-13 22:33:33,237 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=166, Invalid=890, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:33:33,237 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 266 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:33,237 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 81 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:33,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2025-04-13 22:33:33,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 1851. [2025-04-13 22:33:33,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1851 states, 1850 states have (on average 2.888108108108108) internal successors, (5343), 1850 states have internal predecessors, (5343), 0 states have call successors, (0), 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:33:33,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 5343 transitions. [2025-04-13 22:33:33,256 INFO L79 Accepts]: Start accepts. Automaton has 1851 states and 5343 transitions. Word has length 56 [2025-04-13 22:33:33,256 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:33,256 INFO L485 AbstractCegarLoop]: Abstraction has 1851 states and 5343 transitions. [2025-04-13 22:33:33,256 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:33,257 INFO L278 IsEmpty]: Start isEmpty. Operand 1851 states and 5343 transitions. [2025-04-13 22:33:33,258 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:33,258 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:33,258 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:33,258 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2025-04-13 22:33:33,258 INFO L403 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:33,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:33,259 INFO L85 PathProgramCache]: Analyzing trace with hash 2125970186, now seen corresponding path program 93 times [2025-04-13 22:33:33,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:33,259 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150027480] [2025-04-13 22:33:33,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:33:33,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:33,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:33,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:33,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:33:33,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:33,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:33,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150027480] [2025-04-13 22:33:33,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150027480] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:33,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:33,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:33:33,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36430439] [2025-04-13 22:33:33,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:33,355 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:33:33,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:33,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:33:33,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:33:33,356 INFO L87 Difference]: Start difference. First operand 1851 states and 5343 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:33,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:33,821 INFO L93 Difference]: Finished difference Result 2120 states and 6095 transitions. [2025-04-13 22:33:33,821 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:33:33,821 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:33,821 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:33,827 INFO L225 Difference]: With dead ends: 2120 [2025-04-13 22:33:33,827 INFO L226 Difference]: Without dead ends: 2055 [2025-04-13 22:33:33,828 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=180, Invalid=1010, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:33:33,828 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 281 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:33,828 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 74 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:33,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2025-04-13 22:33:33,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 1861. [2025-04-13 22:33:33,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1861 states, 1860 states have (on average 2.8860215053763443) internal successors, (5368), 1860 states have internal predecessors, (5368), 0 states have call successors, (0), 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:33:33,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1861 states to 1861 states and 5368 transitions. [2025-04-13 22:33:33,847 INFO L79 Accepts]: Start accepts. Automaton has 1861 states and 5368 transitions. Word has length 56 [2025-04-13 22:33:33,848 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:33,848 INFO L485 AbstractCegarLoop]: Abstraction has 1861 states and 5368 transitions. [2025-04-13 22:33:33,848 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:33,848 INFO L278 IsEmpty]: Start isEmpty. Operand 1861 states and 5368 transitions. [2025-04-13 22:33:33,849 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:33,849 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:33,849 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:33,849 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2025-04-13 22:33:33,849 INFO L403 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:33,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:33,850 INFO L85 PathProgramCache]: Analyzing trace with hash -458122022, now seen corresponding path program 94 times [2025-04-13 22:33:33,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:33,850 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657703544] [2025-04-13 22:33:33,850 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:33:33,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:33,855 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:33,858 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:33:33,858 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:33:33,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:33,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:33,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:33,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657703544] [2025-04-13 22:33:33,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657703544] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:33,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:33,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:33:33,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803662005] [2025-04-13 22:33:33,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:33,928 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:33:33,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:33,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:33:33,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:33:33,929 INFO L87 Difference]: Start difference. First operand 1861 states and 5368 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:34,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:34,370 INFO L93 Difference]: Finished difference Result 2109 states and 6058 transitions. [2025-04-13 22:33:34,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:33:34,370 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:34,370 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:34,376 INFO L225 Difference]: With dead ends: 2109 [2025-04-13 22:33:34,376 INFO L226 Difference]: Without dead ends: 2050 [2025-04-13 22:33:34,376 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:33:34,376 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 253 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:34,376 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 74 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:34,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2025-04-13 22:33:34,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 1856. [2025-04-13 22:33:34,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1855 states have (on average 2.8857142857142857) internal successors, (5353), 1855 states have internal predecessors, (5353), 0 states have call successors, (0), 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:33:34,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 5353 transitions. [2025-04-13 22:33:34,396 INFO L79 Accepts]: Start accepts. Automaton has 1856 states and 5353 transitions. Word has length 56 [2025-04-13 22:33:34,396 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:34,396 INFO L485 AbstractCegarLoop]: Abstraction has 1856 states and 5353 transitions. [2025-04-13 22:33:34,396 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:34,396 INFO L278 IsEmpty]: Start isEmpty. Operand 1856 states and 5353 transitions. [2025-04-13 22:33:34,397 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:34,397 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:34,398 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:34,398 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2025-04-13 22:33:34,398 INFO L403 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:34,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:34,398 INFO L85 PathProgramCache]: Analyzing trace with hash -309364212, now seen corresponding path program 95 times [2025-04-13 22:33:34,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:34,398 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971595919] [2025-04-13 22:33:34,398 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:33:34,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:34,402 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:34,411 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:34,411 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:34,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:35,307 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:33:35,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:35,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971595919] [2025-04-13 22:33:35,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971595919] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:35,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736322848] [2025-04-13 22:33:35,308 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:33:35,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:35,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:35,309 INFO L229 MonitoredProcess]: Starting monitored process 32 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:33:35,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-13 22:33:35,374 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:35,392 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:35,392 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:35,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:35,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:33:35,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:35,584 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:33:35,584 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:33:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:35,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:33:35,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736322848] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:35,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:33:35,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 26 [2025-04-13 22:33:35,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742948024] [2025-04-13 22:33:35,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:35,605 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:35,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:35,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:35,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:33:35,606 INFO L87 Difference]: Start difference. First operand 1856 states and 5353 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:36,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:36,486 INFO L93 Difference]: Finished difference Result 2083 states and 5981 transitions. [2025-04-13 22:33:36,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:33:36,487 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:36,487 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:36,493 INFO L225 Difference]: With dead ends: 2083 [2025-04-13 22:33:36,493 INFO L226 Difference]: Without dead ends: 1959 [2025-04-13 22:33:36,493 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=221, Invalid=1941, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 22:33:36,493 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 249 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:36,493 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 67 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:33:36,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2025-04-13 22:33:36,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1796. [2025-04-13 22:33:36,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1795 states have (on average 2.8841225626740945) internal successors, (5177), 1795 states have internal predecessors, (5177), 0 states have call successors, (0), 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:33:36,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 5177 transitions. [2025-04-13 22:33:36,513 INFO L79 Accepts]: Start accepts. Automaton has 1796 states and 5177 transitions. Word has length 56 [2025-04-13 22:33:36,513 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:36,513 INFO L485 AbstractCegarLoop]: Abstraction has 1796 states and 5177 transitions. [2025-04-13 22:33:36,513 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:36,513 INFO L278 IsEmpty]: Start isEmpty. Operand 1796 states and 5177 transitions. [2025-04-13 22:33:36,514 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:36,514 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:36,514 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:36,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-13 22:33:36,715 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:36,715 INFO L403 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:36,715 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:36,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1485462148, now seen corresponding path program 96 times [2025-04-13 22:33:36,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:36,715 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811111308] [2025-04-13 22:33:36,715 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:33:36,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:36,720 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:36,724 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:36,724 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:33:36,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:36,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:36,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:36,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811111308] [2025-04-13 22:33:36,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811111308] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:36,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:36,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:33:36,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925957144] [2025-04-13 22:33:36,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:36,823 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:36,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:36,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:36,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:33:36,824 INFO L87 Difference]: Start difference. First operand 1796 states and 5177 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:37,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:37,297 INFO L93 Difference]: Finished difference Result 2045 states and 5869 transitions. [2025-04-13 22:33:37,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:33:37,298 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:37,298 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:37,304 INFO L225 Difference]: With dead ends: 2045 [2025-04-13 22:33:37,304 INFO L226 Difference]: Without dead ends: 1938 [2025-04-13 22:33:37,304 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=939, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:33:37,304 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 308 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:37,304 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 65 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:37,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2025-04-13 22:33:37,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1816. [2025-04-13 22:33:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1816 states, 1815 states have (on average 2.8798898071625345) internal successors, (5227), 1815 states have internal predecessors, (5227), 0 states have call successors, (0), 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:33:37,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 5227 transitions. [2025-04-13 22:33:37,323 INFO L79 Accepts]: Start accepts. Automaton has 1816 states and 5227 transitions. Word has length 56 [2025-04-13 22:33:37,323 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:37,323 INFO L485 AbstractCegarLoop]: Abstraction has 1816 states and 5227 transitions. [2025-04-13 22:33:37,324 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:37,324 INFO L278 IsEmpty]: Start isEmpty. Operand 1816 states and 5227 transitions. [2025-04-13 22:33:37,325 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:37,325 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:37,325 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:37,325 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2025-04-13 22:33:37,325 INFO L403 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:37,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:37,326 INFO L85 PathProgramCache]: Analyzing trace with hash 563558214, now seen corresponding path program 97 times [2025-04-13 22:33:37,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:37,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804981022] [2025-04-13 22:33:37,326 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:33:37,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:37,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:33:37,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:37,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:37,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:38,092 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:33:38,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:38,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804981022] [2025-04-13 22:33:38,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804981022] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:38,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35870553] [2025-04-13 22:33:38,092 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:33:38,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:38,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:38,094 INFO L229 MonitoredProcess]: Starting monitored process 33 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:33:38,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-13 22:33:38,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:33:38,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:38,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:38,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:38,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:33:38,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:38,360 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:33:38,360 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:33:38,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:33:38,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:38,536 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:33:38,536 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:33:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:38,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35870553] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:38,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:33:38,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 32 [2025-04-13 22:33:38,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905182333] [2025-04-13 22:33:38,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:38,561 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:38,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:38,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:38,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:33:38,561 INFO L87 Difference]: Start difference. First operand 1816 states and 5227 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:39,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:39,251 INFO L93 Difference]: Finished difference Result 2029 states and 5812 transitions. [2025-04-13 22:33:39,253 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:33:39,253 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:39,253 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:39,259 INFO L225 Difference]: With dead ends: 2029 [2025-04-13 22:33:39,259 INFO L226 Difference]: Without dead ends: 1964 [2025-04-13 22:33:39,260 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=228, Invalid=2528, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:33:39,260 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 194 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:39,260 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 62 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:33:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2025-04-13 22:33:39,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1826. [2025-04-13 22:33:39,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1826 states, 1825 states have (on average 2.875068493150685) internal successors, (5247), 1825 states have internal predecessors, (5247), 0 states have call successors, (0), 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:33:39,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 5247 transitions. [2025-04-13 22:33:39,280 INFO L79 Accepts]: Start accepts. Automaton has 1826 states and 5247 transitions. Word has length 56 [2025-04-13 22:33:39,280 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:39,280 INFO L485 AbstractCegarLoop]: Abstraction has 1826 states and 5247 transitions. [2025-04-13 22:33:39,280 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:39,280 INFO L278 IsEmpty]: Start isEmpty. Operand 1826 states and 5247 transitions. [2025-04-13 22:33:39,282 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:39,282 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:39,282 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:39,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-04-13 22:33:39,482 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:39,482 INFO L403 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:39,483 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:39,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1600627896, now seen corresponding path program 98 times [2025-04-13 22:33:39,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:39,483 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104183386] [2025-04-13 22:33:39,483 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:33:39,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:39,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:39,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:39,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:33:39,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:39,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:39,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104183386] [2025-04-13 22:33:39,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104183386] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:39,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:39,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:33:39,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119117281] [2025-04-13 22:33:39,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:39,591 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:39,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:39,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:39,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:33:39,591 INFO L87 Difference]: Start difference. First operand 1826 states and 5247 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:40,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:40,041 INFO L93 Difference]: Finished difference Result 2022 states and 5788 transitions. [2025-04-13 22:33:40,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:33:40,042 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:40,042 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:40,048 INFO L225 Difference]: With dead ends: 2022 [2025-04-13 22:33:40,048 INFO L226 Difference]: Without dead ends: 1953 [2025-04-13 22:33:40,049 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=886, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:33:40,049 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 203 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:40,049 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 64 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:40,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2025-04-13 22:33:40,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1816. [2025-04-13 22:33:40,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1816 states, 1815 states have (on average 2.8771349862258955) internal successors, (5222), 1815 states have internal predecessors, (5222), 0 states have call successors, (0), 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:33:40,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 5222 transitions. [2025-04-13 22:33:40,068 INFO L79 Accepts]: Start accepts. Automaton has 1816 states and 5222 transitions. Word has length 56 [2025-04-13 22:33:40,068 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:40,068 INFO L485 AbstractCegarLoop]: Abstraction has 1816 states and 5222 transitions. [2025-04-13 22:33:40,068 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:40,068 INFO L278 IsEmpty]: Start isEmpty. Operand 1816 states and 5222 transitions. [2025-04-13 22:33:40,070 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:40,070 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:40,070 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:40,070 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2025-04-13 22:33:40,070 INFO L403 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:40,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:40,070 INFO L85 PathProgramCache]: Analyzing trace with hash -765139206, now seen corresponding path program 99 times [2025-04-13 22:33:40,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:40,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157133752] [2025-04-13 22:33:40,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:33:40,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:40,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:40,079 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:40,079 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:33:40,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:40,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:40,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:40,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157133752] [2025-04-13 22:33:40,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157133752] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:40,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:40,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:33:40,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694974277] [2025-04-13 22:33:40,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:40,173 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:40,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:40,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:40,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:33:40,174 INFO L87 Difference]: Start difference. First operand 1816 states and 5222 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:40,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:40,664 INFO L93 Difference]: Finished difference Result 2024 states and 5797 transitions. [2025-04-13 22:33:40,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:33:40,664 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:40,664 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:40,671 INFO L225 Difference]: With dead ends: 2024 [2025-04-13 22:33:40,671 INFO L226 Difference]: Without dead ends: 1949 [2025-04-13 22:33:40,671 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:33:40,671 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 254 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:40,672 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 88 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:33:40,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2025-04-13 22:33:40,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1806. [2025-04-13 22:33:40,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1805 states have (on average 2.879224376731302) internal successors, (5197), 1805 states have internal predecessors, (5197), 0 states have call successors, (0), 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:33:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 5197 transitions. [2025-04-13 22:33:40,691 INFO L79 Accepts]: Start accepts. Automaton has 1806 states and 5197 transitions. Word has length 56 [2025-04-13 22:33:40,691 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:40,691 INFO L485 AbstractCegarLoop]: Abstraction has 1806 states and 5197 transitions. [2025-04-13 22:33:40,691 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:40,691 INFO L278 IsEmpty]: Start isEmpty. Operand 1806 states and 5197 transitions. [2025-04-13 22:33:40,693 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:40,693 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:40,693 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:40,693 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2025-04-13 22:33:40,693 INFO L403 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:40,693 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:40,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1576042266, now seen corresponding path program 100 times [2025-04-13 22:33:40,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:40,693 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640775926] [2025-04-13 22:33:40,693 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:33:40,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:40,697 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:40,700 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:33:40,700 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:33:40,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:40,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:40,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:40,784 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640775926] [2025-04-13 22:33:40,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640775926] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:40,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:40,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:33:40,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900632810] [2025-04-13 22:33:40,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:40,784 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:40,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:40,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:40,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:33:40,784 INFO L87 Difference]: Start difference. First operand 1806 states and 5197 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:41,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:41,275 INFO L93 Difference]: Finished difference Result 2024 states and 5802 transitions. [2025-04-13 22:33:41,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:33:41,276 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:41,276 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:41,282 INFO L225 Difference]: With dead ends: 2024 [2025-04-13 22:33:41,282 INFO L226 Difference]: Without dead ends: 1959 [2025-04-13 22:33:41,283 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=1079, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:33:41,283 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 247 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:41,283 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 80 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:41,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2025-04-13 22:33:41,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1816. [2025-04-13 22:33:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1816 states, 1815 states have (on average 2.8771349862258955) internal successors, (5222), 1815 states have internal predecessors, (5222), 0 states have call successors, (0), 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:33:41,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 5222 transitions. [2025-04-13 22:33:41,302 INFO L79 Accepts]: Start accepts. Automaton has 1816 states and 5222 transitions. Word has length 56 [2025-04-13 22:33:41,302 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:41,302 INFO L485 AbstractCegarLoop]: Abstraction has 1816 states and 5222 transitions. [2025-04-13 22:33:41,302 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:41,302 INFO L278 IsEmpty]: Start isEmpty. Operand 1816 states and 5222 transitions. [2025-04-13 22:33:41,304 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:41,304 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:41,304 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:41,304 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2025-04-13 22:33:41,304 INFO L403 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:41,304 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:41,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1521262470, now seen corresponding path program 101 times [2025-04-13 22:33:41,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:41,304 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436929667] [2025-04-13 22:33:41,304 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:33:41,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:41,309 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:41,315 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:41,315 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:41,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:41,933 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:33:41,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:41,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436929667] [2025-04-13 22:33:41,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436929667] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:41,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342884618] [2025-04-13 22:33:41,933 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:33:41,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:41,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:41,935 INFO L229 MonitoredProcess]: Starting monitored process 34 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:33:41,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-13 22:33:41,997 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:42,015 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:42,015 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:42,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:42,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 22:33:42,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:42,180 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:33:42,180 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:33:42,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:33:42,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:42,332 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:33:42,332 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:33:42,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:42,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342884618] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:42,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:33:42,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 22:33:42,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524562378] [2025-04-13 22:33:42,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:42,355 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:42,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:42,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:42,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=854, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:33:42,356 INFO L87 Difference]: Start difference. First operand 1816 states and 5222 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:43,107 INFO L93 Difference]: Finished difference Result 2013 states and 5765 transitions. [2025-04-13 22:33:43,107 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:33:43,107 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:43,107 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:43,114 INFO L225 Difference]: With dead ends: 2013 [2025-04-13 22:33:43,114 INFO L226 Difference]: Without dead ends: 1954 [2025-04-13 22:33:43,114 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=2545, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:33:43,114 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 220 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:43,114 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 71 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:33:43,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2025-04-13 22:33:43,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1811. [2025-04-13 22:33:43,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1810 states have (on average 2.8767955801104974) internal successors, (5207), 1810 states have internal predecessors, (5207), 0 states have call successors, (0), 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:33:43,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 5207 transitions. [2025-04-13 22:33:43,134 INFO L79 Accepts]: Start accepts. Automaton has 1811 states and 5207 transitions. Word has length 56 [2025-04-13 22:33:43,134 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:43,134 INFO L485 AbstractCegarLoop]: Abstraction has 1811 states and 5207 transitions. [2025-04-13 22:33:43,134 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:43,134 INFO L278 IsEmpty]: Start isEmpty. Operand 1811 states and 5207 transitions. [2025-04-13 22:33:43,135 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:43,135 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:43,136 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:43,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-04-13 22:33:43,336 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101 [2025-04-13 22:33:43,336 INFO L403 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:43,336 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:43,337 INFO L85 PathProgramCache]: Analyzing trace with hash 224380774, now seen corresponding path program 102 times [2025-04-13 22:33:43,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:43,337 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762210170] [2025-04-13 22:33:43,337 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:33:43,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:43,341 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:43,346 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:43,347 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:33:43,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:43,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:43,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:43,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762210170] [2025-04-13 22:33:43,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762210170] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:43,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:43,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:33:43,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924807996] [2025-04-13 22:33:43,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:43,443 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:43,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:43,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:43,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:33:43,443 INFO L87 Difference]: Start difference. First operand 1811 states and 5207 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:43,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:43,917 INFO L93 Difference]: Finished difference Result 1987 states and 5688 transitions. [2025-04-13 22:33:43,918 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:33:43,918 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:43,918 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:43,924 INFO L225 Difference]: With dead ends: 1987 [2025-04-13 22:33:43,924 INFO L226 Difference]: Without dead ends: 1848 [2025-04-13 22:33:43,924 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=1020, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:33:43,924 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 222 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:43,924 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 78 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:43,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2025-04-13 22:33:43,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1736. [2025-04-13 22:33:43,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1736 states, 1735 states have (on average 2.9037463976945244) internal successors, (5038), 1735 states have internal predecessors, (5038), 0 states have call successors, (0), 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:33:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 5038 transitions. [2025-04-13 22:33:43,943 INFO L79 Accepts]: Start accepts. Automaton has 1736 states and 5038 transitions. Word has length 56 [2025-04-13 22:33:43,943 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:43,943 INFO L485 AbstractCegarLoop]: Abstraction has 1736 states and 5038 transitions. [2025-04-13 22:33:43,943 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:43,943 INFO L278 IsEmpty]: Start isEmpty. Operand 1736 states and 5038 transitions. [2025-04-13 22:33:43,945 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:43,945 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:43,945 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:43,945 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2025-04-13 22:33:43,945 INFO L403 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:43,945 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:43,945 INFO L85 PathProgramCache]: Analyzing trace with hash 710005222, now seen corresponding path program 103 times [2025-04-13 22:33:43,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:43,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933400130] [2025-04-13 22:33:43,945 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:33:43,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:43,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:33:43,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:43,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:43,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:44,917 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:33:44,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:44,918 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933400130] [2025-04-13 22:33:44,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933400130] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:44,918 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050187465] [2025-04-13 22:33:44,918 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:33:44,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:44,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:44,919 INFO L229 MonitoredProcess]: Starting monitored process 35 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:33:44,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-13 22:33:44,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:33:45,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:45,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:45,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:45,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:33:45,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:45,208 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:33:45,208 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:33:45,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:33:45,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:45,408 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:33:45,408 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:33:45,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:45,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050187465] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:45,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:33:45,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 34 [2025-04-13 22:33:45,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057365320] [2025-04-13 22:33:45,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:45,437 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:45,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:45,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:45,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1100, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:33:45,437 INFO L87 Difference]: Start difference. First operand 1736 states and 5038 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:46,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:46,133 INFO L93 Difference]: Finished difference Result 2193 states and 6326 transitions. [2025-04-13 22:33:46,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:33:46,133 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:46,133 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:46,139 INFO L225 Difference]: With dead ends: 2193 [2025-04-13 22:33:46,139 INFO L226 Difference]: Without dead ends: 2029 [2025-04-13 22:33:46,140 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=215, Invalid=2541, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:33:46,140 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 286 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:46,140 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 81 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:33:46,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2025-04-13 22:33:46,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1856. [2025-04-13 22:33:46,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1855 states have (on average 2.892722371967655) internal successors, (5366), 1855 states have internal predecessors, (5366), 0 states have call successors, (0), 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:33:46,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 5366 transitions. [2025-04-13 22:33:46,160 INFO L79 Accepts]: Start accepts. Automaton has 1856 states and 5366 transitions. Word has length 56 [2025-04-13 22:33:46,160 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:46,160 INFO L485 AbstractCegarLoop]: Abstraction has 1856 states and 5366 transitions. [2025-04-13 22:33:46,160 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:46,160 INFO L278 IsEmpty]: Start isEmpty. Operand 1856 states and 5366 transitions. [2025-04-13 22:33:46,162 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:46,162 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:46,162 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:46,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2025-04-13 22:33:46,362 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2025-04-13 22:33:46,362 INFO L403 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:46,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:46,363 INFO L85 PathProgramCache]: Analyzing trace with hash -974319044, now seen corresponding path program 104 times [2025-04-13 22:33:46,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:46,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746993243] [2025-04-13 22:33:46,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:33:46,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:46,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:46,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:46,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:33:46,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:46,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:46,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:46,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746993243] [2025-04-13 22:33:46,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746993243] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:46,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:46,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:33:46,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362453830] [2025-04-13 22:33:46,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:46,463 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:33:46,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:46,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:33:46,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:33:46,463 INFO L87 Difference]: Start difference. First operand 1856 states and 5366 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:46,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:46,913 INFO L93 Difference]: Finished difference Result 2125 states and 6118 transitions. [2025-04-13 22:33:46,913 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:33:46,913 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:46,913 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:46,920 INFO L225 Difference]: With dead ends: 2125 [2025-04-13 22:33:46,920 INFO L226 Difference]: Without dead ends: 2060 [2025-04-13 22:33:46,920 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:33:46,920 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 256 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:46,920 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 76 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:46,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2025-04-13 22:33:46,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 1866. [2025-04-13 22:33:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1865 states have (on average 2.8906166219839142) internal successors, (5391), 1865 states have internal predecessors, (5391), 0 states have call successors, (0), 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:33:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 5391 transitions. [2025-04-13 22:33:46,940 INFO L79 Accepts]: Start accepts. Automaton has 1866 states and 5391 transitions. Word has length 56 [2025-04-13 22:33:46,940 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:46,940 INFO L485 AbstractCegarLoop]: Abstraction has 1866 states and 5391 transitions. [2025-04-13 22:33:46,940 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:46,940 INFO L278 IsEmpty]: Start isEmpty. Operand 1866 states and 5391 transitions. [2025-04-13 22:33:46,941 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:46,942 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:46,942 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:46,942 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2025-04-13 22:33:46,942 INFO L403 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:46,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:46,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1590723496, now seen corresponding path program 105 times [2025-04-13 22:33:46,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:46,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101888217] [2025-04-13 22:33:46,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:33:46,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:46,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:46,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:46,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:33:46,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:47,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:47,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:47,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101888217] [2025-04-13 22:33:47,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101888217] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:47,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:47,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:33:47,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439987429] [2025-04-13 22:33:47,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:47,053 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:33:47,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:47,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:33:47,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:33:47,054 INFO L87 Difference]: Start difference. First operand 1866 states and 5391 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:47,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:47,543 INFO L93 Difference]: Finished difference Result 2114 states and 6081 transitions. [2025-04-13 22:33:47,543 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:33:47,543 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:47,544 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:47,551 INFO L225 Difference]: With dead ends: 2114 [2025-04-13 22:33:47,551 INFO L226 Difference]: Without dead ends: 2055 [2025-04-13 22:33:47,552 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:33:47,552 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 225 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:47,552 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 74 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:33:47,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2025-04-13 22:33:47,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 1861. [2025-04-13 22:33:47,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1861 states, 1860 states have (on average 2.890322580645161) internal successors, (5376), 1860 states have internal predecessors, (5376), 0 states have call successors, (0), 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:33:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1861 states to 1861 states and 5376 transitions. [2025-04-13 22:33:47,574 INFO L79 Accepts]: Start accepts. Automaton has 1861 states and 5376 transitions. Word has length 56 [2025-04-13 22:33:47,574 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:47,574 INFO L485 AbstractCegarLoop]: Abstraction has 1861 states and 5376 transitions. [2025-04-13 22:33:47,575 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:47,575 INFO L278 IsEmpty]: Start isEmpty. Operand 1861 states and 5376 transitions. [2025-04-13 22:33:47,576 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:47,576 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:47,576 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:47,576 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2025-04-13 22:33:47,577 INFO L403 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:47,577 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:47,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1968986760, now seen corresponding path program 106 times [2025-04-13 22:33:47,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:47,577 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817698008] [2025-04-13 22:33:47,577 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:33:47,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:47,581 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:47,584 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:33:47,584 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:33:47,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:47,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:47,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:47,651 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817698008] [2025-04-13 22:33:47,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817698008] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:47,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:47,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:33:47,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090993051] [2025-04-13 22:33:47,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:47,652 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:33:47,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:47,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:33:47,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:33:47,652 INFO L87 Difference]: Start difference. First operand 1861 states and 5376 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:48,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:48,091 INFO L93 Difference]: Finished difference Result 2088 states and 6004 transitions. [2025-04-13 22:33:48,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:33:48,091 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:48,092 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:48,099 INFO L225 Difference]: With dead ends: 2088 [2025-04-13 22:33:48,099 INFO L226 Difference]: Without dead ends: 1969 [2025-04-13 22:33:48,099 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:33:48,100 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 210 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:48,100 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 74 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:48,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2025-04-13 22:33:48,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1806. [2025-04-13 22:33:48,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1805 states have (on average 2.886426592797784) internal successors, (5210), 1805 states have internal predecessors, (5210), 0 states have call successors, (0), 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:33:48,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 5210 transitions. [2025-04-13 22:33:48,122 INFO L79 Accepts]: Start accepts. Automaton has 1806 states and 5210 transitions. Word has length 56 [2025-04-13 22:33:48,122 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:48,122 INFO L485 AbstractCegarLoop]: Abstraction has 1806 states and 5210 transitions. [2025-04-13 22:33:48,122 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:48,122 INFO L278 IsEmpty]: Start isEmpty. Operand 1806 states and 5210 transitions. [2025-04-13 22:33:48,123 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:48,124 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:48,124 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:48,124 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2025-04-13 22:33:48,124 INFO L403 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:48,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:48,124 INFO L85 PathProgramCache]: Analyzing trace with hash 261701162, now seen corresponding path program 107 times [2025-04-13 22:33:48,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:48,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779703327] [2025-04-13 22:33:48,124 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:33:48,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:48,128 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:48,136 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:48,136 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:48,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:48,951 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:33:48,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:48,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779703327] [2025-04-13 22:33:48,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779703327] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:48,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477940495] [2025-04-13 22:33:48,951 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:33:48,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:48,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:48,953 INFO L229 MonitoredProcess]: Starting monitored process 36 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:33:48,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-13 22:33:49,019 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:49,037 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:49,037 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:49,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:49,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:33:49,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:49,230 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:33:49,230 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:33:49,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:33:49,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:49,407 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:33:49,407 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:33:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:49,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477940495] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:49,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:33:49,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 32 [2025-04-13 22:33:49,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082333273] [2025-04-13 22:33:49,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:49,433 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:49,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:49,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:49,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=973, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:33:49,433 INFO L87 Difference]: Start difference. First operand 1806 states and 5210 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:50,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:50,347 INFO L93 Difference]: Finished difference Result 2014 states and 5785 transitions. [2025-04-13 22:33:50,347 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:33:50,347 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:50,347 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:50,354 INFO L225 Difference]: With dead ends: 2014 [2025-04-13 22:33:50,354 INFO L226 Difference]: Without dead ends: 1928 [2025-04-13 22:33:50,355 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=274, Invalid=3148, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 22:33:50,355 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 304 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1516 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:50,355 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 95 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1516 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:33:50,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2025-04-13 22:33:50,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1816. [2025-04-13 22:33:50,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1816 states, 1815 states have (on average 2.884297520661157) internal successors, (5235), 1815 states have internal predecessors, (5235), 0 states have call successors, (0), 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:33:50,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 5235 transitions. [2025-04-13 22:33:50,375 INFO L79 Accepts]: Start accepts. Automaton has 1816 states and 5235 transitions. Word has length 56 [2025-04-13 22:33:50,375 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:50,375 INFO L485 AbstractCegarLoop]: Abstraction has 1816 states and 5235 transitions. [2025-04-13 22:33:50,375 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:50,375 INFO L278 IsEmpty]: Start isEmpty. Operand 1816 states and 5235 transitions. [2025-04-13 22:33:50,377 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:50,377 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:50,377 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:50,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-04-13 22:33:50,577 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2025-04-13 22:33:50,578 INFO L403 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:50,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:50,578 INFO L85 PathProgramCache]: Analyzing trace with hash -667786514, now seen corresponding path program 108 times [2025-04-13 22:33:50,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:50,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374079865] [2025-04-13 22:33:50,578 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:33:50,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:50,582 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:50,586 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:50,586 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:33:50,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:50,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:50,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:50,675 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374079865] [2025-04-13 22:33:50,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374079865] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:50,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:50,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:33:50,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607749481] [2025-04-13 22:33:50,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:50,675 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:33:50,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:50,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:33:50,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:33:50,675 INFO L87 Difference]: Start difference. First operand 1816 states and 5235 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:51,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:51,172 INFO L93 Difference]: Finished difference Result 2024 states and 5810 transitions. [2025-04-13 22:33:51,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 22:33:51,172 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:51,172 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:51,179 INFO L225 Difference]: With dead ends: 2024 [2025-04-13 22:33:51,179 INFO L226 Difference]: Without dead ends: 1959 [2025-04-13 22:33:51,179 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:33:51,179 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 227 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:51,179 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 86 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:51,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2025-04-13 22:33:51,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1821. [2025-04-13 22:33:51,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1820 states have (on average 2.881868131868132) internal successors, (5245), 1820 states have internal predecessors, (5245), 0 states have call successors, (0), 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:33:51,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 5245 transitions. [2025-04-13 22:33:51,199 INFO L79 Accepts]: Start accepts. Automaton has 1821 states and 5245 transitions. Word has length 56 [2025-04-13 22:33:51,199 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:51,199 INFO L485 AbstractCegarLoop]: Abstraction has 1821 states and 5245 transitions. [2025-04-13 22:33:51,199 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:51,199 INFO L278 IsEmpty]: Start isEmpty. Operand 1821 states and 5245 transitions. [2025-04-13 22:33:51,201 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:51,201 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:51,201 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:51,201 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2025-04-13 22:33:51,201 INFO L403 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:51,201 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:51,201 INFO L85 PathProgramCache]: Analyzing trace with hash -246176052, now seen corresponding path program 109 times [2025-04-13 22:33:51,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:51,202 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231110649] [2025-04-13 22:33:51,202 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:33:51,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:51,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:33:51,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:51,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:51,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:51,971 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:33:51,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:51,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231110649] [2025-04-13 22:33:51,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231110649] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:51,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988523674] [2025-04-13 22:33:51,971 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:33:51,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:51,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:51,973 INFO L229 MonitoredProcess]: Starting monitored process 37 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:33:51,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-04-13 22:33:52,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:33:52,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:52,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:52,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:52,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:33:52,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:52,223 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:33:52,223 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:33:52,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:33:52,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:52,413 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:33:52,414 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:33:52,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:52,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988523674] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:52,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:33:52,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 33 [2025-04-13 22:33:52,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049167931] [2025-04-13 22:33:52,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:52,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:52,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:52,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:52,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:33:52,438 INFO L87 Difference]: Start difference. First operand 1821 states and 5245 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:53,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:53,257 INFO L93 Difference]: Finished difference Result 1987 states and 5701 transitions. [2025-04-13 22:33:53,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:33:53,257 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:53,257 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:53,263 INFO L225 Difference]: With dead ends: 1987 [2025-04-13 22:33:53,264 INFO L226 Difference]: Without dead ends: 1923 [2025-04-13 22:33:53,264 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=275, Invalid=3031, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 22:33:53,264 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 219 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:53,265 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 87 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:33:53,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2025-04-13 22:33:53,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1811. [2025-04-13 22:33:53,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1810 states have (on average 2.883977900552486) internal successors, (5220), 1810 states have internal predecessors, (5220), 0 states have call successors, (0), 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:33:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 5220 transitions. [2025-04-13 22:33:53,296 INFO L79 Accepts]: Start accepts. Automaton has 1811 states and 5220 transitions. Word has length 56 [2025-04-13 22:33:53,296 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:53,296 INFO L485 AbstractCegarLoop]: Abstraction has 1811 states and 5220 transitions. [2025-04-13 22:33:53,296 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:53,296 INFO L278 IsEmpty]: Start isEmpty. Operand 1811 states and 5220 transitions. [2025-04-13 22:33:53,298 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:53,298 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:53,298 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:53,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2025-04-13 22:33:53,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:53,499 INFO L403 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:53,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:53,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2142091456, now seen corresponding path program 110 times [2025-04-13 22:33:53,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:53,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076952233] [2025-04-13 22:33:53,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:33:53,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:53,503 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:53,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:53,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:33:53,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:53,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:53,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:53,612 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076952233] [2025-04-13 22:33:53,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076952233] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:53,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:53,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:33:53,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321912311] [2025-04-13 22:33:53,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:53,612 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:33:53,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:53,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:33:53,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:33:53,612 INFO L87 Difference]: Start difference. First operand 1811 states and 5220 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:54,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:54,128 INFO L93 Difference]: Finished difference Result 2029 states and 5825 transitions. [2025-04-13 22:33:54,128 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:33:54,128 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:54,128 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:54,135 INFO L225 Difference]: With dead ends: 2029 [2025-04-13 22:33:54,136 INFO L226 Difference]: Without dead ends: 1964 [2025-04-13 22:33:54,136 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=1002, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:33:54,136 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 212 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:54,136 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 79 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:33:54,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2025-04-13 22:33:54,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1821. [2025-04-13 22:33:54,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1820 states have (on average 2.881868131868132) internal successors, (5245), 1820 states have internal predecessors, (5245), 0 states have call successors, (0), 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:33:54,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 5245 transitions. [2025-04-13 22:33:54,159 INFO L79 Accepts]: Start accepts. Automaton has 1821 states and 5245 transitions. Word has length 56 [2025-04-13 22:33:54,159 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:54,159 INFO L485 AbstractCegarLoop]: Abstraction has 1821 states and 5245 transitions. [2025-04-13 22:33:54,160 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:54,160 INFO L278 IsEmpty]: Start isEmpty. Operand 1821 states and 5245 transitions. [2025-04-13 22:33:54,161 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:54,161 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:54,162 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:54,162 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2025-04-13 22:33:54,162 INFO L403 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:54,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:54,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1435660858, now seen corresponding path program 111 times [2025-04-13 22:33:54,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:54,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206982480] [2025-04-13 22:33:54,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:33:54,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:54,166 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:54,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:54,170 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:33:54,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:54,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:54,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206982480] [2025-04-13 22:33:54,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206982480] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:54,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:54,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:33:54,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460012536] [2025-04-13 22:33:54,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:54,260 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:33:54,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:54,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:33:54,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:33:54,261 INFO L87 Difference]: Start difference. First operand 1821 states and 5245 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:54,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:54,727 INFO L93 Difference]: Finished difference Result 2018 states and 5788 transitions. [2025-04-13 22:33:54,727 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:33:54,727 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:54,727 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:54,734 INFO L225 Difference]: With dead ends: 2018 [2025-04-13 22:33:54,734 INFO L226 Difference]: Without dead ends: 1959 [2025-04-13 22:33:54,734 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:33:54,735 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 179 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:54,735 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 78 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:54,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2025-04-13 22:33:54,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1816. [2025-04-13 22:33:54,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1816 states, 1815 states have (on average 2.881542699724518) internal successors, (5230), 1815 states have internal predecessors, (5230), 0 states have call successors, (0), 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:33:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 5230 transitions. [2025-04-13 22:33:54,754 INFO L79 Accepts]: Start accepts. Automaton has 1816 states and 5230 transitions. Word has length 56 [2025-04-13 22:33:54,754 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:54,754 INFO L485 AbstractCegarLoop]: Abstraction has 1816 states and 5230 transitions. [2025-04-13 22:33:54,754 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:54,754 INFO L278 IsEmpty]: Start isEmpty. Operand 1816 states and 5230 transitions. [2025-04-13 22:33:54,756 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:54,756 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:54,756 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:54,756 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2025-04-13 22:33:54,756 INFO L403 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:54,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:54,756 INFO L85 PathProgramCache]: Analyzing trace with hash 790429964, now seen corresponding path program 112 times [2025-04-13 22:33:54,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:54,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029043495] [2025-04-13 22:33:54,756 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:33:54,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:54,762 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:54,764 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:33:54,764 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:33:54,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:54,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:54,838 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029043495] [2025-04-13 22:33:54,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029043495] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:54,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:54,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:33:54,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112087690] [2025-04-13 22:33:54,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:54,838 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:33:54,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:54,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:33:54,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:33:54,838 INFO L87 Difference]: Start difference. First operand 1816 states and 5230 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:55,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:55,306 INFO L93 Difference]: Finished difference Result 1992 states and 5711 transitions. [2025-04-13 22:33:55,306 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:33:55,307 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:55,307 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:55,313 INFO L225 Difference]: With dead ends: 1992 [2025-04-13 22:33:55,313 INFO L226 Difference]: Without dead ends: 1868 [2025-04-13 22:33:55,314 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=169, Invalid=953, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:33:55,314 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 179 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:55,314 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 77 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:33:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2025-04-13 22:33:55,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1756. [2025-04-13 22:33:55,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1755 states have (on average 2.9025641025641025) internal successors, (5094), 1755 states have internal predecessors, (5094), 0 states have call successors, (0), 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:33:55,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 5094 transitions. [2025-04-13 22:33:55,333 INFO L79 Accepts]: Start accepts. Automaton has 1756 states and 5094 transitions. Word has length 56 [2025-04-13 22:33:55,333 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:55,333 INFO L485 AbstractCegarLoop]: Abstraction has 1756 states and 5094 transitions. [2025-04-13 22:33:55,333 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:55,333 INFO L278 IsEmpty]: Start isEmpty. Operand 1756 states and 5094 transitions. [2025-04-13 22:33:55,335 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:55,335 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:55,335 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:55,335 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2025-04-13 22:33:55,335 INFO L403 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:55,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:55,335 INFO L85 PathProgramCache]: Analyzing trace with hash -473919388, now seen corresponding path program 113 times [2025-04-13 22:33:55,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:55,335 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749674445] [2025-04-13 22:33:55,335 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:33:55,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:55,340 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:55,347 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:55,347 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:55,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:56,082 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:33:56,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:56,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749674445] [2025-04-13 22:33:56,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749674445] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:56,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487858151] [2025-04-13 22:33:56,082 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:33:56,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:56,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:56,084 INFO L229 MonitoredProcess]: Starting monitored process 38 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:33:56,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-04-13 22:33:56,151 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:56,169 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:56,169 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:33:56,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:56,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:33:56,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:56,362 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:33:56,362 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:33:56,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:56,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:33:56,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487858151] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:56,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:33:56,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 24 [2025-04-13 22:33:56,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760136624] [2025-04-13 22:33:56,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:56,367 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:56,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:56,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:56,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:33:56,368 INFO L87 Difference]: Start difference. First operand 1756 states and 5094 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:57,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:57,324 INFO L93 Difference]: Finished difference Result 2192 states and 6325 transitions. [2025-04-13 22:33:57,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:33:57,324 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:57,324 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:57,331 INFO L225 Difference]: With dead ends: 2192 [2025-04-13 22:33:57,331 INFO L226 Difference]: Without dead ends: 2028 [2025-04-13 22:33:57,332 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=1725, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:33:57,332 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 234 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:57,332 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 93 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:33:57,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2025-04-13 22:33:57,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 1816. [2025-04-13 22:33:57,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1816 states, 1815 states have (on average 2.8831955922865014) internal successors, (5233), 1815 states have internal predecessors, (5233), 0 states have call successors, (0), 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:33:57,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 5233 transitions. [2025-04-13 22:33:57,353 INFO L79 Accepts]: Start accepts. Automaton has 1816 states and 5233 transitions. Word has length 56 [2025-04-13 22:33:57,353 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:57,353 INFO L485 AbstractCegarLoop]: Abstraction has 1816 states and 5233 transitions. [2025-04-13 22:33:57,353 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:57,353 INFO L278 IsEmpty]: Start isEmpty. Operand 1816 states and 5233 transitions. [2025-04-13 22:33:57,355 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:57,355 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:57,355 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:57,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-04-13 22:33:57,555 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2025-04-13 22:33:57,555 INFO L403 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:57,555 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:57,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1619889150, now seen corresponding path program 114 times [2025-04-13 22:33:57,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:57,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248566701] [2025-04-13 22:33:57,556 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:33:57,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:57,560 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:33:57,564 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:33:57,564 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:33:57,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:57,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:57,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:57,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248566701] [2025-04-13 22:33:57,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248566701] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:33:57,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:33:57,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:33:57,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070087513] [2025-04-13 22:33:57,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:57,675 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:57,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:57,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:57,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:33:57,675 INFO L87 Difference]: Start difference. First operand 1816 states and 5233 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:58,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:33:58,218 INFO L93 Difference]: Finished difference Result 2094 states and 6027 transitions. [2025-04-13 22:33:58,219 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:33:58,219 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:33:58,219 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:33:58,226 INFO L225 Difference]: With dead ends: 2094 [2025-04-13 22:33:58,226 INFO L226 Difference]: Without dead ends: 2029 [2025-04-13 22:33:58,227 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:33:58,227 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 243 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:58,227 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 90 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:33:58,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2025-04-13 22:33:58,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1826. [2025-04-13 22:33:58,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1826 states, 1825 states have (on average 2.881095890410959) internal successors, (5258), 1825 states have internal predecessors, (5258), 0 states have call successors, (0), 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:33:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 5258 transitions. [2025-04-13 22:33:58,247 INFO L79 Accepts]: Start accepts. Automaton has 1826 states and 5258 transitions. Word has length 56 [2025-04-13 22:33:58,247 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:33:58,247 INFO L485 AbstractCegarLoop]: Abstraction has 1826 states and 5258 transitions. [2025-04-13 22:33:58,247 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:58,247 INFO L278 IsEmpty]: Start isEmpty. Operand 1826 states and 5258 transitions. [2025-04-13 22:33:58,249 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:33:58,249 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:33:58,249 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:33:58,249 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2025-04-13 22:33:58,249 INFO L403 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:33:58,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:33:58,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1520319190, now seen corresponding path program 115 times [2025-04-13 22:33:58,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:33:58,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643399455] [2025-04-13 22:33:58,250 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:33:58,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:33:58,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:33:58,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:58,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:58,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:58,941 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:33:58,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:33:58,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643399455] [2025-04-13 22:33:58,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643399455] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:58,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475180584] [2025-04-13 22:33:58,941 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:33:58,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:33:58,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:33:58,943 INFO L229 MonitoredProcess]: Starting monitored process 39 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:33:58,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-04-13 22:33:59,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:33:59,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:33:59,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:33:59,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:33:59,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:33:59,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:33:59,220 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:33:59,220 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:33:59,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:33:59,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:33:59,378 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:33:59,378 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:33:59,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:33:59,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475180584] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:33:59,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:33:59,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 22:33:59,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929665567] [2025-04-13 22:33:59,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:33:59,402 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:33:59,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:59,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:33:59,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:33:59,403 INFO L87 Difference]: Start difference. First operand 1826 states and 5258 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:00,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:00,078 INFO L93 Difference]: Finished difference Result 2083 states and 5990 transitions. [2025-04-13 22:34:00,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:34:00,079 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:00,079 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:00,086 INFO L225 Difference]: With dead ends: 2083 [2025-04-13 22:34:00,086 INFO L226 Difference]: Without dead ends: 2024 [2025-04-13 22:34:00,086 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=182, Invalid=2170, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:34:00,086 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 200 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:00,086 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 84 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:00,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2025-04-13 22:34:00,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 1821. [2025-04-13 22:34:00,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1820 states have (on average 2.8807692307692307) internal successors, (5243), 1820 states have internal predecessors, (5243), 0 states have call successors, (0), 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:34:00,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 5243 transitions. [2025-04-13 22:34:00,107 INFO L79 Accepts]: Start accepts. Automaton has 1821 states and 5243 transitions. Word has length 56 [2025-04-13 22:34:00,107 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:00,107 INFO L485 AbstractCegarLoop]: Abstraction has 1821 states and 5243 transitions. [2025-04-13 22:34:00,107 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:00,107 INFO L278 IsEmpty]: Start isEmpty. Operand 1821 states and 5243 transitions. [2025-04-13 22:34:00,109 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:00,109 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:00,109 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:00,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-04-13 22:34:00,309 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable115 [2025-04-13 22:34:00,309 INFO L403 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:00,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:00,310 INFO L85 PathProgramCache]: Analyzing trace with hash 268227658, now seen corresponding path program 116 times [2025-04-13 22:34:00,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:00,310 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072494164] [2025-04-13 22:34:00,310 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:00,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:00,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:00,318 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:00,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:34:00,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:00,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:00,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:00,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072494164] [2025-04-13 22:34:00,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072494164] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:00,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:00,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:34:00,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771484722] [2025-04-13 22:34:00,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:00,428 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:00,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:00,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:00,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:00,429 INFO L87 Difference]: Start difference. First operand 1821 states and 5243 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:00,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:00,927 INFO L93 Difference]: Finished difference Result 2088 states and 6000 transitions. [2025-04-13 22:34:00,927 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:34:00,927 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:00,927 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:00,933 INFO L225 Difference]: With dead ends: 2088 [2025-04-13 22:34:00,934 INFO L226 Difference]: Without dead ends: 1969 [2025-04-13 22:34:00,934 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:34:00,934 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 207 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:00,934 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 88 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:00,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2025-04-13 22:34:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1766. [2025-04-13 22:34:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1765 states have (on average 2.8991501416430596) internal successors, (5117), 1765 states have internal predecessors, (5117), 0 states have call successors, (0), 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:34:00,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 5117 transitions. [2025-04-13 22:34:00,954 INFO L79 Accepts]: Start accepts. Automaton has 1766 states and 5117 transitions. Word has length 56 [2025-04-13 22:34:00,954 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:00,954 INFO L485 AbstractCegarLoop]: Abstraction has 1766 states and 5117 transitions. [2025-04-13 22:34:00,954 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:00,954 INFO L278 IsEmpty]: Start isEmpty. Operand 1766 states and 5117 transitions. [2025-04-13 22:34:00,955 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:00,955 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:00,956 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:00,956 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2025-04-13 22:34:00,956 INFO L403 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:00,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:00,956 INFO L85 PathProgramCache]: Analyzing trace with hash 727831014, now seen corresponding path program 117 times [2025-04-13 22:34:00,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:00,956 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928189626] [2025-04-13 22:34:00,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:34:00,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:00,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:00,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:00,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:34:00,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:01,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:01,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:01,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928189626] [2025-04-13 22:34:01,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928189626] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:01,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:01,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:34:01,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657912215] [2025-04-13 22:34:01,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:01,074 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:01,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:01,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:01,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:01,074 INFO L87 Difference]: Start difference. First operand 1766 states and 5117 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:01,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:01,532 INFO L93 Difference]: Finished difference Result 2062 states and 5916 transitions. [2025-04-13 22:34:01,532 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:34:01,532 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:01,532 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:01,539 INFO L225 Difference]: With dead ends: 2062 [2025-04-13 22:34:01,539 INFO L226 Difference]: Without dead ends: 1858 [2025-04-13 22:34:01,539 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:34:01,540 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 189 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:01,540 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 98 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:01,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2025-04-13 22:34:01,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1746. [2025-04-13 22:34:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1746 states, 1745 states have (on average 2.9002865329512892) internal successors, (5061), 1745 states have internal predecessors, (5061), 0 states have call successors, (0), 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:34:01,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 5061 transitions. [2025-04-13 22:34:01,558 INFO L79 Accepts]: Start accepts. Automaton has 1746 states and 5061 transitions. Word has length 56 [2025-04-13 22:34:01,558 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:01,558 INFO L485 AbstractCegarLoop]: Abstraction has 1746 states and 5061 transitions. [2025-04-13 22:34:01,558 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:01,558 INFO L278 IsEmpty]: Start isEmpty. Operand 1746 states and 5061 transitions. [2025-04-13 22:34:01,560 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:01,560 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:01,560 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:01,560 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2025-04-13 22:34:01,560 INFO L403 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:01,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:01,560 INFO L85 PathProgramCache]: Analyzing trace with hash 871612186, now seen corresponding path program 118 times [2025-04-13 22:34:01,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:01,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749338366] [2025-04-13 22:34:01,560 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:34:01,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:01,564 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:01,567 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:34:01,567 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:34:01,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:01,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:01,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749338366] [2025-04-13 22:34:01,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749338366] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:01,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:01,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:34:01,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812946285] [2025-04-13 22:34:01,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:01,642 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:01,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:01,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:01,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:01,642 INFO L87 Difference]: Start difference. First operand 1746 states and 5061 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:02,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:02,134 INFO L93 Difference]: Finished difference Result 2003 states and 5801 transitions. [2025-04-13 22:34:02,134 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:34:02,134 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:02,134 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:02,141 INFO L225 Difference]: With dead ends: 2003 [2025-04-13 22:34:02,141 INFO L226 Difference]: Without dead ends: 1938 [2025-04-13 22:34:02,142 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=827, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:34:02,142 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 262 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:02,142 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 85 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:34:02,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2025-04-13 22:34:02,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1826. [2025-04-13 22:34:02,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1826 states, 1825 states have (on average 2.9084931506849316) internal successors, (5308), 1825 states have internal predecessors, (5308), 0 states have call successors, (0), 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:34:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 5308 transitions. [2025-04-13 22:34:02,162 INFO L79 Accepts]: Start accepts. Automaton has 1826 states and 5308 transitions. Word has length 56 [2025-04-13 22:34:02,162 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:02,162 INFO L485 AbstractCegarLoop]: Abstraction has 1826 states and 5308 transitions. [2025-04-13 22:34:02,162 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:02,162 INFO L278 IsEmpty]: Start isEmpty. Operand 1826 states and 5308 transitions. [2025-04-13 22:34:02,164 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:02,164 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:02,164 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:02,164 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2025-04-13 22:34:02,164 INFO L403 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:02,164 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:02,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2099298504, now seen corresponding path program 119 times [2025-04-13 22:34:02,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:02,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940407581] [2025-04-13 22:34:02,165 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:02,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:02,169 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:02,176 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:02,176 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:02,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:02,941 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:34:02,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:02,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940407581] [2025-04-13 22:34:02,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940407581] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:02,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841287528] [2025-04-13 22:34:02,941 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:02,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:02,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:02,943 INFO L229 MonitoredProcess]: Starting monitored process 40 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:34:02,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-04-13 22:34:03,011 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:03,029 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:03,029 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:03,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:03,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:34:03,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:03,229 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:34:03,230 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:34:03,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:34:03,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:03,392 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:34:03,392 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:34:03,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:03,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841287528] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:03,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:34:03,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 31 [2025-04-13 22:34:03,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948900691] [2025-04-13 22:34:03,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:03,418 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:03,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:03,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:03,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:34:03,418 INFO L87 Difference]: Start difference. First operand 1826 states and 5308 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:04,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:04,152 INFO L93 Difference]: Finished difference Result 2122 states and 6101 transitions. [2025-04-13 22:34:04,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:34:04,153 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:04,153 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:04,160 INFO L225 Difference]: With dead ends: 2122 [2025-04-13 22:34:04,160 INFO L226 Difference]: Without dead ends: 1958 [2025-04-13 22:34:04,161 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=2447, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:34:04,161 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 259 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:04,161 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 92 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:04,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2025-04-13 22:34:04,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1826. [2025-04-13 22:34:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1826 states, 1825 states have (on average 2.881095890410959) internal successors, (5258), 1825 states have internal predecessors, (5258), 0 states have call successors, (0), 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:34:04,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 5258 transitions. [2025-04-13 22:34:04,181 INFO L79 Accepts]: Start accepts. Automaton has 1826 states and 5258 transitions. Word has length 56 [2025-04-13 22:34:04,181 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:04,181 INFO L485 AbstractCegarLoop]: Abstraction has 1826 states and 5258 transitions. [2025-04-13 22:34:04,181 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:04,181 INFO L278 IsEmpty]: Start isEmpty. Operand 1826 states and 5258 transitions. [2025-04-13 22:34:04,183 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:04,183 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:04,183 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:04,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2025-04-13 22:34:04,383 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:04,383 INFO L403 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:04,384 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:04,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1395130794, now seen corresponding path program 120 times [2025-04-13 22:34:04,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:04,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851706447] [2025-04-13 22:34:04,384 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:34:04,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:04,388 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:04,392 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:04,392 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:34:04,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:04,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:04,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851706447] [2025-04-13 22:34:04,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851706447] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:04,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:04,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:34:04,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490491179] [2025-04-13 22:34:04,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:04,493 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:04,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:04,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:04,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:04,493 INFO L87 Difference]: Start difference. First operand 1826 states and 5258 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:04,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:04,978 INFO L93 Difference]: Finished difference Result 1992 states and 5714 transitions. [2025-04-13 22:34:04,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:34:04,979 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:04,979 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:04,986 INFO L225 Difference]: With dead ends: 1992 [2025-04-13 22:34:04,986 INFO L226 Difference]: Without dead ends: 1933 [2025-04-13 22:34:04,987 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:34:04,987 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 215 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:04,987 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 83 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:34:04,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2025-04-13 22:34:04,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1821. [2025-04-13 22:34:05,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1820 states have (on average 2.8807692307692307) internal successors, (5243), 1820 states have internal predecessors, (5243), 0 states have call successors, (0), 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:34:05,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 5243 transitions. [2025-04-13 22:34:05,013 INFO L79 Accepts]: Start accepts. Automaton has 1821 states and 5243 transitions. Word has length 56 [2025-04-13 22:34:05,013 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:05,013 INFO L485 AbstractCegarLoop]: Abstraction has 1821 states and 5243 transitions. [2025-04-13 22:34:05,013 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:05,013 INFO L278 IsEmpty]: Start isEmpty. Operand 1821 states and 5243 transitions. [2025-04-13 22:34:05,015 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:05,015 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:05,015 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:05,015 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2025-04-13 22:34:05,015 INFO L403 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:05,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:05,016 INFO L85 PathProgramCache]: Analyzing trace with hash -198804438, now seen corresponding path program 121 times [2025-04-13 22:34:05,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:05,016 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085621835] [2025-04-13 22:34:05,016 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:34:05,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:05,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:34:05,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:05,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:05,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:05,754 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:34:05,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:05,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085621835] [2025-04-13 22:34:05,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085621835] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:05,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515070854] [2025-04-13 22:34:05,754 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:34:05,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:05,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:05,756 INFO L229 MonitoredProcess]: Starting monitored process 41 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:34:05,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-04-13 22:34:05,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:34:05,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:05,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:05,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:05,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:34:05,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:06,050 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:34:06,051 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:34:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:34:06,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:06,219 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:34:06,219 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:34:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:06,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515070854] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:06,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:34:06,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 31 [2025-04-13 22:34:06,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302753988] [2025-04-13 22:34:06,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:06,246 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:06,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:06,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:06,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:34:06,246 INFO L87 Difference]: Start difference. First operand 1821 states and 5243 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:06,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:06,957 INFO L93 Difference]: Finished difference Result 1997 states and 5724 transitions. [2025-04-13 22:34:06,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:34:06,957 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:06,958 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:06,964 INFO L225 Difference]: With dead ends: 1997 [2025-04-13 22:34:06,964 INFO L226 Difference]: Without dead ends: 1878 [2025-04-13 22:34:06,964 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=2442, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:34:06,965 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 210 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:06,965 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 83 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:06,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2025-04-13 22:34:06,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1766. [2025-04-13 22:34:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1765 states have (on average 2.8991501416430596) internal successors, (5117), 1765 states have internal predecessors, (5117), 0 states have call successors, (0), 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:34:06,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 5117 transitions. [2025-04-13 22:34:06,984 INFO L79 Accepts]: Start accepts. Automaton has 1766 states and 5117 transitions. Word has length 56 [2025-04-13 22:34:06,984 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:06,984 INFO L485 AbstractCegarLoop]: Abstraction has 1766 states and 5117 transitions. [2025-04-13 22:34:06,984 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:06,984 INFO L278 IsEmpty]: Start isEmpty. Operand 1766 states and 5117 transitions. [2025-04-13 22:34:06,986 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:06,986 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:06,986 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:06,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2025-04-13 22:34:07,186 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable121 [2025-04-13 22:34:07,186 INFO L403 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:07,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:07,186 INFO L85 PathProgramCache]: Analyzing trace with hash 600551430, now seen corresponding path program 122 times [2025-04-13 22:34:07,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:07,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637445574] [2025-04-13 22:34:07,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:07,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:07,191 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:07,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:07,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:34:07,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:07,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:07,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:07,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637445574] [2025-04-13 22:34:07,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637445574] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:07,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:07,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:34:07,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700106974] [2025-04-13 22:34:07,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:07,308 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:07,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:07,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:07,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:07,308 INFO L87 Difference]: Start difference. First operand 1766 states and 5117 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:07,785 INFO L93 Difference]: Finished difference Result 2062 states and 5916 transitions. [2025-04-13 22:34:07,785 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:34:07,785 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:07,785 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:07,792 INFO L225 Difference]: With dead ends: 2062 [2025-04-13 22:34:07,792 INFO L226 Difference]: Without dead ends: 1868 [2025-04-13 22:34:07,792 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:34:07,792 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 218 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:07,792 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 90 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:07,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2025-04-13 22:34:07,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1756. [2025-04-13 22:34:07,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1755 states have (on average 2.896866096866097) internal successors, (5084), 1755 states have internal predecessors, (5084), 0 states have call successors, (0), 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:34:07,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 5084 transitions. [2025-04-13 22:34:07,812 INFO L79 Accepts]: Start accepts. Automaton has 1756 states and 5084 transitions. Word has length 56 [2025-04-13 22:34:07,812 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:07,812 INFO L485 AbstractCegarLoop]: Abstraction has 1756 states and 5084 transitions. [2025-04-13 22:34:07,812 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:07,812 INFO L278 IsEmpty]: Start isEmpty. Operand 1756 states and 5084 transitions. [2025-04-13 22:34:07,813 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:07,813 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:07,813 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:07,814 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2025-04-13 22:34:07,814 INFO L403 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:07,814 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:07,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1306547708, now seen corresponding path program 123 times [2025-04-13 22:34:07,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:07,814 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206501459] [2025-04-13 22:34:07,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:34:07,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:07,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:07,822 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:07,822 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:34:07,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:07,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:07,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:07,940 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206501459] [2025-04-13 22:34:07,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206501459] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:07,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:07,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:34:07,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333888845] [2025-04-13 22:34:07,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:07,940 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:07,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:07,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:07,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:07,941 INFO L87 Difference]: Start difference. First operand 1756 states and 5084 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:08,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:08,411 INFO L93 Difference]: Finished difference Result 1971 states and 5630 transitions. [2025-04-13 22:34:08,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:34:08,411 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:08,411 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:08,418 INFO L225 Difference]: With dead ends: 1971 [2025-04-13 22:34:08,418 INFO L226 Difference]: Without dead ends: 1715 [2025-04-13 22:34:08,418 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=776, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:34:08,418 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 231 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:08,419 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 90 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:34:08,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2025-04-13 22:34:08,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1704. [2025-04-13 22:34:08,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1703 states have (on average 2.906635349383441) internal successors, (4950), 1703 states have internal predecessors, (4950), 0 states have call successors, (0), 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:34:08,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 4950 transitions. [2025-04-13 22:34:08,437 INFO L79 Accepts]: Start accepts. Automaton has 1704 states and 4950 transitions. Word has length 56 [2025-04-13 22:34:08,437 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:08,437 INFO L485 AbstractCegarLoop]: Abstraction has 1704 states and 4950 transitions. [2025-04-13 22:34:08,437 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:08,437 INFO L278 IsEmpty]: Start isEmpty. Operand 1704 states and 4950 transitions. [2025-04-13 22:34:08,439 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:08,439 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:08,439 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:08,439 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2025-04-13 22:34:08,439 INFO L403 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:08,439 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:08,439 INFO L85 PathProgramCache]: Analyzing trace with hash 245621074, now seen corresponding path program 124 times [2025-04-13 22:34:08,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:08,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205886330] [2025-04-13 22:34:08,439 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:34:08,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:08,444 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:08,446 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:34:08,446 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:34:08,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:08,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:08,511 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205886330] [2025-04-13 22:34:08,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205886330] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:08,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:08,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:34:08,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745007970] [2025-04-13 22:34:08,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:08,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:34:08,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:08,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:34:08,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:34:08,511 INFO L87 Difference]: Start difference. First operand 1704 states and 4950 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:08,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:08,973 INFO L93 Difference]: Finished difference Result 2112 states and 6149 transitions. [2025-04-13 22:34:08,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:34:08,973 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:08,973 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:08,981 INFO L225 Difference]: With dead ends: 2112 [2025-04-13 22:34:08,981 INFO L226 Difference]: Without dead ends: 2047 [2025-04-13 22:34:08,982 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:34:08,982 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 197 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:08,982 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 80 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:34:08,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2025-04-13 22:34:08,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1824. [2025-04-13 22:34:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1823 states have (on average 2.9182665935271532) internal successors, (5320), 1823 states have internal predecessors, (5320), 0 states have call successors, (0), 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:34:08,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 5320 transitions. [2025-04-13 22:34:09,003 INFO L79 Accepts]: Start accepts. Automaton has 1824 states and 5320 transitions. Word has length 56 [2025-04-13 22:34:09,003 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:09,003 INFO L485 AbstractCegarLoop]: Abstraction has 1824 states and 5320 transitions. [2025-04-13 22:34:09,003 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:09,003 INFO L278 IsEmpty]: Start isEmpty. Operand 1824 states and 5320 transitions. [2025-04-13 22:34:09,005 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:09,005 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:09,005 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:09,005 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2025-04-13 22:34:09,005 INFO L403 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:09,005 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:09,005 INFO L85 PathProgramCache]: Analyzing trace with hash -994375762, now seen corresponding path program 125 times [2025-04-13 22:34:09,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:09,005 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743202827] [2025-04-13 22:34:09,005 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:09,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:09,009 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:09,016 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:09,016 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:09,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:09,641 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:34:09,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:09,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743202827] [2025-04-13 22:34:09,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743202827] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:09,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525408441] [2025-04-13 22:34:09,641 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:09,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:09,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:09,643 INFO L229 MonitoredProcess]: Starting monitored process 42 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:34:09,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-04-13 22:34:09,712 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:09,730 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:09,730 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:09,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:09,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:34:09,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:09,912 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:34:09,912 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:34:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:09,917 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:34:09,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525408441] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:09,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:34:09,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 24 [2025-04-13 22:34:09,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404800748] [2025-04-13 22:34:09,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:09,917 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:09,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:09,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:09,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:34:09,918 INFO L87 Difference]: Start difference. First operand 1824 states and 5320 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:10,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:10,915 INFO L93 Difference]: Finished difference Result 2140 states and 6176 transitions. [2025-04-13 22:34:10,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:34:10,915 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:10,915 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:10,922 INFO L225 Difference]: With dead ends: 2140 [2025-04-13 22:34:10,922 INFO L226 Difference]: Without dead ends: 1976 [2025-04-13 22:34:10,923 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=1795, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:34:10,923 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 260 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:10,923 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 93 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:34:10,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2025-04-13 22:34:10,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 1824. [2025-04-13 22:34:10,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1823 states have (on average 2.890839275918815) internal successors, (5270), 1823 states have internal predecessors, (5270), 0 states have call successors, (0), 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:34:10,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 5270 transitions. [2025-04-13 22:34:10,943 INFO L79 Accepts]: Start accepts. Automaton has 1824 states and 5270 transitions. Word has length 56 [2025-04-13 22:34:10,944 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:10,944 INFO L485 AbstractCegarLoop]: Abstraction has 1824 states and 5270 transitions. [2025-04-13 22:34:10,944 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:10,944 INFO L278 IsEmpty]: Start isEmpty. Operand 1824 states and 5270 transitions. [2025-04-13 22:34:10,945 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:10,945 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:10,945 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:10,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2025-04-13 22:34:11,146 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2025-04-13 22:34:11,146 INFO L403 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:11,146 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:11,146 INFO L85 PathProgramCache]: Analyzing trace with hash -2021121906, now seen corresponding path program 126 times [2025-04-13 22:34:11,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:11,146 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668027133] [2025-04-13 22:34:11,146 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:34:11,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:11,151 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:11,155 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:11,155 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:34:11,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:11,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:11,253 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668027133] [2025-04-13 22:34:11,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668027133] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:11,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:11,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:34:11,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004892739] [2025-04-13 22:34:11,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:11,253 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:34:11,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:11,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:34:11,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:34:11,253 INFO L87 Difference]: Start difference. First operand 1824 states and 5270 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:11,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:11,709 INFO L93 Difference]: Finished difference Result 2051 states and 5906 transitions. [2025-04-13 22:34:11,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:34:11,709 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:11,709 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:11,717 INFO L225 Difference]: With dead ends: 2051 [2025-04-13 22:34:11,717 INFO L226 Difference]: Without dead ends: 1992 [2025-04-13 22:34:11,717 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:34:11,717 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 206 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:11,717 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 78 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:34:11,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2025-04-13 22:34:11,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1819. [2025-04-13 22:34:11,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1819 states, 1818 states have (on average 2.8905390539053903) internal successors, (5255), 1818 states have internal predecessors, (5255), 0 states have call successors, (0), 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:34:11,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 5255 transitions. [2025-04-13 22:34:11,738 INFO L79 Accepts]: Start accepts. Automaton has 1819 states and 5255 transitions. Word has length 56 [2025-04-13 22:34:11,738 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:11,738 INFO L485 AbstractCegarLoop]: Abstraction has 1819 states and 5255 transitions. [2025-04-13 22:34:11,738 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:11,738 INFO L278 IsEmpty]: Start isEmpty. Operand 1819 states and 5255 transitions. [2025-04-13 22:34:11,739 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:11,739 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:11,740 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:11,740 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2025-04-13 22:34:11,740 INFO L403 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:11,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:11,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1002488592, now seen corresponding path program 127 times [2025-04-13 22:34:11,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:11,740 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116707152] [2025-04-13 22:34:11,740 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:34:11,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:11,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:34:11,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:11,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:11,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:12,464 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:34:12,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:12,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116707152] [2025-04-13 22:34:12,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116707152] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:12,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483794588] [2025-04-13 22:34:12,464 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:34:12,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:12,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:12,466 INFO L229 MonitoredProcess]: Starting monitored process 43 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:34:12,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-04-13 22:34:12,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:34:12,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:12,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:12,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:12,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:34:12,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:12,813 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:34:12,814 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:34:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:34:12,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:13,048 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:34:13,048 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:34:13,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:13,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483794588] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:13,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:34:13,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 35 [2025-04-13 22:34:13,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350933146] [2025-04-13 22:34:13,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:13,073 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:13,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:13,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:13,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1174, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:34:13,074 INFO L87 Difference]: Start difference. First operand 1819 states and 5255 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:13,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:13,838 INFO L93 Difference]: Finished difference Result 2025 states and 5829 transitions. [2025-04-13 22:34:13,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:34:13,838 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:13,838 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:13,847 INFO L225 Difference]: With dead ends: 2025 [2025-04-13 22:34:13,847 INFO L226 Difference]: Without dead ends: 1906 [2025-04-13 22:34:13,849 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=242, Invalid=2950, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:34:13,849 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 254 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:13,849 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 76 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:13,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2025-04-13 22:34:13,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1764. [2025-04-13 22:34:13,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1763 states have (on average 2.886557005104935) internal successors, (5089), 1763 states have internal predecessors, (5089), 0 states have call successors, (0), 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:34:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 5089 transitions. [2025-04-13 22:34:13,872 INFO L79 Accepts]: Start accepts. Automaton has 1764 states and 5089 transitions. Word has length 56 [2025-04-13 22:34:13,872 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:13,872 INFO L485 AbstractCegarLoop]: Abstraction has 1764 states and 5089 transitions. [2025-04-13 22:34:13,872 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:13,872 INFO L278 IsEmpty]: Start isEmpty. Operand 1764 states and 5089 transitions. [2025-04-13 22:34:13,874 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:13,874 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:13,874 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:13,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2025-04-13 22:34:14,074 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:14,074 INFO L403 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:14,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:14,075 INFO L85 PathProgramCache]: Analyzing trace with hash -679206592, now seen corresponding path program 128 times [2025-04-13 22:34:14,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:14,075 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041153806] [2025-04-13 22:34:14,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:14,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:14,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:14,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:14,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:34:14,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:14,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:14,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:14,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041153806] [2025-04-13 22:34:14,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041153806] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:14,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:14,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:34:14,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616350575] [2025-04-13 22:34:14,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:14,182 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:34:14,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:14,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:34:14,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:34:14,182 INFO L87 Difference]: Start difference. First operand 1764 states and 5089 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:14,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:14,744 INFO L93 Difference]: Finished difference Result 1993 states and 5724 transitions. [2025-04-13 22:34:14,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:34:14,745 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:14,745 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:14,752 INFO L225 Difference]: With dead ends: 1993 [2025-04-13 22:34:14,753 INFO L226 Difference]: Without dead ends: 1907 [2025-04-13 22:34:14,753 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=193, Invalid=1139, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:34:14,753 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 315 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:14,753 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 111 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1522 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:14,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2025-04-13 22:34:14,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1774. [2025-04-13 22:34:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1773 states have (on average 2.8843767625493513) internal successors, (5114), 1773 states have internal predecessors, (5114), 0 states have call successors, (0), 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:34:14,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 5114 transitions. [2025-04-13 22:34:14,789 INFO L79 Accepts]: Start accepts. Automaton has 1774 states and 5114 transitions. Word has length 56 [2025-04-13 22:34:14,789 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:14,789 INFO L485 AbstractCegarLoop]: Abstraction has 1774 states and 5114 transitions. [2025-04-13 22:34:14,789 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:14,789 INFO L278 IsEmpty]: Start isEmpty. Operand 1774 states and 5114 transitions. [2025-04-13 22:34:14,790 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:14,790 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:14,791 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:14,791 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2025-04-13 22:34:14,791 INFO L403 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:14,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:14,791 INFO L85 PathProgramCache]: Analyzing trace with hash 487403138, now seen corresponding path program 129 times [2025-04-13 22:34:14,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:14,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134068964] [2025-04-13 22:34:14,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:34:14,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:14,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:14,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:14,800 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:34:14,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:14,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:14,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:14,888 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134068964] [2025-04-13 22:34:14,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134068964] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:14,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:14,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:34:14,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159125601] [2025-04-13 22:34:14,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:14,889 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:34:14,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:14,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:34:14,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:34:14,889 INFO L87 Difference]: Start difference. First operand 1774 states and 5114 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:15,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:15,397 INFO L93 Difference]: Finished difference Result 2003 states and 5749 transitions. [2025-04-13 22:34:15,397 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:34:15,397 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:15,397 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:15,405 INFO L225 Difference]: With dead ends: 2003 [2025-04-13 22:34:15,405 INFO L226 Difference]: Without dead ends: 1938 [2025-04-13 22:34:15,406 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=1010, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:34:15,406 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 229 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:15,406 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 100 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:15,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2025-04-13 22:34:15,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1779. [2025-04-13 22:34:15,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1778 states have (on average 2.8818897637795278) internal successors, (5124), 1778 states have internal predecessors, (5124), 0 states have call successors, (0), 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:34:15,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 5124 transitions. [2025-04-13 22:34:15,426 INFO L79 Accepts]: Start accepts. Automaton has 1779 states and 5124 transitions. Word has length 56 [2025-04-13 22:34:15,426 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:15,426 INFO L485 AbstractCegarLoop]: Abstraction has 1779 states and 5124 transitions. [2025-04-13 22:34:15,426 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:15,426 INFO L278 IsEmpty]: Start isEmpty. Operand 1779 states and 5124 transitions. [2025-04-13 22:34:15,428 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:15,428 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:15,428 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:15,428 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2025-04-13 22:34:15,428 INFO L403 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:15,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:15,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1714589376, now seen corresponding path program 130 times [2025-04-13 22:34:15,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:15,428 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994030897] [2025-04-13 22:34:15,428 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:34:15,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:15,432 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:15,435 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:34:15,435 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:34:15,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:15,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:15,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:15,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994030897] [2025-04-13 22:34:15,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994030897] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:15,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:15,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:34:15,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213787574] [2025-04-13 22:34:15,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:15,506 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:34:15,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:15,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:34:15,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:34:15,506 INFO L87 Difference]: Start difference. First operand 1779 states and 5124 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:16,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:16,029 INFO L93 Difference]: Finished difference Result 2090 states and 6030 transitions. [2025-04-13 22:34:16,029 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:34:16,029 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:16,029 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:16,037 INFO L225 Difference]: With dead ends: 2090 [2025-04-13 22:34:16,037 INFO L226 Difference]: Without dead ends: 2026 [2025-04-13 22:34:16,038 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=951, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:34:16,038 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 216 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:16,038 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 118 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:16,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2025-04-13 22:34:16,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 1769. [2025-04-13 22:34:16,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1768 states have (on average 2.884049773755656) internal successors, (5099), 1768 states have internal predecessors, (5099), 0 states have call successors, (0), 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:34:16,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 5099 transitions. [2025-04-13 22:34:16,058 INFO L79 Accepts]: Start accepts. Automaton has 1769 states and 5099 transitions. Word has length 56 [2025-04-13 22:34:16,058 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:16,058 INFO L485 AbstractCegarLoop]: Abstraction has 1769 states and 5099 transitions. [2025-04-13 22:34:16,058 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:16,058 INFO L278 IsEmpty]: Start isEmpty. Operand 1769 states and 5099 transitions. [2025-04-13 22:34:16,060 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:16,060 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:16,060 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:16,060 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2025-04-13 22:34:16,060 INFO L403 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:16,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:16,060 INFO L85 PathProgramCache]: Analyzing trace with hash -2125727248, now seen corresponding path program 131 times [2025-04-13 22:34:16,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:16,061 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240286799] [2025-04-13 22:34:16,061 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:16,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:16,064 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:16,072 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:16,072 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:16,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:16,738 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:34:16,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:16,738 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240286799] [2025-04-13 22:34:16,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240286799] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:16,738 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483469297] [2025-04-13 22:34:16,739 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:16,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:16,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:16,740 INFO L229 MonitoredProcess]: Starting monitored process 44 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:34:16,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-04-13 22:34:16,814 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:16,832 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:16,832 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:16,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:16,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:34:16,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:16,979 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:34:16,979 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:34:16,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:16,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:34:16,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483469297] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:16,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:34:16,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 23 [2025-04-13 22:34:16,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399214163] [2025-04-13 22:34:16,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:16,986 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:16,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:16,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:16,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:34:16,986 INFO L87 Difference]: Start difference. First operand 1769 states and 5099 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:17,862 INFO L93 Difference]: Finished difference Result 2008 states and 5764 transitions. [2025-04-13 22:34:17,863 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:34:17,863 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:17,863 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:17,870 INFO L225 Difference]: With dead ends: 2008 [2025-04-13 22:34:17,870 INFO L226 Difference]: Without dead ends: 1943 [2025-04-13 22:34:17,870 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=217, Invalid=1853, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:34:17,870 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 241 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:17,871 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 77 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:34:17,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2025-04-13 22:34:17,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1779. [2025-04-13 22:34:17,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1778 states have (on average 2.8818897637795278) internal successors, (5124), 1778 states have internal predecessors, (5124), 0 states have call successors, (0), 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:34:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 5124 transitions. [2025-04-13 22:34:17,890 INFO L79 Accepts]: Start accepts. Automaton has 1779 states and 5124 transitions. Word has length 56 [2025-04-13 22:34:17,890 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:17,890 INFO L485 AbstractCegarLoop]: Abstraction has 1779 states and 5124 transitions. [2025-04-13 22:34:17,891 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:17,891 INFO L278 IsEmpty]: Start isEmpty. Operand 1779 states and 5124 transitions. [2025-04-13 22:34:17,892 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:17,892 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:17,892 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:17,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2025-04-13 22:34:18,092 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131,44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:18,093 INFO L403 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:18,093 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:18,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1095288594, now seen corresponding path program 132 times [2025-04-13 22:34:18,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:18,093 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743307865] [2025-04-13 22:34:18,093 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:34:18,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:18,097 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:18,102 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:18,102 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:34:18,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:18,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:18,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:18,200 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743307865] [2025-04-13 22:34:18,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743307865] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:18,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:18,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:34:18,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98805094] [2025-04-13 22:34:18,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:18,201 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:34:18,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:18,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:34:18,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:34:18,201 INFO L87 Difference]: Start difference. First operand 1779 states and 5124 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:18,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:18,661 INFO L93 Difference]: Finished difference Result 1997 states and 5727 transitions. [2025-04-13 22:34:18,662 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:34:18,662 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:18,662 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:18,670 INFO L225 Difference]: With dead ends: 1997 [2025-04-13 22:34:18,670 INFO L226 Difference]: Without dead ends: 1938 [2025-04-13 22:34:18,670 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:34:18,670 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 188 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:18,670 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 89 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:34:18,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2025-04-13 22:34:18,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1774. [2025-04-13 22:34:18,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1773 states have (on average 2.8815566835871405) internal successors, (5109), 1773 states have internal predecessors, (5109), 0 states have call successors, (0), 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:34:18,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 5109 transitions. [2025-04-13 22:34:18,691 INFO L79 Accepts]: Start accepts. Automaton has 1774 states and 5109 transitions. Word has length 56 [2025-04-13 22:34:18,691 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:18,691 INFO L485 AbstractCegarLoop]: Abstraction has 1774 states and 5109 transitions. [2025-04-13 22:34:18,691 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:18,691 INFO L278 IsEmpty]: Start isEmpty. Operand 1774 states and 5109 transitions. [2025-04-13 22:34:18,692 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:18,692 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:18,692 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:18,692 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2025-04-13 22:34:18,693 INFO L403 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:18,693 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:18,693 INFO L85 PathProgramCache]: Analyzing trace with hash -266094350, now seen corresponding path program 133 times [2025-04-13 22:34:18,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:18,693 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511661038] [2025-04-13 22:34:18,693 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:34:18,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:18,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:34:18,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:18,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:18,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:19,280 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:34:19,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:19,280 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511661038] [2025-04-13 22:34:19,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511661038] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:19,280 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108592632] [2025-04-13 22:34:19,280 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:34:19,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:19,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:19,282 INFO L229 MonitoredProcess]: Starting monitored process 45 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:34:19,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-04-13 22:34:19,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:34:19,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:19,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:19,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:19,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:34:19,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:19,571 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:34:19,572 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:34:19,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:34:19,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:19,770 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:34:19,770 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:34:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:19,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108592632] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:19,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:34:19,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 33 [2025-04-13 22:34:19,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189500551] [2025-04-13 22:34:19,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:19,796 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:19,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:19,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:19,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:34:19,796 INFO L87 Difference]: Start difference. First operand 1774 states and 5109 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:20,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:20,618 INFO L93 Difference]: Finished difference Result 1971 states and 5650 transitions. [2025-04-13 22:34:20,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:34:20,618 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:20,618 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:20,625 INFO L225 Difference]: With dead ends: 1971 [2025-04-13 22:34:20,625 INFO L226 Difference]: Without dead ends: 1847 [2025-04-13 22:34:20,625 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=250, Invalid=2942, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:34:20,626 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 228 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:20,626 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 84 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1294 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:20,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2025-04-13 22:34:20,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1714. [2025-04-13 22:34:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1713 states have (on average 2.9030939871570345) internal successors, (4973), 1713 states have internal predecessors, (4973), 0 states have call successors, (0), 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:34:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 4973 transitions. [2025-04-13 22:34:20,646 INFO L79 Accepts]: Start accepts. Automaton has 1714 states and 4973 transitions. Word has length 56 [2025-04-13 22:34:20,646 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:20,646 INFO L485 AbstractCegarLoop]: Abstraction has 1714 states and 4973 transitions. [2025-04-13 22:34:20,646 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:20,646 INFO L278 IsEmpty]: Start isEmpty. Operand 1714 states and 4973 transitions. [2025-04-13 22:34:20,647 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:20,648 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:20,648 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:20,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2025-04-13 22:34:20,848 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable133 [2025-04-13 22:34:20,848 INFO L403 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:20,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:20,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1455138028, now seen corresponding path program 134 times [2025-04-13 22:34:20,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:20,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012274115] [2025-04-13 22:34:20,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:20,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:20,853 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:20,857 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:20,857 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:34:20,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:20,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:20,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:20,955 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012274115] [2025-04-13 22:34:20,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012274115] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:20,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:20,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:34:20,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012086705] [2025-04-13 22:34:20,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:20,955 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:20,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:20,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:20,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:20,955 INFO L87 Difference]: Start difference. First operand 1714 states and 4973 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:21,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:21,438 INFO L93 Difference]: Finished difference Result 1992 states and 5773 transitions. [2025-04-13 22:34:21,438 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:34:21,438 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:21,439 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:21,446 INFO L225 Difference]: With dead ends: 1992 [2025-04-13 22:34:21,446 INFO L226 Difference]: Without dead ends: 1927 [2025-04-13 22:34:21,447 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:34:21,447 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 204 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:21,447 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 91 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:21,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2025-04-13 22:34:21,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1784. [2025-04-13 22:34:21,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 2.9091418956814357) internal successors, (5187), 1783 states have internal predecessors, (5187), 0 states have call successors, (0), 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:34:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 5187 transitions. [2025-04-13 22:34:21,467 INFO L79 Accepts]: Start accepts. Automaton has 1784 states and 5187 transitions. Word has length 56 [2025-04-13 22:34:21,467 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:21,467 INFO L485 AbstractCegarLoop]: Abstraction has 1784 states and 5187 transitions. [2025-04-13 22:34:21,467 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:21,467 INFO L278 IsEmpty]: Start isEmpty. Operand 1784 states and 5187 transitions. [2025-04-13 22:34:21,469 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:21,469 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:21,469 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:21,469 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2025-04-13 22:34:21,469 INFO L403 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:21,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:21,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2116666924, now seen corresponding path program 135 times [2025-04-13 22:34:21,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:21,469 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372680873] [2025-04-13 22:34:21,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:34:21,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:21,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:21,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:21,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:34:21,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:21,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:21,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:21,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372680873] [2025-04-13 22:34:21,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372680873] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:21,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:21,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:34:21,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537423808] [2025-04-13 22:34:21,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:21,585 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:21,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:21,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:21,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:21,585 INFO L87 Difference]: Start difference. First operand 1784 states and 5187 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:22,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:22,303 INFO L93 Difference]: Finished difference Result 2548 states and 7380 transitions. [2025-04-13 22:34:22,304 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 22:34:22,304 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:22,304 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:22,312 INFO L225 Difference]: With dead ends: 2548 [2025-04-13 22:34:22,312 INFO L226 Difference]: Without dead ends: 2384 [2025-04-13 22:34:22,313 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=1287, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:34:22,313 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 357 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2026 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 2035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:22,313 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 170 Invalid, 2035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2026 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:34:22,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2025-04-13 22:34:22,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 1894. [2025-04-13 22:34:22,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1893 states have (on average 2.8695192815636554) internal successors, (5432), 1893 states have internal predecessors, (5432), 0 states have call successors, (0), 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:34:22,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 5432 transitions. [2025-04-13 22:34:22,348 INFO L79 Accepts]: Start accepts. Automaton has 1894 states and 5432 transitions. Word has length 56 [2025-04-13 22:34:22,348 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:22,348 INFO L485 AbstractCegarLoop]: Abstraction has 1894 states and 5432 transitions. [2025-04-13 22:34:22,348 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:22,348 INFO L278 IsEmpty]: Start isEmpty. Operand 1894 states and 5432 transitions. [2025-04-13 22:34:22,350 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:22,350 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:22,350 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:22,350 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2025-04-13 22:34:22,350 INFO L403 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:22,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:22,350 INFO L85 PathProgramCache]: Analyzing trace with hash 573086288, now seen corresponding path program 136 times [2025-04-13 22:34:22,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:22,350 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338356719] [2025-04-13 22:34:22,350 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:34:22,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:22,354 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:22,357 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:34:22,357 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:34:22,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:22,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:22,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338356719] [2025-04-13 22:34:22,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338356719] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:22,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:22,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:34:22,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498803124] [2025-04-13 22:34:22,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:22,429 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:22,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:22,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:22,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:22,429 INFO L87 Difference]: Start difference. First operand 1894 states and 5432 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:22,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:22,920 INFO L93 Difference]: Finished difference Result 2081 states and 5948 transitions. [2025-04-13 22:34:22,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:34:22,920 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:22,920 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:22,928 INFO L225 Difference]: With dead ends: 2081 [2025-04-13 22:34:22,928 INFO L226 Difference]: Without dead ends: 2022 [2025-04-13 22:34:22,929 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=900, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:34:22,929 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 214 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:22,929 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 90 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:22,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2025-04-13 22:34:22,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1889. [2025-04-13 22:34:22,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1888 states have (on average 2.8691737288135593) internal successors, (5417), 1888 states have internal predecessors, (5417), 0 states have call successors, (0), 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:34:22,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 5417 transitions. [2025-04-13 22:34:22,951 INFO L79 Accepts]: Start accepts. Automaton has 1889 states and 5417 transitions. Word has length 56 [2025-04-13 22:34:22,951 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:22,952 INFO L485 AbstractCegarLoop]: Abstraction has 1889 states and 5417 transitions. [2025-04-13 22:34:22,952 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:22,952 INFO L278 IsEmpty]: Start isEmpty. Operand 1889 states and 5417 transitions. [2025-04-13 22:34:22,953 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:22,954 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:22,954 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:22,954 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2025-04-13 22:34:22,954 INFO L403 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:22,954 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:22,954 INFO L85 PathProgramCache]: Analyzing trace with hash -181436018, now seen corresponding path program 137 times [2025-04-13 22:34:22,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:22,954 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315028619] [2025-04-13 22:34:22,954 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:22,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:22,958 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:22,965 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:22,965 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:22,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:23,819 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:34:23,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:23,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315028619] [2025-04-13 22:34:23,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315028619] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:23,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610807955] [2025-04-13 22:34:23,819 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:23,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:23,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:23,821 INFO L229 MonitoredProcess]: Starting monitored process 46 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:34:23,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2025-04-13 22:34:23,894 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:23,913 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:23,913 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:23,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:23,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:34:23,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:24,122 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:34:24,122 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:34:24,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:24,128 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:34:24,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610807955] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:24,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:34:24,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 24 [2025-04-13 22:34:24,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930894310] [2025-04-13 22:34:24,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:24,128 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:24,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:24,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:24,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=550, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:34:24,129 INFO L87 Difference]: Start difference. First operand 1889 states and 5417 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:25,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:25,160 INFO L93 Difference]: Finished difference Result 2086 states and 5958 transitions. [2025-04-13 22:34:25,160 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:34:25,160 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:25,160 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:25,168 INFO L225 Difference]: With dead ends: 2086 [2025-04-13 22:34:25,168 INFO L226 Difference]: Without dead ends: 1967 [2025-04-13 22:34:25,168 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=1889, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:34:25,169 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 220 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:25,169 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 87 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:34:25,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2025-04-13 22:34:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1834. [2025-04-13 22:34:25,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1833 states have (on average 2.8865248226950353) internal successors, (5291), 1833 states have internal predecessors, (5291), 0 states have call successors, (0), 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:34:25,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 5291 transitions. [2025-04-13 22:34:25,189 INFO L79 Accepts]: Start accepts. Automaton has 1834 states and 5291 transitions. Word has length 56 [2025-04-13 22:34:25,189 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:25,189 INFO L485 AbstractCegarLoop]: Abstraction has 1834 states and 5291 transitions. [2025-04-13 22:34:25,189 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:25,190 INFO L278 IsEmpty]: Start isEmpty. Operand 1834 states and 5291 transitions. [2025-04-13 22:34:25,191 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:25,191 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:25,191 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:25,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2025-04-13 22:34:25,392 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable137 [2025-04-13 22:34:25,392 INFO L403 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:25,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:25,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1726198784, now seen corresponding path program 138 times [2025-04-13 22:34:25,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:25,392 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627591907] [2025-04-13 22:34:25,392 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:34:25,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:25,398 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:25,402 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:25,402 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:34:25,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:25,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:25,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:25,515 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627591907] [2025-04-13 22:34:25,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627591907] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:25,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:25,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:34:25,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233242492] [2025-04-13 22:34:25,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:25,515 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:25,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:25,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:25,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:25,515 INFO L87 Difference]: Start difference. First operand 1834 states and 5291 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:26,135 INFO L93 Difference]: Finished difference Result 2272 states and 6515 transitions. [2025-04-13 22:34:26,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:34:26,135 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:26,135 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:26,143 INFO L225 Difference]: With dead ends: 2272 [2025-04-13 22:34:26,143 INFO L226 Difference]: Without dead ends: 2068 [2025-04-13 22:34:26,143 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=968, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:34:26,144 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 264 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 1799 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:26,144 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 163 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1799 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:34:26,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2025-04-13 22:34:26,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 1814. [2025-04-13 22:34:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1814 states, 1813 states have (on average 2.8819635962493106) internal successors, (5225), 1813 states have internal predecessors, (5225), 0 states have call successors, (0), 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:34:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 5225 transitions. [2025-04-13 22:34:26,165 INFO L79 Accepts]: Start accepts. Automaton has 1814 states and 5225 transitions. Word has length 56 [2025-04-13 22:34:26,165 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:26,165 INFO L485 AbstractCegarLoop]: Abstraction has 1814 states and 5225 transitions. [2025-04-13 22:34:26,165 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:26,165 INFO L278 IsEmpty]: Start isEmpty. Operand 1814 states and 5225 transitions. [2025-04-13 22:34:26,166 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:26,166 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:26,167 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:26,167 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2025-04-13 22:34:26,167 INFO L403 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:26,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:26,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1967723918, now seen corresponding path program 139 times [2025-04-13 22:34:26,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:26,167 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465424331] [2025-04-13 22:34:26,167 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:34:26,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:26,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:34:26,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:26,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:26,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:26,804 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:34:26,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:26,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465424331] [2025-04-13 22:34:26,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465424331] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:26,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271735006] [2025-04-13 22:34:26,804 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:34:26,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:26,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:26,806 INFO L229 MonitoredProcess]: Starting monitored process 47 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:34:26,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2025-04-13 22:34:26,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:34:26,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:26,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:26,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:26,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:34:26,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:27,103 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:34:27,103 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:34:27,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:34:27,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:27,301 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:34:27,301 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:34:27,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:27,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271735006] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:27,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:34:27,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 33 [2025-04-13 22:34:27,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522787305] [2025-04-13 22:34:27,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:27,325 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:27,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:27,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:27,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1032, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:34:27,326 INFO L87 Difference]: Start difference. First operand 1814 states and 5225 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:28,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:28,029 INFO L93 Difference]: Finished difference Result 2090 states and 5952 transitions. [2025-04-13 22:34:28,029 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:34:28,029 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:28,029 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:28,036 INFO L225 Difference]: With dead ends: 2090 [2025-04-13 22:34:28,036 INFO L226 Difference]: Without dead ends: 1926 [2025-04-13 22:34:28,036 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=198, Invalid=2352, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:34:28,037 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 231 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:28,037 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 92 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:28,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2025-04-13 22:34:28,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1764. [2025-04-13 22:34:28,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1763 states have (on average 2.875212705615428) internal successors, (5069), 1763 states have internal predecessors, (5069), 0 states have call successors, (0), 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:34:28,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 5069 transitions. [2025-04-13 22:34:28,056 INFO L79 Accepts]: Start accepts. Automaton has 1764 states and 5069 transitions. Word has length 56 [2025-04-13 22:34:28,056 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:28,056 INFO L485 AbstractCegarLoop]: Abstraction has 1764 states and 5069 transitions. [2025-04-13 22:34:28,056 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:28,057 INFO L278 IsEmpty]: Start isEmpty. Operand 1764 states and 5069 transitions. [2025-04-13 22:34:28,058 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:28,058 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:28,058 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:28,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2025-04-13 22:34:28,258 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:28,259 INFO L403 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:28,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:28,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1865193330, now seen corresponding path program 140 times [2025-04-13 22:34:28,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:28,259 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716615195] [2025-04-13 22:34:28,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:28,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:28,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:28,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:28,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:34:28,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:28,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:28,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:28,358 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716615195] [2025-04-13 22:34:28,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716615195] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:28,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:28,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:34:28,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697727455] [2025-04-13 22:34:28,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:28,358 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:34:28,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:28,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:34:28,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:34:28,359 INFO L87 Difference]: Start difference. First operand 1764 states and 5069 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:28,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:28,793 INFO L93 Difference]: Finished difference Result 2022 states and 5744 transitions. [2025-04-13 22:34:28,793 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:34:28,793 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:28,794 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:28,801 INFO L225 Difference]: With dead ends: 2022 [2025-04-13 22:34:28,801 INFO L226 Difference]: Without dead ends: 1957 [2025-04-13 22:34:28,802 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:34:28,802 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 194 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:28,802 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 78 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:34:28,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2025-04-13 22:34:28,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1874. [2025-04-13 22:34:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1874 states, 1873 states have (on average 2.8595835557928457) internal successors, (5356), 1873 states have internal predecessors, (5356), 0 states have call successors, (0), 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:34:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 5356 transitions. [2025-04-13 22:34:28,823 INFO L79 Accepts]: Start accepts. Automaton has 1874 states and 5356 transitions. Word has length 56 [2025-04-13 22:34:28,823 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:28,823 INFO L485 AbstractCegarLoop]: Abstraction has 1874 states and 5356 transitions. [2025-04-13 22:34:28,823 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:28,823 INFO L278 IsEmpty]: Start isEmpty. Operand 1874 states and 5356 transitions. [2025-04-13 22:34:28,824 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:28,825 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:28,825 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:28,825 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2025-04-13 22:34:28,825 INFO L403 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:28,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:28,825 INFO L85 PathProgramCache]: Analyzing trace with hash -333004800, now seen corresponding path program 141 times [2025-04-13 22:34:28,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:28,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064089004] [2025-04-13 22:34:28,825 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:34:28,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:28,829 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:28,833 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:28,833 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:34:28,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:28,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:28,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:28,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064089004] [2025-04-13 22:34:28,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064089004] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:28,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:28,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:34:28,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411120681] [2025-04-13 22:34:28,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:28,936 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:34:28,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:28,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:34:28,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:34:28,937 INFO L87 Difference]: Start difference. First operand 1874 states and 5356 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:29,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:29,363 INFO L93 Difference]: Finished difference Result 2011 states and 5707 transitions. [2025-04-13 22:34:29,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:34:29,363 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:29,363 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:29,370 INFO L225 Difference]: With dead ends: 2011 [2025-04-13 22:34:29,370 INFO L226 Difference]: Without dead ends: 1952 [2025-04-13 22:34:29,370 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:34:29,370 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 209 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:29,370 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 77 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:34:29,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2025-04-13 22:34:29,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1869. [2025-04-13 22:34:29,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1868 states have (on average 2.859207708779443) internal successors, (5341), 1868 states have internal predecessors, (5341), 0 states have call successors, (0), 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:34:29,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 5341 transitions. [2025-04-13 22:34:29,390 INFO L79 Accepts]: Start accepts. Automaton has 1869 states and 5341 transitions. Word has length 56 [2025-04-13 22:34:29,390 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:29,391 INFO L485 AbstractCegarLoop]: Abstraction has 1869 states and 5341 transitions. [2025-04-13 22:34:29,391 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:29,391 INFO L278 IsEmpty]: Start isEmpty. Operand 1869 states and 5341 transitions. [2025-04-13 22:34:29,392 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:29,392 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:29,392 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:29,392 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2025-04-13 22:34:29,392 INFO L403 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:29,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:29,393 INFO L85 PathProgramCache]: Analyzing trace with hash 513531838, now seen corresponding path program 142 times [2025-04-13 22:34:29,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:29,393 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631081815] [2025-04-13 22:34:29,393 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:34:29,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:29,397 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:29,399 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:34:29,399 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:34:29,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:29,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:29,467 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631081815] [2025-04-13 22:34:29,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631081815] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:29,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:29,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:34:29,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639815246] [2025-04-13 22:34:29,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:29,468 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:34:29,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:29,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:34:29,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:34:29,468 INFO L87 Difference]: Start difference. First operand 1869 states and 5341 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:29,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:29,888 INFO L93 Difference]: Finished difference Result 1985 states and 5630 transitions. [2025-04-13 22:34:29,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:34:29,889 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:29,889 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:29,896 INFO L225 Difference]: With dead ends: 1985 [2025-04-13 22:34:29,896 INFO L226 Difference]: Without dead ends: 1866 [2025-04-13 22:34:29,897 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:34:29,897 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 196 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:29,897 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 77 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:34:29,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2025-04-13 22:34:29,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1814. [2025-04-13 22:34:29,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1814 states, 1813 states have (on average 2.85438499724214) internal successors, (5175), 1813 states have internal predecessors, (5175), 0 states have call successors, (0), 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:34:29,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 5175 transitions. [2025-04-13 22:34:29,916 INFO L79 Accepts]: Start accepts. Automaton has 1814 states and 5175 transitions. Word has length 56 [2025-04-13 22:34:29,917 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:29,917 INFO L485 AbstractCegarLoop]: Abstraction has 1814 states and 5175 transitions. [2025-04-13 22:34:29,917 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:29,917 INFO L278 IsEmpty]: Start isEmpty. Operand 1814 states and 5175 transitions. [2025-04-13 22:34:29,918 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:29,918 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:29,918 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:29,918 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2025-04-13 22:34:29,919 INFO L403 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:29,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:29,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1519419858, now seen corresponding path program 143 times [2025-04-13 22:34:29,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:29,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565870322] [2025-04-13 22:34:29,919 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:29,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:29,923 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:29,930 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:29,930 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:29,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:30,969 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:34:30,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:30,969 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565870322] [2025-04-13 22:34:30,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565870322] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:30,969 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501144927] [2025-04-13 22:34:30,969 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:30,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:30,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:30,971 INFO L229 MonitoredProcess]: Starting monitored process 48 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:34:30,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2025-04-13 22:34:31,045 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:31,062 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:31,062 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:31,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:31,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:34:31,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:31,298 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:34:31,298 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:34:31,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:34:31,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:31,537 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:34:31,537 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:34:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:31,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501144927] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:31,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:34:31,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18, 12] total 35 [2025-04-13 22:34:31,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980778306] [2025-04-13 22:34:31,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:31,560 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:31,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:31,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:31,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:34:31,560 INFO L87 Difference]: Start difference. First operand 1814 states and 5175 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:32,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:32,625 INFO L93 Difference]: Finished difference Result 2087 states and 5939 transitions. [2025-04-13 22:34:32,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 22:34:32,625 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:32,625 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:32,632 INFO L225 Difference]: With dead ends: 2087 [2025-04-13 22:34:32,633 INFO L226 Difference]: Without dead ends: 2001 [2025-04-13 22:34:32,633 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=280, Invalid=3626, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 22:34:32,633 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 341 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:32,633 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 119 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:34:32,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2025-04-13 22:34:32,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1824. [2025-04-13 22:34:32,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1823 states have (on average 2.852441031267142) internal successors, (5200), 1823 states have internal predecessors, (5200), 0 states have call successors, (0), 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:34:32,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 5200 transitions. [2025-04-13 22:34:32,658 INFO L79 Accepts]: Start accepts. Automaton has 1824 states and 5200 transitions. Word has length 56 [2025-04-13 22:34:32,658 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:32,658 INFO L485 AbstractCegarLoop]: Abstraction has 1824 states and 5200 transitions. [2025-04-13 22:34:32,658 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:32,658 INFO L278 IsEmpty]: Start isEmpty. Operand 1824 states and 5200 transitions. [2025-04-13 22:34:32,660 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:32,660 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:32,660 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:32,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2025-04-13 22:34:32,860 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:32,860 INFO L403 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:32,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:32,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2123241436, now seen corresponding path program 144 times [2025-04-13 22:34:32,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:32,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234595200] [2025-04-13 22:34:32,861 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:34:32,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:32,866 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:32,870 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:32,870 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:34:32,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:32,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:32,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:32,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234595200] [2025-04-13 22:34:32,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234595200] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:32,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:32,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:34:32,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733611718] [2025-04-13 22:34:32,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:32,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:34:32,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:32,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:34:32,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:34:32,960 INFO L87 Difference]: Start difference. First operand 1824 states and 5200 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:33,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:33,530 INFO L93 Difference]: Finished difference Result 2105 states and 5988 transitions. [2025-04-13 22:34:33,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:34:33,531 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:33,531 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:33,539 INFO L225 Difference]: With dead ends: 2105 [2025-04-13 22:34:33,539 INFO L226 Difference]: Without dead ends: 2040 [2025-04-13 22:34:33,540 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=1071, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:34:33,540 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 266 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1572 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:33,540 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 124 Invalid, 1575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1572 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:33,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2025-04-13 22:34:33,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 1829. [2025-04-13 22:34:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1828 states have (on average 2.850109409190372) internal successors, (5210), 1828 states have internal predecessors, (5210), 0 states have call successors, (0), 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:34:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 5210 transitions. [2025-04-13 22:34:33,560 INFO L79 Accepts]: Start accepts. Automaton has 1829 states and 5210 transitions. Word has length 56 [2025-04-13 22:34:33,560 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:33,560 INFO L485 AbstractCegarLoop]: Abstraction has 1829 states and 5210 transitions. [2025-04-13 22:34:33,560 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:33,561 INFO L278 IsEmpty]: Start isEmpty. Operand 1829 states and 5210 transitions. [2025-04-13 22:34:33,562 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:33,562 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:33,562 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:33,562 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2025-04-13 22:34:33,562 INFO L403 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:33,562 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:33,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1011542644, now seen corresponding path program 145 times [2025-04-13 22:34:33,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:33,563 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044989449] [2025-04-13 22:34:33,563 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:34:33,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:33,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:34:33,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:33,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:33,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:34,295 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:34:34,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:34,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044989449] [2025-04-13 22:34:34,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044989449] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:34,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686677290] [2025-04-13 22:34:34,296 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:34:34,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:34,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:34,298 INFO L229 MonitoredProcess]: Starting monitored process 49 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:34:34,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2025-04-13 22:34:34,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:34:34,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:34,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:34,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:34,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:34:34,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:34,573 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:34:34,573 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:34:34,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:34:34,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:34,783 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:34:34,784 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:34:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:34,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686677290] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:34,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:34:34,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 34 [2025-04-13 22:34:34,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816984128] [2025-04-13 22:34:34,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:34,807 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:34,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:34,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:34,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1095, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:34:34,808 INFO L87 Difference]: Start difference. First operand 1829 states and 5210 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:35,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:35,774 INFO L93 Difference]: Finished difference Result 2068 states and 5879 transitions. [2025-04-13 22:34:35,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:34:35,775 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:35,775 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:35,782 INFO L225 Difference]: With dead ends: 2068 [2025-04-13 22:34:35,783 INFO L226 Difference]: Without dead ends: 2004 [2025-04-13 22:34:35,783 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=293, Invalid=3247, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 22:34:35,783 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 275 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:35,783 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 120 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1682 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:34:35,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2025-04-13 22:34:35,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1819. [2025-04-13 22:34:35,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1819 states, 1818 states have (on average 2.852035203520352) internal successors, (5185), 1818 states have internal predecessors, (5185), 0 states have call successors, (0), 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:34:35,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 5185 transitions. [2025-04-13 22:34:35,804 INFO L79 Accepts]: Start accepts. Automaton has 1819 states and 5185 transitions. Word has length 56 [2025-04-13 22:34:35,804 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:35,804 INFO L485 AbstractCegarLoop]: Abstraction has 1819 states and 5185 transitions. [2025-04-13 22:34:35,804 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:35,804 INFO L278 IsEmpty]: Start isEmpty. Operand 1819 states and 5185 transitions. [2025-04-13 22:34:35,806 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:35,806 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:35,806 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:35,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2025-04-13 22:34:36,006 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable145 [2025-04-13 22:34:36,007 INFO L403 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:36,007 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:36,007 INFO L85 PathProgramCache]: Analyzing trace with hash 686636534, now seen corresponding path program 146 times [2025-04-13 22:34:36,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:36,007 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081752972] [2025-04-13 22:34:36,007 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:36,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:36,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:36,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:36,015 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:34:36,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:36,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:36,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:36,104 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081752972] [2025-04-13 22:34:36,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081752972] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:36,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:36,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:34:36,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564959991] [2025-04-13 22:34:36,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:36,104 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:34:36,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:36,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:34:36,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:34:36,104 INFO L87 Difference]: Start difference. First operand 1819 states and 5185 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:36,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:36,574 INFO L93 Difference]: Finished difference Result 1967 states and 5568 transitions. [2025-04-13 22:34:36,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:34:36,574 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:36,575 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:36,581 INFO L225 Difference]: With dead ends: 1967 [2025-04-13 22:34:36,581 INFO L226 Difference]: Without dead ends: 1902 [2025-04-13 22:34:36,582 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=157, Invalid=835, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:34:36,582 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 223 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:36,582 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 87 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:34:36,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2025-04-13 22:34:36,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1829. [2025-04-13 22:34:36,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1828 states have (on average 2.850109409190372) internal successors, (5210), 1828 states have internal predecessors, (5210), 0 states have call successors, (0), 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:34:36,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 5210 transitions. [2025-04-13 22:34:36,604 INFO L79 Accepts]: Start accepts. Automaton has 1829 states and 5210 transitions. Word has length 56 [2025-04-13 22:34:36,604 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:36,604 INFO L485 AbstractCegarLoop]: Abstraction has 1829 states and 5210 transitions. [2025-04-13 22:34:36,604 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:36,604 INFO L278 IsEmpty]: Start isEmpty. Operand 1829 states and 5210 transitions. [2025-04-13 22:34:36,606 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:36,606 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:36,606 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:36,606 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2025-04-13 22:34:36,606 INFO L403 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:36,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:36,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1601587742, now seen corresponding path program 147 times [2025-04-13 22:34:36,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:36,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663924558] [2025-04-13 22:34:36,606 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:34:36,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:36,610 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:36,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:36,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:34:36,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:36,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:36,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:36,703 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663924558] [2025-04-13 22:34:36,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663924558] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:36,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:36,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:34:36,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38708930] [2025-04-13 22:34:36,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:36,703 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:34:36,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:36,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:34:36,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:34:36,703 INFO L87 Difference]: Start difference. First operand 1829 states and 5210 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:37,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:37,148 INFO L93 Difference]: Finished difference Result 1956 states and 5531 transitions. [2025-04-13 22:34:37,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:34:37,148 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:37,148 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:37,155 INFO L225 Difference]: With dead ends: 1956 [2025-04-13 22:34:37,155 INFO L226 Difference]: Without dead ends: 1897 [2025-04-13 22:34:37,156 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:34:37,156 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 196 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:37,156 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 87 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:34:37,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2025-04-13 22:34:37,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1824. [2025-04-13 22:34:37,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1823 states have (on average 2.8496982995063083) internal successors, (5195), 1823 states have internal predecessors, (5195), 0 states have call successors, (0), 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:34:37,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 5195 transitions. [2025-04-13 22:34:37,176 INFO L79 Accepts]: Start accepts. Automaton has 1824 states and 5195 transitions. Word has length 56 [2025-04-13 22:34:37,176 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:37,176 INFO L485 AbstractCegarLoop]: Abstraction has 1824 states and 5195 transitions. [2025-04-13 22:34:37,176 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:37,176 INFO L278 IsEmpty]: Start isEmpty. Operand 1824 states and 5195 transitions. [2025-04-13 22:34:37,178 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:37,178 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:37,178 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:37,178 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2025-04-13 22:34:37,178 INFO L403 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:37,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:37,178 INFO L85 PathProgramCache]: Analyzing trace with hash -665024958, now seen corresponding path program 148 times [2025-04-13 22:34:37,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:37,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359412815] [2025-04-13 22:34:37,178 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:34:37,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:37,183 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:37,185 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:34:37,185 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:34:37,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:37,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:37,256 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359412815] [2025-04-13 22:34:37,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359412815] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:37,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:37,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:34:37,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383171637] [2025-04-13 22:34:37,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:37,257 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:34:37,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:37,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:34:37,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:34:37,257 INFO L87 Difference]: Start difference. First operand 1824 states and 5195 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:37,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:37,800 INFO L93 Difference]: Finished difference Result 2236 states and 6402 transitions. [2025-04-13 22:34:37,800 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:34:37,800 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:37,800 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:37,808 INFO L225 Difference]: With dead ends: 2236 [2025-04-13 22:34:37,808 INFO L226 Difference]: Without dead ends: 2112 [2025-04-13 22:34:37,808 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:34:37,809 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 230 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:37,809 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 110 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:37,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2025-04-13 22:34:37,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 1764. [2025-04-13 22:34:37,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1763 states have (on average 2.846851956891662) internal successors, (5019), 1763 states have internal predecessors, (5019), 0 states have call successors, (0), 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:34:37,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 5019 transitions. [2025-04-13 22:34:37,829 INFO L79 Accepts]: Start accepts. Automaton has 1764 states and 5019 transitions. Word has length 56 [2025-04-13 22:34:37,829 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:37,829 INFO L485 AbstractCegarLoop]: Abstraction has 1764 states and 5019 transitions. [2025-04-13 22:34:37,829 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:37,829 INFO L278 IsEmpty]: Start isEmpty. Operand 1764 states and 5019 transitions. [2025-04-13 22:34:37,831 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:37,831 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:37,831 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:37,831 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2025-04-13 22:34:37,831 INFO L403 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:37,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:37,831 INFO L85 PathProgramCache]: Analyzing trace with hash 110234670, now seen corresponding path program 149 times [2025-04-13 22:34:37,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:37,831 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162837793] [2025-04-13 22:34:37,831 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:37,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:37,835 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:37,851 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:37,851 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:37,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:39,005 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:34:39,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:39,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162837793] [2025-04-13 22:34:39,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162837793] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:39,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281458674] [2025-04-13 22:34:39,006 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:39,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:39,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:39,008 INFO L229 MonitoredProcess]: Starting monitored process 50 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:34:39,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2025-04-13 22:34:39,084 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:39,102 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:39,102 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:39,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:39,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:34:39,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:39,326 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:34:39,327 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:34:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:39,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:34:39,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281458674] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:39,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:34:39,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 25 [2025-04-13 22:34:39,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627084788] [2025-04-13 22:34:39,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:39,330 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:39,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:39,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:39,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=598, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:34:39,330 INFO L87 Difference]: Start difference. First operand 1764 states and 5019 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:40,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:40,280 INFO L93 Difference]: Finished difference Result 1892 states and 5342 transitions. [2025-04-13 22:34:40,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:34:40,280 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:40,280 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:40,288 INFO L225 Difference]: With dead ends: 1892 [2025-04-13 22:34:40,288 INFO L226 Difference]: Without dead ends: 1785 [2025-04-13 22:34:40,288 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=1643, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:34:40,288 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 193 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:40,288 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 68 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:34:40,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2025-04-13 22:34:40,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1764. [2025-04-13 22:34:40,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1763 states have (on average 2.8411798071469088) internal successors, (5009), 1763 states have internal predecessors, (5009), 0 states have call successors, (0), 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:34:40,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 5009 transitions. [2025-04-13 22:34:40,308 INFO L79 Accepts]: Start accepts. Automaton has 1764 states and 5009 transitions. Word has length 56 [2025-04-13 22:34:40,308 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:40,308 INFO L485 AbstractCegarLoop]: Abstraction has 1764 states and 5009 transitions. [2025-04-13 22:34:40,308 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:40,309 INFO L278 IsEmpty]: Start isEmpty. Operand 1764 states and 5009 transitions. [2025-04-13 22:34:40,310 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:40,310 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:40,310 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:40,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2025-04-13 22:34:40,510 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable149 [2025-04-13 22:34:40,511 INFO L403 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:40,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:40,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1549580844, now seen corresponding path program 150 times [2025-04-13 22:34:40,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:40,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521975107] [2025-04-13 22:34:40,511 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:34:40,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:40,515 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:40,519 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:40,519 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:34:40,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:40,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:40,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521975107] [2025-04-13 22:34:40,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521975107] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:40,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:40,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:34:40,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122399969] [2025-04-13 22:34:40,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:40,627 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:40,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:40,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:40,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:40,627 INFO L87 Difference]: Start difference. First operand 1764 states and 5009 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:41,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:41,058 INFO L93 Difference]: Finished difference Result 1881 states and 5305 transitions. [2025-04-13 22:34:41,058 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:34:41,058 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:41,058 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:41,066 INFO L225 Difference]: With dead ends: 1881 [2025-04-13 22:34:41,066 INFO L226 Difference]: Without dead ends: 1816 [2025-04-13 22:34:41,066 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:34:41,066 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 177 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:41,066 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 70 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:34:41,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2025-04-13 22:34:41,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1769. [2025-04-13 22:34:41,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1768 states have (on average 2.8388009049773757) internal successors, (5019), 1768 states have internal predecessors, (5019), 0 states have call successors, (0), 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:34:41,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 5019 transitions. [2025-04-13 22:34:41,086 INFO L79 Accepts]: Start accepts. Automaton has 1769 states and 5019 transitions. Word has length 56 [2025-04-13 22:34:41,086 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:41,086 INFO L485 AbstractCegarLoop]: Abstraction has 1769 states and 5019 transitions. [2025-04-13 22:34:41,086 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:41,087 INFO L278 IsEmpty]: Start isEmpty. Operand 1769 states and 5019 transitions. [2025-04-13 22:34:41,088 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:41,088 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:41,088 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:41,088 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2025-04-13 22:34:41,088 INFO L403 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:41,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:41,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1130967582, now seen corresponding path program 151 times [2025-04-13 22:34:41,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:41,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333645901] [2025-04-13 22:34:41,089 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:34:41,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:41,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:34:41,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:41,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:41,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:41,832 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:34:41,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:41,832 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333645901] [2025-04-13 22:34:41,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333645901] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:41,832 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472098235] [2025-04-13 22:34:41,833 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:34:41,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:41,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:41,834 INFO L229 MonitoredProcess]: Starting monitored process 51 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:34:41,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2025-04-13 22:34:41,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:34:41,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:41,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:41,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:41,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:34:41,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:42,108 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:34:42,108 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:34:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:34:42,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:42,324 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:34:42,324 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:34:42,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:42,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472098235] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:42,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:34:42,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 34 [2025-04-13 22:34:42,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309096161] [2025-04-13 22:34:42,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:42,353 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:42,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:42,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:42,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1101, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:34:42,353 INFO L87 Difference]: Start difference. First operand 1769 states and 5019 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:42,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:42,971 INFO L93 Difference]: Finished difference Result 1844 states and 5186 transitions. [2025-04-13 22:34:42,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:34:42,971 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:42,971 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:42,978 INFO L225 Difference]: With dead ends: 1844 [2025-04-13 22:34:42,978 INFO L226 Difference]: Without dead ends: 1775 [2025-04-13 22:34:42,979 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=199, Invalid=2351, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:34:42,979 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 161 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:42,979 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 67 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:34:42,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2025-04-13 22:34:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1764. [2025-04-13 22:34:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1763 states have (on average 2.838343732274532) internal successors, (5004), 1763 states have internal predecessors, (5004), 0 states have call successors, (0), 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:34:42,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 5004 transitions. [2025-04-13 22:34:42,999 INFO L79 Accepts]: Start accepts. Automaton has 1764 states and 5004 transitions. Word has length 56 [2025-04-13 22:34:42,999 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:42,999 INFO L485 AbstractCegarLoop]: Abstraction has 1764 states and 5004 transitions. [2025-04-13 22:34:42,999 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:42,999 INFO L278 IsEmpty]: Start isEmpty. Operand 1764 states and 5004 transitions. [2025-04-13 22:34:43,001 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:43,001 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:43,001 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:43,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2025-04-13 22:34:43,201 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:43,202 INFO L403 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:43,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:43,202 INFO L85 PathProgramCache]: Analyzing trace with hash -327595812, now seen corresponding path program 152 times [2025-04-13 22:34:43,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:43,202 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626623082] [2025-04-13 22:34:43,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:43,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:43,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:43,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:43,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:34:43,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:43,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:43,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:43,313 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626623082] [2025-04-13 22:34:43,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626623082] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:43,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:43,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:34:43,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713743699] [2025-04-13 22:34:43,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:43,313 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:43,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:43,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:43,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:43,314 INFO L87 Difference]: Start difference. First operand 1764 states and 5004 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:43,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:43,897 INFO L93 Difference]: Finished difference Result 2054 states and 5847 transitions. [2025-04-13 22:34:43,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:34:43,897 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:43,897 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:43,905 INFO L225 Difference]: With dead ends: 2054 [2025-04-13 22:34:43,905 INFO L226 Difference]: Without dead ends: 1990 [2025-04-13 22:34:43,906 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:34:43,906 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 264 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:43,906 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 151 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1740 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:43,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2025-04-13 22:34:43,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1754. [2025-04-13 22:34:43,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1754 states, 1753 states have (on average 2.840273816314889) internal successors, (4979), 1753 states have internal predecessors, (4979), 0 states have call successors, (0), 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:34:43,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 4979 transitions. [2025-04-13 22:34:43,927 INFO L79 Accepts]: Start accepts. Automaton has 1754 states and 4979 transitions. Word has length 56 [2025-04-13 22:34:43,927 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:43,927 INFO L485 AbstractCegarLoop]: Abstraction has 1754 states and 4979 transitions. [2025-04-13 22:34:43,927 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:43,927 INFO L278 IsEmpty]: Start isEmpty. Operand 1754 states and 4979 transitions. [2025-04-13 22:34:43,929 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:43,929 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:43,929 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:43,929 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2025-04-13 22:34:43,929 INFO L403 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:43,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:43,929 INFO L85 PathProgramCache]: Analyzing trace with hash -372900050, now seen corresponding path program 153 times [2025-04-13 22:34:43,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:43,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356436313] [2025-04-13 22:34:43,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:34:43,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:43,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:43,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:43,938 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:34:43,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:44,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:44,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:44,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356436313] [2025-04-13 22:34:44,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356436313] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:44,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:44,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:34:44,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997918130] [2025-04-13 22:34:44,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:44,033 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:44,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:44,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:44,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:44,033 INFO L87 Difference]: Start difference. First operand 1754 states and 4979 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:44,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:44,508 INFO L93 Difference]: Finished difference Result 1871 states and 5275 transitions. [2025-04-13 22:34:44,508 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:34:44,508 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:44,508 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:44,516 INFO L225 Difference]: With dead ends: 1871 [2025-04-13 22:34:44,516 INFO L226 Difference]: Without dead ends: 1806 [2025-04-13 22:34:44,516 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:34:44,516 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 232 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:44,516 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 90 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:34:44,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2025-04-13 22:34:44,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1764. [2025-04-13 22:34:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1763 states have (on average 2.838343732274532) internal successors, (5004), 1763 states have internal predecessors, (5004), 0 states have call successors, (0), 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:34:44,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 5004 transitions. [2025-04-13 22:34:44,536 INFO L79 Accepts]: Start accepts. Automaton has 1764 states and 5004 transitions. Word has length 56 [2025-04-13 22:34:44,537 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:44,537 INFO L485 AbstractCegarLoop]: Abstraction has 1764 states and 5004 transitions. [2025-04-13 22:34:44,537 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:44,537 INFO L278 IsEmpty]: Start isEmpty. Operand 1764 states and 5004 transitions. [2025-04-13 22:34:44,538 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:44,538 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:44,538 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:44,538 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2025-04-13 22:34:44,539 INFO L403 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:44,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:44,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1812685138, now seen corresponding path program 154 times [2025-04-13 22:34:44,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:44,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304133067] [2025-04-13 22:34:44,539 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:34:44,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:44,544 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:44,546 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:34:44,546 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:34:44,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:44,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:44,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:44,622 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304133067] [2025-04-13 22:34:44,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304133067] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:44,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:44,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:34:44,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689662703] [2025-04-13 22:34:44,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:44,622 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:44,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:44,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:44,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:44,623 INFO L87 Difference]: Start difference. First operand 1764 states and 5004 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:45,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:45,079 INFO L93 Difference]: Finished difference Result 1860 states and 5238 transitions. [2025-04-13 22:34:45,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:34:45,079 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:45,080 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:45,087 INFO L225 Difference]: With dead ends: 1860 [2025-04-13 22:34:45,087 INFO L226 Difference]: Without dead ends: 1801 [2025-04-13 22:34:45,088 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:34:45,088 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 200 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:45,088 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 90 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:34:45,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2025-04-13 22:34:45,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1759. [2025-04-13 22:34:45,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1758 states have (on average 2.8378839590443685) internal successors, (4989), 1758 states have internal predecessors, (4989), 0 states have call successors, (0), 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:34:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 4989 transitions. [2025-04-13 22:34:45,108 INFO L79 Accepts]: Start accepts. Automaton has 1759 states and 4989 transitions. Word has length 56 [2025-04-13 22:34:45,108 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:45,108 INFO L485 AbstractCegarLoop]: Abstraction has 1759 states and 4989 transitions. [2025-04-13 22:34:45,108 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:45,108 INFO L278 IsEmpty]: Start isEmpty. Operand 1759 states and 4989 transitions. [2025-04-13 22:34:45,110 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:45,110 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:45,110 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:45,110 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2025-04-13 22:34:45,110 INFO L403 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:45,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:45,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1486732848, now seen corresponding path program 155 times [2025-04-13 22:34:45,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:45,110 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929469222] [2025-04-13 22:34:45,110 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:45,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:45,114 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:45,121 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:45,121 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:45,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:45,751 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:34:45,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:45,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929469222] [2025-04-13 22:34:45,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929469222] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:45,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943771575] [2025-04-13 22:34:45,751 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:45,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:45,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:45,753 INFO L229 MonitoredProcess]: Starting monitored process 52 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:34:45,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2025-04-13 22:34:45,832 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:45,852 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:45,853 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:45,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:45,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:34:45,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:46,032 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:34:46,032 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:34:46,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:46,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:34:46,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943771575] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:46,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:34:46,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 24 [2025-04-13 22:34:46,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473584173] [2025-04-13 22:34:46,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:46,038 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:46,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:46,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:46,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:34:46,038 INFO L87 Difference]: Start difference. First operand 1759 states and 4989 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:46,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:46,850 INFO L93 Difference]: Finished difference Result 1834 states and 5161 transitions. [2025-04-13 22:34:46,851 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:34:46,851 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:46,851 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:46,858 INFO L225 Difference]: With dead ends: 1834 [2025-04-13 22:34:46,858 INFO L226 Difference]: Without dead ends: 1695 [2025-04-13 22:34:46,859 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=1641, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:34:46,859 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 181 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:46,859 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 67 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:34:46,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2025-04-13 22:34:46,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1684. [2025-04-13 22:34:46,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 2.8639334521687463) internal successors, (4820), 1683 states have internal predecessors, (4820), 0 states have call successors, (0), 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:34:46,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 4820 transitions. [2025-04-13 22:34:46,878 INFO L79 Accepts]: Start accepts. Automaton has 1684 states and 4820 transitions. Word has length 56 [2025-04-13 22:34:46,878 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:46,878 INFO L485 AbstractCegarLoop]: Abstraction has 1684 states and 4820 transitions. [2025-04-13 22:34:46,878 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:46,878 INFO L278 IsEmpty]: Start isEmpty. Operand 1684 states and 4820 transitions. [2025-04-13 22:34:46,880 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:46,880 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:46,880 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:46,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2025-04-13 22:34:47,080 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable155 [2025-04-13 22:34:47,080 INFO L403 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:47,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:47,081 INFO L85 PathProgramCache]: Analyzing trace with hash -2096303468, now seen corresponding path program 156 times [2025-04-13 22:34:47,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:47,081 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298632467] [2025-04-13 22:34:47,081 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:34:47,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:47,099 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:47,103 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:47,103 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:34:47,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:47,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:47,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:47,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298632467] [2025-04-13 22:34:47,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298632467] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:47,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:47,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:34:47,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216955211] [2025-04-13 22:34:47,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:47,196 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:34:47,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:47,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:34:47,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:34:47,196 INFO L87 Difference]: Start difference. First operand 1684 states and 4820 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:47,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:47,661 INFO L93 Difference]: Finished difference Result 2133 states and 6029 transitions. [2025-04-13 22:34:47,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:34:47,661 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:47,661 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:47,670 INFO L225 Difference]: With dead ends: 2133 [2025-04-13 22:34:47,670 INFO L226 Difference]: Without dead ends: 2068 [2025-04-13 22:34:47,670 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:34:47,670 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 295 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:47,670 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 76 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:34:47,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2025-04-13 22:34:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 1814. [2025-04-13 22:34:47,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1814 states, 1813 states have (on average 2.853281853281853) internal successors, (5173), 1813 states have internal predecessors, (5173), 0 states have call successors, (0), 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:34:47,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 5173 transitions. [2025-04-13 22:34:47,691 INFO L79 Accepts]: Start accepts. Automaton has 1814 states and 5173 transitions. Word has length 56 [2025-04-13 22:34:47,691 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:47,691 INFO L485 AbstractCegarLoop]: Abstraction has 1814 states and 5173 transitions. [2025-04-13 22:34:47,692 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:47,692 INFO L278 IsEmpty]: Start isEmpty. Operand 1814 states and 5173 transitions. [2025-04-13 22:34:47,693 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:47,693 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:47,693 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:47,693 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2025-04-13 22:34:47,693 INFO L403 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:47,694 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:47,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1414646046, now seen corresponding path program 157 times [2025-04-13 22:34:47,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:47,694 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131823041] [2025-04-13 22:34:47,694 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:34:47,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:47,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:34:47,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:47,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:47,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:48,336 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:34:48,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:48,336 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131823041] [2025-04-13 22:34:48,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131823041] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:48,337 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501179866] [2025-04-13 22:34:48,337 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:34:48,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:48,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:48,338 INFO L229 MonitoredProcess]: Starting monitored process 53 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:34:48,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2025-04-13 22:34:48,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:34:48,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:48,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:48,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:48,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:34:48,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:48,595 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:34:48,595 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:34:48,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:34:48,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:48,765 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:34:48,765 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:34:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:48,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501179866] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:48,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:34:48,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 31 [2025-04-13 22:34:48,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187854619] [2025-04-13 22:34:48,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:48,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:48,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:48,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:48,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=905, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:34:48,789 INFO L87 Difference]: Start difference. First operand 1814 states and 5173 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:49,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:49,518 INFO L93 Difference]: Finished difference Result 2122 states and 5992 transitions. [2025-04-13 22:34:49,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:34:49,518 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:49,518 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:49,526 INFO L225 Difference]: With dead ends: 2122 [2025-04-13 22:34:49,526 INFO L226 Difference]: Without dead ends: 2063 [2025-04-13 22:34:49,527 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=241, Invalid=2621, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:34:49,527 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 318 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:49,527 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 76 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:49,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2025-04-13 22:34:49,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 1809. [2025-04-13 22:34:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 2.85287610619469) internal successors, (5158), 1808 states have internal predecessors, (5158), 0 states have call successors, (0), 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:34:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 5158 transitions. [2025-04-13 22:34:49,548 INFO L79 Accepts]: Start accepts. Automaton has 1809 states and 5158 transitions. Word has length 56 [2025-04-13 22:34:49,548 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:49,548 INFO L485 AbstractCegarLoop]: Abstraction has 1809 states and 5158 transitions. [2025-04-13 22:34:49,548 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:49,548 INFO L278 IsEmpty]: Start isEmpty. Operand 1809 states and 5158 transitions. [2025-04-13 22:34:49,549 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:49,549 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:49,550 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:49,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2025-04-13 22:34:49,750 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable157 [2025-04-13 22:34:49,750 INFO L403 AbstractCegarLoop]: === Iteration 159 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:49,750 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:49,750 INFO L85 PathProgramCache]: Analyzing trace with hash 847002336, now seen corresponding path program 158 times [2025-04-13 22:34:49,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:49,750 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348217966] [2025-04-13 22:34:49,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:49,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:49,755 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:49,758 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:49,758 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:34:49,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:49,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:49,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:49,851 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348217966] [2025-04-13 22:34:49,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348217966] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:49,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:49,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:34:49,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021800212] [2025-04-13 22:34:49,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:49,851 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:34:49,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:49,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:34:49,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:34:49,852 INFO L87 Difference]: Start difference. First operand 1809 states and 5158 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:50,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:50,295 INFO L93 Difference]: Finished difference Result 2096 states and 5915 transitions. [2025-04-13 22:34:50,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:34:50,295 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:50,295 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:50,303 INFO L225 Difference]: With dead ends: 2096 [2025-04-13 22:34:50,303 INFO L226 Difference]: Without dead ends: 1977 [2025-04-13 22:34:50,303 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:34:50,303 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 249 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:50,303 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 75 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:34:50,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2025-04-13 22:34:50,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1754. [2025-04-13 22:34:50,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1754 states, 1753 states have (on average 2.847689674843126) internal successors, (4992), 1753 states have internal predecessors, (4992), 0 states have call successors, (0), 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:34:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 4992 transitions. [2025-04-13 22:34:50,323 INFO L79 Accepts]: Start accepts. Automaton has 1754 states and 4992 transitions. Word has length 56 [2025-04-13 22:34:50,323 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:50,323 INFO L485 AbstractCegarLoop]: Abstraction has 1754 states and 4992 transitions. [2025-04-13 22:34:50,323 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:50,323 INFO L278 IsEmpty]: Start isEmpty. Operand 1754 states and 4992 transitions. [2025-04-13 22:34:50,325 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:50,325 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:50,325 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:50,325 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2025-04-13 22:34:50,325 INFO L403 AbstractCegarLoop]: === Iteration 160 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:50,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:50,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1027896592, now seen corresponding path program 159 times [2025-04-13 22:34:50,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:50,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365953563] [2025-04-13 22:34:50,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:34:50,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:50,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:50,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:50,334 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:34:50,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:50,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:50,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:50,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365953563] [2025-04-13 22:34:50,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365953563] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:50,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:50,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:34:50,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37844452] [2025-04-13 22:34:50,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:50,441 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:34:50,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:50,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:34:50,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:34:50,441 INFO L87 Difference]: Start difference. First operand 1754 states and 4992 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:50,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:50,984 INFO L93 Difference]: Finished difference Result 2022 states and 5696 transitions. [2025-04-13 22:34:50,985 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 22:34:50,985 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:50,985 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:50,992 INFO L225 Difference]: With dead ends: 2022 [2025-04-13 22:34:50,992 INFO L226 Difference]: Without dead ends: 1936 [2025-04-13 22:34:50,993 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=217, Invalid=1189, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:34:50,993 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 307 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:50,993 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 103 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:50,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2025-04-13 22:34:51,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1764. [2025-04-13 22:34:51,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1763 states have (on average 2.8457175269427113) internal successors, (5017), 1763 states have internal predecessors, (5017), 0 states have call successors, (0), 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:34:51,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 5017 transitions. [2025-04-13 22:34:51,014 INFO L79 Accepts]: Start accepts. Automaton has 1764 states and 5017 transitions. Word has length 56 [2025-04-13 22:34:51,014 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:51,014 INFO L485 AbstractCegarLoop]: Abstraction has 1764 states and 5017 transitions. [2025-04-13 22:34:51,014 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:51,014 INFO L278 IsEmpty]: Start isEmpty. Operand 1764 states and 5017 transitions. [2025-04-13 22:34:51,015 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:51,016 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:51,016 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:51,016 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2025-04-13 22:34:51,016 INFO L403 AbstractCegarLoop]: === Iteration 161 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:51,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:51,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1789770938, now seen corresponding path program 160 times [2025-04-13 22:34:51,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:51,016 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452511706] [2025-04-13 22:34:51,016 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:34:51,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:51,020 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:51,023 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:34:51,023 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:34:51,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:51,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:51,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:51,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452511706] [2025-04-13 22:34:51,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452511706] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:51,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:51,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:34:51,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863064300] [2025-04-13 22:34:51,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:51,094 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:34:51,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:51,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:34:51,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:34:51,095 INFO L87 Difference]: Start difference. First operand 1764 states and 5017 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:51,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:51,615 INFO L93 Difference]: Finished difference Result 2032 states and 5721 transitions. [2025-04-13 22:34:51,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 22:34:51,615 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:51,615 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:51,623 INFO L225 Difference]: With dead ends: 2032 [2025-04-13 22:34:51,623 INFO L226 Difference]: Without dead ends: 1967 [2025-04-13 22:34:51,623 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=221, Invalid=1185, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:34:51,623 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 265 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:51,624 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 100 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:51,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2025-04-13 22:34:51,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1769. [2025-04-13 22:34:51,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1768 states have (on average 2.8433257918552037) internal successors, (5027), 1768 states have internal predecessors, (5027), 0 states have call successors, (0), 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:34:51,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 5027 transitions. [2025-04-13 22:34:51,643 INFO L79 Accepts]: Start accepts. Automaton has 1769 states and 5027 transitions. Word has length 56 [2025-04-13 22:34:51,643 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:51,643 INFO L485 AbstractCegarLoop]: Abstraction has 1769 states and 5027 transitions. [2025-04-13 22:34:51,643 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:51,643 INFO L278 IsEmpty]: Start isEmpty. Operand 1769 states and 5027 transitions. [2025-04-13 22:34:51,645 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:51,645 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:51,645 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:51,645 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2025-04-13 22:34:51,645 INFO L403 AbstractCegarLoop]: === Iteration 162 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:51,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:51,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1535773806, now seen corresponding path program 161 times [2025-04-13 22:34:51,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:51,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267554428] [2025-04-13 22:34:51,646 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:51,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:51,650 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:51,657 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:51,657 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:51,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:52,681 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:34:52,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:52,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267554428] [2025-04-13 22:34:52,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267554428] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:52,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292764447] [2025-04-13 22:34:52,681 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:52,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:52,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:52,684 INFO L229 MonitoredProcess]: Starting monitored process 54 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:34:52,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2025-04-13 22:34:52,766 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:52,785 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:52,785 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:52,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:52,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:34:52,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:52,995 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:34:52,995 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:34:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:34:53,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:53,193 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:34:53,194 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:34:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:53,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292764447] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:53,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:34:53,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18, 12] total 33 [2025-04-13 22:34:53,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121964681] [2025-04-13 22:34:53,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:53,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:53,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:53,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:53,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1042, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:34:53,219 INFO L87 Difference]: Start difference. First operand 1769 states and 5027 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:54,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:54,077 INFO L93 Difference]: Finished difference Result 1995 states and 5612 transitions. [2025-04-13 22:34:54,077 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:34:54,077 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:54,077 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:54,085 INFO L225 Difference]: With dead ends: 1995 [2025-04-13 22:34:54,085 INFO L226 Difference]: Without dead ends: 1931 [2025-04-13 22:34:54,085 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=264, Invalid=3158, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 22:34:54,086 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 260 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:54,086 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 97 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:54,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2025-04-13 22:34:54,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1759. [2025-04-13 22:34:54,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1758 states have (on average 2.845278725824801) internal successors, (5002), 1758 states have internal predecessors, (5002), 0 states have call successors, (0), 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:34:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 5002 transitions. [2025-04-13 22:34:54,106 INFO L79 Accepts]: Start accepts. Automaton has 1759 states and 5002 transitions. Word has length 56 [2025-04-13 22:34:54,106 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:54,106 INFO L485 AbstractCegarLoop]: Abstraction has 1759 states and 5002 transitions. [2025-04-13 22:34:54,106 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:54,106 INFO L278 IsEmpty]: Start isEmpty. Operand 1759 states and 5002 transitions. [2025-04-13 22:34:54,108 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:54,108 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:54,108 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:54,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2025-04-13 22:34:54,308 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161,54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:54,308 INFO L403 AbstractCegarLoop]: === Iteration 163 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:54,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:54,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1020107032, now seen corresponding path program 162 times [2025-04-13 22:34:54,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:54,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140737354] [2025-04-13 22:34:54,308 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:34:54,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:54,313 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:54,317 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:54,317 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:34:54,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:54,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:54,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:54,406 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140737354] [2025-04-13 22:34:54,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140737354] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:54,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:54,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:34:54,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329013100] [2025-04-13 22:34:54,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:54,407 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:34:54,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:54,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:34:54,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:34:54,407 INFO L87 Difference]: Start difference. First operand 1759 states and 5002 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:54,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:54,892 INFO L93 Difference]: Finished difference Result 2037 states and 5736 transitions. [2025-04-13 22:34:54,893 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:34:54,893 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:54,893 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:54,900 INFO L225 Difference]: With dead ends: 2037 [2025-04-13 22:34:54,900 INFO L226 Difference]: Without dead ends: 1972 [2025-04-13 22:34:54,901 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=1002, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:34:54,901 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 250 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:54,901 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 87 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:34:54,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2025-04-13 22:34:54,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1769. [2025-04-13 22:34:54,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1768 states have (on average 2.8433257918552037) internal successors, (5027), 1768 states have internal predecessors, (5027), 0 states have call successors, (0), 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:34:54,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 5027 transitions. [2025-04-13 22:34:54,921 INFO L79 Accepts]: Start accepts. Automaton has 1769 states and 5027 transitions. Word has length 56 [2025-04-13 22:34:54,921 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:54,921 INFO L485 AbstractCegarLoop]: Abstraction has 1769 states and 5027 transitions. [2025-04-13 22:34:54,921 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:54,921 INFO L278 IsEmpty]: Start isEmpty. Operand 1769 states and 5027 transitions. [2025-04-13 22:34:54,923 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:54,923 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:54,923 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:54,923 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2025-04-13 22:34:54,923 INFO L403 AbstractCegarLoop]: === Iteration 164 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:54,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:54,924 INFO L85 PathProgramCache]: Analyzing trace with hash 146063104, now seen corresponding path program 163 times [2025-04-13 22:34:54,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:54,924 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322977657] [2025-04-13 22:34:54,924 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:34:54,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:54,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:34:54,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:54,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:54,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:55,687 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:34:55,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:55,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322977657] [2025-04-13 22:34:55,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322977657] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:55,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31790906] [2025-04-13 22:34:55,688 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:34:55,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:55,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:55,689 INFO L229 MonitoredProcess]: Starting monitored process 55 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:34:55,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2025-04-13 22:34:55,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:34:55,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:55,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:55,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:55,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:34:55,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:55,952 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:34:55,952 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:34:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:34:55,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:56,159 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:34:56,160 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:34:56,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:56,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31790906] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:56,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:34:56,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 34 [2025-04-13 22:34:56,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501541959] [2025-04-13 22:34:56,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:56,184 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:56,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:56,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:56,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1097, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:34:56,184 INFO L87 Difference]: Start difference. First operand 1769 states and 5027 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:56,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:56,976 INFO L93 Difference]: Finished difference Result 2026 states and 5699 transitions. [2025-04-13 22:34:56,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:34:56,977 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:56,977 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:56,984 INFO L225 Difference]: With dead ends: 2026 [2025-04-13 22:34:56,984 INFO L226 Difference]: Without dead ends: 1967 [2025-04-13 22:34:56,984 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=257, Invalid=2935, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:34:56,984 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 250 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:56,985 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 84 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1313 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:56,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2025-04-13 22:34:56,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1764. [2025-04-13 22:34:56,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1763 states have (on average 2.8428814520703347) internal successors, (5012), 1763 states have internal predecessors, (5012), 0 states have call successors, (0), 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:34:57,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 5012 transitions. [2025-04-13 22:34:57,005 INFO L79 Accepts]: Start accepts. Automaton has 1764 states and 5012 transitions. Word has length 56 [2025-04-13 22:34:57,005 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:57,005 INFO L485 AbstractCegarLoop]: Abstraction has 1764 states and 5012 transitions. [2025-04-13 22:34:57,005 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:57,005 INFO L278 IsEmpty]: Start isEmpty. Operand 1764 states and 5012 transitions. [2025-04-13 22:34:57,006 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:57,006 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:57,006 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:57,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2025-04-13 22:34:57,207 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:57,207 INFO L403 AbstractCegarLoop]: === Iteration 165 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:57,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:57,207 INFO L85 PathProgramCache]: Analyzing trace with hash -331554460, now seen corresponding path program 164 times [2025-04-13 22:34:57,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:57,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299118745] [2025-04-13 22:34:57,207 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:57,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:57,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:57,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:57,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:34:57,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:57,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:57,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299118745] [2025-04-13 22:34:57,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299118745] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:57,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:57,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:34:57,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478864100] [2025-04-13 22:34:57,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:57,305 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:34:57,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:57,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:34:57,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:34:57,306 INFO L87 Difference]: Start difference. First operand 1764 states and 5012 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:57,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:57,868 INFO L93 Difference]: Finished difference Result 2306 states and 6570 transitions. [2025-04-13 22:34:57,868 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:34:57,868 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:57,868 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:57,876 INFO L225 Difference]: With dead ends: 2306 [2025-04-13 22:34:57,876 INFO L226 Difference]: Without dead ends: 2182 [2025-04-13 22:34:57,877 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:34:57,877 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 249 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1576 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:57,877 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 110 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1576 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:57,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2025-04-13 22:34:57,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 1704. [2025-04-13 22:34:57,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1703 states have (on average 2.8631826189078096) internal successors, (4876), 1703 states have internal predecessors, (4876), 0 states have call successors, (0), 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:34:57,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 4876 transitions. [2025-04-13 22:34:57,898 INFO L79 Accepts]: Start accepts. Automaton has 1704 states and 4876 transitions. Word has length 56 [2025-04-13 22:34:57,898 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:57,898 INFO L485 AbstractCegarLoop]: Abstraction has 1704 states and 4876 transitions. [2025-04-13 22:34:57,898 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:57,898 INFO L278 IsEmpty]: Start isEmpty. Operand 1704 states and 4876 transitions. [2025-04-13 22:34:57,900 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:57,900 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:57,900 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:57,900 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2025-04-13 22:34:57,900 INFO L403 AbstractCegarLoop]: === Iteration 166 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:57,900 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:57,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1626285686, now seen corresponding path program 165 times [2025-04-13 22:34:57,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:57,900 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801830457] [2025-04-13 22:34:57,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:34:57,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:57,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:57,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:34:57,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:34:57,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:58,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:58,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:58,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801830457] [2025-04-13 22:34:58,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801830457] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:58,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:58,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:34:58,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359621717] [2025-04-13 22:34:58,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:58,012 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:58,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:58,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:58,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:58,012 INFO L87 Difference]: Start difference. First operand 1704 states and 4876 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:58,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:58,498 INFO L93 Difference]: Finished difference Result 1982 states and 5610 transitions. [2025-04-13 22:34:58,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:34:58,499 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:58,499 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:58,506 INFO L225 Difference]: With dead ends: 1982 [2025-04-13 22:34:58,506 INFO L226 Difference]: Without dead ends: 1917 [2025-04-13 22:34:58,507 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=895, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:34:58,507 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 255 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:58,507 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 87 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:34:58,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2025-04-13 22:34:58,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1774. [2025-04-13 22:34:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1773 states have (on average 2.8369994359842075) internal successors, (5030), 1773 states have internal predecessors, (5030), 0 states have call successors, (0), 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:34:58,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 5030 transitions. [2025-04-13 22:34:58,527 INFO L79 Accepts]: Start accepts. Automaton has 1774 states and 5030 transitions. Word has length 56 [2025-04-13 22:34:58,527 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:58,527 INFO L485 AbstractCegarLoop]: Abstraction has 1774 states and 5030 transitions. [2025-04-13 22:34:58,527 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:58,527 INFO L278 IsEmpty]: Start isEmpty. Operand 1774 states and 5030 transitions. [2025-04-13 22:34:58,529 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:58,529 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:58,529 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:58,529 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2025-04-13 22:34:58,529 INFO L403 AbstractCegarLoop]: === Iteration 167 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:58,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:58,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1768838254, now seen corresponding path program 166 times [2025-04-13 22:34:58,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:58,529 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198502413] [2025-04-13 22:34:58,529 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:34:58,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:58,533 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:58,536 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:34:58,536 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:34:58,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:34:58,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:58,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198502413] [2025-04-13 22:34:58,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198502413] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:58,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:58,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:34:58,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058436547] [2025-04-13 22:34:58,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:58,609 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:58,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:58,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:58,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:58,609 INFO L87 Difference]: Start difference. First operand 1774 states and 5030 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:59,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:59,084 INFO L93 Difference]: Finished difference Result 1971 states and 5573 transitions. [2025-04-13 22:34:59,084 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:34:59,084 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:34:59,084 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:59,103 INFO L225 Difference]: With dead ends: 1971 [2025-04-13 22:34:59,103 INFO L226 Difference]: Without dead ends: 1912 [2025-04-13 22:34:59,104 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:34:59,104 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 217 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:59,104 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 86 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:34:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2025-04-13 22:34:59,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1769. [2025-04-13 22:34:59,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1768 states have (on average 2.8365384615384617) internal successors, (5015), 1768 states have internal predecessors, (5015), 0 states have call successors, (0), 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:34:59,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 5015 transitions. [2025-04-13 22:34:59,124 INFO L79 Accepts]: Start accepts. Automaton has 1769 states and 5015 transitions. Word has length 56 [2025-04-13 22:34:59,124 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:59,124 INFO L485 AbstractCegarLoop]: Abstraction has 1769 states and 5015 transitions. [2025-04-13 22:34:59,124 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:34:59,124 INFO L278 IsEmpty]: Start isEmpty. Operand 1769 states and 5015 transitions. [2025-04-13 22:34:59,126 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:34:59,126 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:59,126 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:59,126 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2025-04-13 22:34:59,126 INFO L403 AbstractCegarLoop]: === Iteration 168 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:34:59,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:59,126 INFO L85 PathProgramCache]: Analyzing trace with hash 233347212, now seen corresponding path program 167 times [2025-04-13 22:34:59,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:59,126 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170820674] [2025-04-13 22:34:59,126 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:59,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:59,131 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:59,138 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:59,138 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:59,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:59,770 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:34:59,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:59,770 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170820674] [2025-04-13 22:34:59,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170820674] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:59,771 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829678831] [2025-04-13 22:34:59,771 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:59,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:59,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:59,772 INFO L229 MonitoredProcess]: Starting monitored process 56 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:34:59,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2025-04-13 22:34:59,854 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:34:59,872 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:34:59,872 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:59,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:59,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:34:59,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:00,051 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:00,051 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:35:00,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:00,057 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:35:00,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829678831] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:00,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:35:00,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 24 [2025-04-13 22:35:00,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680831986] [2025-04-13 22:35:00,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:00,057 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:00,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:00,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:00,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:35:00,057 INFO L87 Difference]: Start difference. First operand 1769 states and 5015 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:00,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:00,976 INFO L93 Difference]: Finished difference Result 1945 states and 5496 transitions. [2025-04-13 22:35:00,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:35:00,976 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:00,977 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:00,984 INFO L225 Difference]: With dead ends: 1945 [2025-04-13 22:35:00,984 INFO L226 Difference]: Without dead ends: 1806 [2025-04-13 22:35:00,984 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=1718, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:35:00,984 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 212 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:00,984 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 85 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:35:00,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2025-04-13 22:35:00,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1694. [2025-04-13 22:35:00,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 1693 states have (on average 2.860602480803308) internal successors, (4843), 1693 states have internal predecessors, (4843), 0 states have call successors, (0), 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:35:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 4843 transitions. [2025-04-13 22:35:01,003 INFO L79 Accepts]: Start accepts. Automaton has 1694 states and 4843 transitions. Word has length 56 [2025-04-13 22:35:01,003 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:01,003 INFO L485 AbstractCegarLoop]: Abstraction has 1694 states and 4843 transitions. [2025-04-13 22:35:01,003 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:01,003 INFO L278 IsEmpty]: Start isEmpty. Operand 1694 states and 4843 transitions. [2025-04-13 22:35:01,005 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:01,005 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:01,005 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:01,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2025-04-13 22:35:01,205 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:01,205 INFO L403 AbstractCegarLoop]: === Iteration 169 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:01,206 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:01,206 INFO L85 PathProgramCache]: Analyzing trace with hash -250372238, now seen corresponding path program 168 times [2025-04-13 22:35:01,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:01,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846131966] [2025-04-13 22:35:01,206 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:35:01,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:01,210 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:01,214 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:01,214 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:35:01,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:01,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:01,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846131966] [2025-04-13 22:35:01,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846131966] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:01,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:01,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:35:01,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597838333] [2025-04-13 22:35:01,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:01,314 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:01,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:01,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:01,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:35:01,314 INFO L87 Difference]: Start difference. First operand 1694 states and 4843 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:01,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:01,826 INFO L93 Difference]: Finished difference Result 1951 states and 5583 transitions. [2025-04-13 22:35:01,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:35:01,826 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:01,826 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:01,833 INFO L225 Difference]: With dead ends: 1951 [2025-04-13 22:35:01,833 INFO L226 Difference]: Without dead ends: 1886 [2025-04-13 22:35:01,834 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=884, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:35:01,834 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 288 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:01,834 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 87 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:01,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2025-04-13 22:35:01,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1774. [2025-04-13 22:35:01,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1773 states have (on average 2.870840383530739) internal successors, (5090), 1773 states have internal predecessors, (5090), 0 states have call successors, (0), 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:35:01,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 5090 transitions. [2025-04-13 22:35:01,855 INFO L79 Accepts]: Start accepts. Automaton has 1774 states and 5090 transitions. Word has length 56 [2025-04-13 22:35:01,855 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:01,855 INFO L485 AbstractCegarLoop]: Abstraction has 1774 states and 5090 transitions. [2025-04-13 22:35:01,855 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:01,855 INFO L278 IsEmpty]: Start isEmpty. Operand 1774 states and 5090 transitions. [2025-04-13 22:35:01,857 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:01,857 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:01,857 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:01,857 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2025-04-13 22:35:01,857 INFO L403 AbstractCegarLoop]: === Iteration 170 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:01,857 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:01,857 INFO L85 PathProgramCache]: Analyzing trace with hash 809700750, now seen corresponding path program 169 times [2025-04-13 22:35:01,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:01,857 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781909017] [2025-04-13 22:35:01,857 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:01,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:01,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:35:01,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:01,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:01,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:02,579 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:35:02,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:02,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781909017] [2025-04-13 22:35:02,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781909017] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:02,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843634333] [2025-04-13 22:35:02,580 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:02,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:02,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:02,581 INFO L229 MonitoredProcess]: Starting monitored process 57 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:35:02,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2025-04-13 22:35:02,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:35:02,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:02,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:02,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:02,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:35:02,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:02,878 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:02,878 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:35:02,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:35:02,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:03,061 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:35:03,062 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:35:03,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:03,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843634333] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:03,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:35:03,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 32 [2025-04-13 22:35:03,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755776260] [2025-04-13 22:35:03,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:03,093 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:03,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:03,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:03,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=973, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:35:03,093 INFO L87 Difference]: Start difference. First operand 1774 states and 5090 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:03,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:03,893 INFO L93 Difference]: Finished difference Result 2070 states and 5883 transitions. [2025-04-13 22:35:03,893 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:35:03,893 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:03,893 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:03,900 INFO L225 Difference]: With dead ends: 2070 [2025-04-13 22:35:03,900 INFO L226 Difference]: Without dead ends: 1906 [2025-04-13 22:35:03,901 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=221, Invalid=2641, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:35:03,901 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 284 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:03,901 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 95 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:03,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2025-04-13 22:35:03,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1774. [2025-04-13 22:35:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1773 states have (on average 2.8426395939086295) internal successors, (5040), 1773 states have internal predecessors, (5040), 0 states have call successors, (0), 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:35:03,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 5040 transitions. [2025-04-13 22:35:03,921 INFO L79 Accepts]: Start accepts. Automaton has 1774 states and 5040 transitions. Word has length 56 [2025-04-13 22:35:03,921 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:03,921 INFO L485 AbstractCegarLoop]: Abstraction has 1774 states and 5040 transitions. [2025-04-13 22:35:03,921 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:03,921 INFO L278 IsEmpty]: Start isEmpty. Operand 1774 states and 5040 transitions. [2025-04-13 22:35:03,923 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:03,923 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:03,923 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:03,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2025-04-13 22:35:04,123 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable169 [2025-04-13 22:35:04,124 INFO L403 AbstractCegarLoop]: === Iteration 171 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:04,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:04,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1777852078, now seen corresponding path program 170 times [2025-04-13 22:35:04,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:04,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907904479] [2025-04-13 22:35:04,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:35:04,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:04,128 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:04,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:04,133 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:35:04,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:04,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:04,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:04,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907904479] [2025-04-13 22:35:04,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907904479] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:04,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:04,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:35:04,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683695973] [2025-04-13 22:35:04,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:04,233 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:04,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:04,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:04,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:35:04,233 INFO L87 Difference]: Start difference. First operand 1774 states and 5040 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:04,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:04,733 INFO L93 Difference]: Finished difference Result 1940 states and 5496 transitions. [2025-04-13 22:35:04,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:35:04,733 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:04,733 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:04,741 INFO L225 Difference]: With dead ends: 1940 [2025-04-13 22:35:04,741 INFO L226 Difference]: Without dead ends: 1881 [2025-04-13 22:35:04,741 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=883, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:35:04,742 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 241 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:04,742 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 86 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:04,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2025-04-13 22:35:04,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1769. [2025-04-13 22:35:04,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1768 states have (on average 2.8421945701357467) internal successors, (5025), 1768 states have internal predecessors, (5025), 0 states have call successors, (0), 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:35:04,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 5025 transitions. [2025-04-13 22:35:04,762 INFO L79 Accepts]: Start accepts. Automaton has 1769 states and 5025 transitions. Word has length 56 [2025-04-13 22:35:04,762 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:04,762 INFO L485 AbstractCegarLoop]: Abstraction has 1769 states and 5025 transitions. [2025-04-13 22:35:04,762 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:04,762 INFO L278 IsEmpty]: Start isEmpty. Operand 1769 states and 5025 transitions. [2025-04-13 22:35:04,764 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:04,764 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:04,764 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:04,764 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2025-04-13 22:35:04,764 INFO L403 AbstractCegarLoop]: === Iteration 172 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:04,764 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:04,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1488402192, now seen corresponding path program 171 times [2025-04-13 22:35:04,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:04,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226466022] [2025-04-13 22:35:04,764 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:35:04,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:04,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:04,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:04,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:35:04,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:04,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:04,875 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226466022] [2025-04-13 22:35:04,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226466022] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:04,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:04,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:35:04,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593589531] [2025-04-13 22:35:04,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:04,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:04,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:04,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:04,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:35:04,876 INFO L87 Difference]: Start difference. First operand 1769 states and 5025 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:05,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:05,383 INFO L93 Difference]: Finished difference Result 1945 states and 5506 transitions. [2025-04-13 22:35:05,384 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:35:05,384 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:05,384 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:05,392 INFO L225 Difference]: With dead ends: 1945 [2025-04-13 22:35:05,392 INFO L226 Difference]: Without dead ends: 1826 [2025-04-13 22:35:05,393 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=891, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:35:05,393 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 235 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:05,393 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 86 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:05,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2025-04-13 22:35:05,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1714. [2025-04-13 22:35:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1713 states have (on average 2.859894921190893) internal successors, (4899), 1713 states have internal predecessors, (4899), 0 states have call successors, (0), 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:35:05,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 4899 transitions. [2025-04-13 22:35:05,412 INFO L79 Accepts]: Start accepts. Automaton has 1714 states and 4899 transitions. Word has length 56 [2025-04-13 22:35:05,413 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:05,413 INFO L485 AbstractCegarLoop]: Abstraction has 1714 states and 4899 transitions. [2025-04-13 22:35:05,413 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:05,413 INFO L278 IsEmpty]: Start isEmpty. Operand 1714 states and 4899 transitions. [2025-04-13 22:35:05,414 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:05,414 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:05,414 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:05,414 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2025-04-13 22:35:05,414 INFO L403 AbstractCegarLoop]: === Iteration 173 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:05,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:05,415 INFO L85 PathProgramCache]: Analyzing trace with hash -521432994, now seen corresponding path program 172 times [2025-04-13 22:35:05,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:05,415 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759710382] [2025-04-13 22:35:05,415 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:35:05,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:05,419 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:05,421 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:35:05,421 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:35:05,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:05,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:05,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:05,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759710382] [2025-04-13 22:35:05,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759710382] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:05,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:05,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:35:05,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759625081] [2025-04-13 22:35:05,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:05,498 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:05,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:05,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:05,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:35:05,498 INFO L87 Difference]: Start difference. First operand 1714 states and 4899 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:06,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:06,160 INFO L93 Difference]: Finished difference Result 2324 states and 6648 transitions. [2025-04-13 22:35:06,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:35:06,161 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:06,161 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:06,168 INFO L225 Difference]: With dead ends: 2324 [2025-04-13 22:35:06,168 INFO L226 Difference]: Without dead ends: 2130 [2025-04-13 22:35:06,169 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=1152, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:35:06,169 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 347 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:06,169 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 140 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:35:06,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2025-04-13 22:35:06,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 1724. [2025-04-13 22:35:06,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1724 states, 1723 states have (on average 2.8566453859547303) internal successors, (4922), 1723 states have internal predecessors, (4922), 0 states have call successors, (0), 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:35:06,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 4922 transitions. [2025-04-13 22:35:06,199 INFO L79 Accepts]: Start accepts. Automaton has 1724 states and 4922 transitions. Word has length 56 [2025-04-13 22:35:06,199 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:06,199 INFO L485 AbstractCegarLoop]: Abstraction has 1724 states and 4922 transitions. [2025-04-13 22:35:06,199 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:06,200 INFO L278 IsEmpty]: Start isEmpty. Operand 1724 states and 4922 transitions. [2025-04-13 22:35:06,201 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:06,201 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:06,201 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:06,201 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2025-04-13 22:35:06,201 INFO L403 AbstractCegarLoop]: === Iteration 174 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:06,201 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:06,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1698821834, now seen corresponding path program 173 times [2025-04-13 22:35:06,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:06,202 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239154601] [2025-04-13 22:35:06,202 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:06,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:06,206 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:06,212 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:06,212 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:06,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:06,924 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:35:06,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:06,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239154601] [2025-04-13 22:35:06,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239154601] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:06,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428249865] [2025-04-13 22:35:06,925 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:06,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:06,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:06,927 INFO L229 MonitoredProcess]: Starting monitored process 58 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:35:06,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2025-04-13 22:35:07,011 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:07,029 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:07,029 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:07,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:07,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:35:07,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:07,231 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:07,231 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:35:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:35:07,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:07,431 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:35:07,431 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:35:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:07,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428249865] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:07,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:35:07,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 31 [2025-04-13 22:35:07,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4173430] [2025-04-13 22:35:07,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:07,455 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:07,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:07,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:07,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:35:07,456 INFO L87 Difference]: Start difference. First operand 1724 states and 4922 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:08,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:08,167 INFO L93 Difference]: Finished difference Result 1939 states and 5468 transitions. [2025-04-13 22:35:08,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:35:08,167 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:08,167 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:08,174 INFO L225 Difference]: With dead ends: 1939 [2025-04-13 22:35:08,174 INFO L226 Difference]: Without dead ends: 1705 [2025-04-13 22:35:08,175 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=211, Invalid=2441, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:35:08,175 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 249 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:08,175 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 95 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:08,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2025-04-13 22:35:08,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1694. [2025-04-13 22:35:08,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 1693 states have (on average 2.860602480803308) internal successors, (4843), 1693 states have internal predecessors, (4843), 0 states have call successors, (0), 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:35:08,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 4843 transitions. [2025-04-13 22:35:08,194 INFO L79 Accepts]: Start accepts. Automaton has 1694 states and 4843 transitions. Word has length 56 [2025-04-13 22:35:08,194 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:08,194 INFO L485 AbstractCegarLoop]: Abstraction has 1694 states and 4843 transitions. [2025-04-13 22:35:08,194 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:08,194 INFO L278 IsEmpty]: Start isEmpty. Operand 1694 states and 4843 transitions. [2025-04-13 22:35:08,195 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:08,195 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:08,195 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:08,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2025-04-13 22:35:08,396 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:08,396 INFO L403 AbstractCegarLoop]: === Iteration 175 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:08,396 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:08,396 INFO L85 PathProgramCache]: Analyzing trace with hash 364039856, now seen corresponding path program 174 times [2025-04-13 22:35:08,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:08,396 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767768492] [2025-04-13 22:35:08,396 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:35:08,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:08,401 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:08,405 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:08,405 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:35:08,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:08,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:08,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:08,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767768492] [2025-04-13 22:35:08,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767768492] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:08,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:08,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:35:08,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555219831] [2025-04-13 22:35:08,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:08,497 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:35:08,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:08,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:35:08,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:35:08,497 INFO L87 Difference]: Start difference. First operand 1694 states and 4843 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:08,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:08,950 INFO L93 Difference]: Finished difference Result 1881 states and 5295 transitions. [2025-04-13 22:35:08,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:35:08,951 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:08,951 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:08,958 INFO L225 Difference]: With dead ends: 1881 [2025-04-13 22:35:08,958 INFO L226 Difference]: Without dead ends: 1816 [2025-04-13 22:35:08,959 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:35:08,959 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 234 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:08,959 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 85 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:08,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2025-04-13 22:35:08,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1764. [2025-04-13 22:35:08,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1763 states have (on average 2.8355076574021556) internal successors, (4999), 1763 states have internal predecessors, (4999), 0 states have call successors, (0), 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:35:08,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 4999 transitions. [2025-04-13 22:35:08,979 INFO L79 Accepts]: Start accepts. Automaton has 1764 states and 4999 transitions. Word has length 56 [2025-04-13 22:35:08,979 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:08,979 INFO L485 AbstractCegarLoop]: Abstraction has 1764 states and 4999 transitions. [2025-04-13 22:35:08,979 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:08,979 INFO L278 IsEmpty]: Start isEmpty. Operand 1764 states and 4999 transitions. [2025-04-13 22:35:08,980 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:08,980 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:08,981 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:08,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2025-04-13 22:35:08,981 INFO L403 AbstractCegarLoop]: === Iteration 176 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:08,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:08,981 INFO L85 PathProgramCache]: Analyzing trace with hash 516022606, now seen corresponding path program 175 times [2025-04-13 22:35:08,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:08,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259707975] [2025-04-13 22:35:08,981 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:08,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:08,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:35:08,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:08,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:08,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:09,739 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:35:09,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:09,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259707975] [2025-04-13 22:35:09,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259707975] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:09,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618861305] [2025-04-13 22:35:09,739 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:09,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:09,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:09,741 INFO L229 MonitoredProcess]: Starting monitored process 59 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:35:09,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2025-04-13 22:35:09,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:35:09,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:09,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:09,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:09,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:35:09,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:10,033 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:10,033 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:35:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:35:10,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:10,257 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:35:10,257 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:35:10,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:10,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618861305] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:10,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:35:10,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 34 [2025-04-13 22:35:10,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686189727] [2025-04-13 22:35:10,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:10,280 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:10,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:10,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:10,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:35:10,280 INFO L87 Difference]: Start difference. First operand 1764 states and 4999 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:10,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:10,991 INFO L93 Difference]: Finished difference Result 1849 states and 5191 transitions. [2025-04-13 22:35:10,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:35:10,991 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:10,991 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:10,998 INFO L225 Difference]: With dead ends: 1849 [2025-04-13 22:35:10,998 INFO L226 Difference]: Without dead ends: 1811 [2025-04-13 22:35:10,999 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=2546, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:35:10,999 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 211 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:10,999 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 85 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:11,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2025-04-13 22:35:11,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1759. [2025-04-13 22:35:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1758 states have (on average 2.8350398179749714) internal successors, (4984), 1758 states have internal predecessors, (4984), 0 states have call successors, (0), 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:35:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 4984 transitions. [2025-04-13 22:35:11,019 INFO L79 Accepts]: Start accepts. Automaton has 1759 states and 4984 transitions. Word has length 56 [2025-04-13 22:35:11,019 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:11,019 INFO L485 AbstractCegarLoop]: Abstraction has 1759 states and 4984 transitions. [2025-04-13 22:35:11,019 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:11,019 INFO L278 IsEmpty]: Start isEmpty. Operand 1759 states and 4984 transitions. [2025-04-13 22:35:11,021 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:11,021 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:11,021 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:11,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2025-04-13 22:35:11,221 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable175 [2025-04-13 22:35:11,221 INFO L403 AbstractCegarLoop]: === Iteration 177 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:11,221 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:11,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1458353060, now seen corresponding path program 176 times [2025-04-13 22:35:11,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:11,222 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363905517] [2025-04-13 22:35:11,222 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:35:11,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:11,226 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:11,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:11,230 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:35:11,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:11,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:11,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:11,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363905517] [2025-04-13 22:35:11,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363905517] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:11,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:11,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:35:11,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496213945] [2025-04-13 22:35:11,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:11,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:35:11,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:11,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:35:11,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:35:11,324 INFO L87 Difference]: Start difference. First operand 1759 states and 4984 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:11,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:11,923 INFO L93 Difference]: Finished difference Result 2237 states and 6293 transitions. [2025-04-13 22:35:11,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:35:11,923 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:11,923 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:11,932 INFO L225 Difference]: With dead ends: 2237 [2025-04-13 22:35:11,932 INFO L226 Difference]: Without dead ends: 1996 [2025-04-13 22:35:11,932 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:35:11,933 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 296 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 1645 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:11,933 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 122 Invalid, 1652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1645 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:11,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2025-04-13 22:35:11,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1802. [2025-04-13 22:35:11,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1801 states have (on average 2.8267629094947253) internal successors, (5091), 1801 states have internal predecessors, (5091), 0 states have call successors, (0), 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:35:11,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 5091 transitions. [2025-04-13 22:35:11,954 INFO L79 Accepts]: Start accepts. Automaton has 1802 states and 5091 transitions. Word has length 56 [2025-04-13 22:35:11,954 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:11,954 INFO L485 AbstractCegarLoop]: Abstraction has 1802 states and 5091 transitions. [2025-04-13 22:35:11,954 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:11,954 INFO L278 IsEmpty]: Start isEmpty. Operand 1802 states and 5091 transitions. [2025-04-13 22:35:11,956 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:11,956 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:11,956 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:11,956 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2025-04-13 22:35:11,956 INFO L403 AbstractCegarLoop]: === Iteration 178 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:11,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:11,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2066664876, now seen corresponding path program 177 times [2025-04-13 22:35:11,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:11,956 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774934129] [2025-04-13 22:35:11,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:35:11,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:11,960 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:11,964 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:11,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:35:11,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:12,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:12,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774934129] [2025-04-13 22:35:12,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774934129] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:12,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:12,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:35:12,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166611629] [2025-04-13 22:35:12,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:12,055 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:35:12,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:12,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:35:12,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:35:12,056 INFO L87 Difference]: Start difference. First operand 1802 states and 5091 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:12,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:12,558 INFO L93 Difference]: Finished difference Result 1889 states and 5297 transitions. [2025-04-13 22:35:12,558 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:35:12,558 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:12,558 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:12,566 INFO L225 Difference]: With dead ends: 1889 [2025-04-13 22:35:12,566 INFO L226 Difference]: Without dead ends: 1803 [2025-04-13 22:35:12,567 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=157, Invalid=835, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:35:12,567 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 254 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:12,567 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 111 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:12,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2025-04-13 22:35:12,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1792. [2025-04-13 22:35:12,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1791 states have (on average 2.823003908431044) internal successors, (5056), 1791 states have internal predecessors, (5056), 0 states have call successors, (0), 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:35:12,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 5056 transitions. [2025-04-13 22:35:12,586 INFO L79 Accepts]: Start accepts. Automaton has 1792 states and 5056 transitions. Word has length 56 [2025-04-13 22:35:12,586 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:12,586 INFO L485 AbstractCegarLoop]: Abstraction has 1792 states and 5056 transitions. [2025-04-13 22:35:12,586 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:12,586 INFO L278 IsEmpty]: Start isEmpty. Operand 1792 states and 5056 transitions. [2025-04-13 22:35:12,588 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:12,588 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:12,588 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:12,588 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2025-04-13 22:35:12,588 INFO L403 AbstractCegarLoop]: === Iteration 179 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:12,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:12,588 INFO L85 PathProgramCache]: Analyzing trace with hash 670572386, now seen corresponding path program 178 times [2025-04-13 22:35:12,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:12,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309056286] [2025-04-13 22:35:12,588 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:35:12,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:12,593 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:12,595 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:35:12,595 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:35:12,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:12,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:12,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:12,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309056286] [2025-04-13 22:35:12,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309056286] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:12,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:12,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:35:12,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75865629] [2025-04-13 22:35:12,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:12,667 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:35:12,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:12,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:35:12,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:35:12,667 INFO L87 Difference]: Start difference. First operand 1792 states and 5056 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:13,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:13,165 INFO L93 Difference]: Finished difference Result 1904 states and 5332 transitions. [2025-04-13 22:35:13,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:35:13,166 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:13,166 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:13,174 INFO L225 Difference]: With dead ends: 1904 [2025-04-13 22:35:13,174 INFO L226 Difference]: Without dead ends: 1839 [2025-04-13 22:35:13,175 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=1009, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:35:13,175 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 257 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:13,175 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 108 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:13,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2025-04-13 22:35:13,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1797. [2025-04-13 22:35:13,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1796 states have (on average 2.8207126948775056) internal successors, (5066), 1796 states have internal predecessors, (5066), 0 states have call successors, (0), 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:35:13,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 5066 transitions. [2025-04-13 22:35:13,196 INFO L79 Accepts]: Start accepts. Automaton has 1797 states and 5066 transitions. Word has length 56 [2025-04-13 22:35:13,196 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:13,196 INFO L485 AbstractCegarLoop]: Abstraction has 1797 states and 5066 transitions. [2025-04-13 22:35:13,196 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:13,196 INFO L278 IsEmpty]: Start isEmpty. Operand 1797 states and 5066 transitions. [2025-04-13 22:35:13,197 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:13,198 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:13,198 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:13,198 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2025-04-13 22:35:13,198 INFO L403 AbstractCegarLoop]: === Iteration 180 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:13,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:13,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1720425206, now seen corresponding path program 179 times [2025-04-13 22:35:13,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:13,198 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948002980] [2025-04-13 22:35:13,198 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:13,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:13,202 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:13,210 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:13,210 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:13,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:14,407 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:35:14,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:14,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948002980] [2025-04-13 22:35:14,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948002980] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:14,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492785629] [2025-04-13 22:35:14,407 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:14,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:14,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:14,409 INFO L229 MonitoredProcess]: Starting monitored process 60 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:35:14,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2025-04-13 22:35:14,495 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:14,513 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:14,513 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:14,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:14,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:35:14,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:14,682 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:14,682 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:35:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:14,736 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:35:14,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492785629] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:14,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:35:14,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 26 [2025-04-13 22:35:14,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352943975] [2025-04-13 22:35:14,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:14,737 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:14,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:14,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:14,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=644, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:35:14,737 INFO L87 Difference]: Start difference. First operand 1797 states and 5066 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:15,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:15,437 INFO L93 Difference]: Finished difference Result 1862 states and 5213 transitions. [2025-04-13 22:35:15,437 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:35:15,437 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:15,437 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:15,445 INFO L225 Difference]: With dead ends: 1862 [2025-04-13 22:35:15,446 INFO L226 Difference]: Without dead ends: 1798 [2025-04-13 22:35:15,446 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=1708, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:35:15,446 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 201 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:15,446 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 84 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:15,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2025-04-13 22:35:15,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1787. [2025-04-13 22:35:15,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1787 states, 1786 states have (on average 2.822508398656215) internal successors, (5041), 1786 states have internal predecessors, (5041), 0 states have call successors, (0), 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:35:15,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 5041 transitions. [2025-04-13 22:35:15,467 INFO L79 Accepts]: Start accepts. Automaton has 1787 states and 5041 transitions. Word has length 56 [2025-04-13 22:35:15,467 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:15,467 INFO L485 AbstractCegarLoop]: Abstraction has 1787 states and 5041 transitions. [2025-04-13 22:35:15,467 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:15,467 INFO L278 IsEmpty]: Start isEmpty. Operand 1787 states and 5041 transitions. [2025-04-13 22:35:15,469 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:15,469 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:15,469 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:15,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2025-04-13 22:35:15,669 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable179 [2025-04-13 22:35:15,669 INFO L403 AbstractCegarLoop]: === Iteration 181 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:15,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:15,670 INFO L85 PathProgramCache]: Analyzing trace with hash -814516940, now seen corresponding path program 180 times [2025-04-13 22:35:15,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:15,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097300226] [2025-04-13 22:35:15,670 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:35:15,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:15,674 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:15,678 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:15,678 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:35:15,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:15,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:15,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:15,767 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097300226] [2025-04-13 22:35:15,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097300226] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:15,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:15,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:35:15,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712383224] [2025-04-13 22:35:15,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:15,768 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:35:15,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:15,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:35:15,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:35:15,768 INFO L87 Difference]: Start difference. First operand 1787 states and 5041 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:16,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:16,248 INFO L93 Difference]: Finished difference Result 1914 states and 5357 transitions. [2025-04-13 22:35:16,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:35:16,248 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:16,249 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:16,257 INFO L225 Difference]: With dead ends: 1914 [2025-04-13 22:35:16,257 INFO L226 Difference]: Without dead ends: 1849 [2025-04-13 22:35:16,257 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:35:16,257 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 263 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:16,257 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 95 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:16,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2025-04-13 22:35:16,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1797. [2025-04-13 22:35:16,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1796 states have (on average 2.8207126948775056) internal successors, (5066), 1796 states have internal predecessors, (5066), 0 states have call successors, (0), 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:35:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 5066 transitions. [2025-04-13 22:35:16,278 INFO L79 Accepts]: Start accepts. Automaton has 1797 states and 5066 transitions. Word has length 56 [2025-04-13 22:35:16,278 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:16,278 INFO L485 AbstractCegarLoop]: Abstraction has 1797 states and 5066 transitions. [2025-04-13 22:35:16,278 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:16,278 INFO L278 IsEmpty]: Start isEmpty. Operand 1797 states and 5066 transitions. [2025-04-13 22:35:16,280 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:16,280 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:16,280 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:16,280 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2025-04-13 22:35:16,280 INFO L403 AbstractCegarLoop]: === Iteration 182 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:16,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:16,280 INFO L85 PathProgramCache]: Analyzing trace with hash -892705180, now seen corresponding path program 181 times [2025-04-13 22:35:16,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:16,280 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316086326] [2025-04-13 22:35:16,280 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:16,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:16,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:35:16,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:16,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:16,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:17,036 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:35:17,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:17,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316086326] [2025-04-13 22:35:17,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316086326] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:17,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716553354] [2025-04-13 22:35:17,037 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:17,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:17,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:17,039 INFO L229 MonitoredProcess]: Starting monitored process 61 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:35:17,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2025-04-13 22:35:17,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:35:17,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:17,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:17,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:17,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:35:17,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:17,330 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:17,330 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:35:17,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:35:17,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:17,533 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:35:17,533 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:35:17,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:17,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716553354] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:17,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:35:17,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 31 [2025-04-13 22:35:17,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722101541] [2025-04-13 22:35:17,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:17,566 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:17,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:17,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:17,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=915, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:35:17,566 INFO L87 Difference]: Start difference. First operand 1797 states and 5066 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:18,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:18,343 INFO L93 Difference]: Finished difference Result 1903 states and 5320 transitions. [2025-04-13 22:35:18,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:35:18,343 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:18,343 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:18,351 INFO L225 Difference]: With dead ends: 1903 [2025-04-13 22:35:18,351 INFO L226 Difference]: Without dead ends: 1844 [2025-04-13 22:35:18,352 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=218, Invalid=2644, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:35:18,352 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 255 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:18,352 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 92 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:18,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-04-13 22:35:18,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1792. [2025-04-13 22:35:18,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1791 states have (on average 2.820212171970966) internal successors, (5051), 1791 states have internal predecessors, (5051), 0 states have call successors, (0), 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:35:18,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 5051 transitions. [2025-04-13 22:35:18,385 INFO L79 Accepts]: Start accepts. Automaton has 1792 states and 5051 transitions. Word has length 56 [2025-04-13 22:35:18,385 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:18,385 INFO L485 AbstractCegarLoop]: Abstraction has 1792 states and 5051 transitions. [2025-04-13 22:35:18,385 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:18,385 INFO L278 IsEmpty]: Start isEmpty. Operand 1792 states and 5051 transitions. [2025-04-13 22:35:18,387 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:18,387 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:18,387 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:18,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2025-04-13 22:35:18,587 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:18,588 INFO L403 AbstractCegarLoop]: === Iteration 183 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:18,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:18,588 INFO L85 PathProgramCache]: Analyzing trace with hash 2128788864, now seen corresponding path program 182 times [2025-04-13 22:35:18,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:18,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957482936] [2025-04-13 22:35:18,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:35:18,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:18,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:18,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:18,598 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:35:18,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:18,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:18,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:18,689 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957482936] [2025-04-13 22:35:18,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957482936] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:18,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:18,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:35:18,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874852186] [2025-04-13 22:35:18,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:18,689 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:35:18,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:18,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:35:18,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:35:18,690 INFO L87 Difference]: Start difference. First operand 1792 states and 5051 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:19,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:19,243 INFO L93 Difference]: Finished difference Result 2133 states and 6039 transitions. [2025-04-13 22:35:19,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:35:19,243 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:19,243 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:19,251 INFO L225 Difference]: With dead ends: 2133 [2025-04-13 22:35:19,252 INFO L226 Difference]: Without dead ends: 2009 [2025-04-13 22:35:19,252 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:35:19,252 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 258 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:19,252 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 118 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:19,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2025-04-13 22:35:19,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1732. [2025-04-13 22:35:19,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1731 states have (on average 2.8393991912189485) internal successors, (4915), 1731 states have internal predecessors, (4915), 0 states have call successors, (0), 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:35:19,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 4915 transitions. [2025-04-13 22:35:19,277 INFO L79 Accepts]: Start accepts. Automaton has 1732 states and 4915 transitions. Word has length 56 [2025-04-13 22:35:19,278 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:19,278 INFO L485 AbstractCegarLoop]: Abstraction has 1732 states and 4915 transitions. [2025-04-13 22:35:19,278 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:19,278 INFO L278 IsEmpty]: Start isEmpty. Operand 1732 states and 4915 transitions. [2025-04-13 22:35:19,280 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:19,280 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:19,280 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:19,280 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2025-04-13 22:35:19,280 INFO L403 AbstractCegarLoop]: === Iteration 184 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:19,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:19,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1629913326, now seen corresponding path program 183 times [2025-04-13 22:35:19,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:19,280 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107565875] [2025-04-13 22:35:19,280 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:35:19,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:19,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:19,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:19,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:35:19,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:19,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:19,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:19,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107565875] [2025-04-13 22:35:19,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107565875] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:19,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:19,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:35:19,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61816657] [2025-04-13 22:35:19,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:19,407 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:19,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:19,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:19,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:35:19,408 INFO L87 Difference]: Start difference. First operand 1732 states and 4915 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:19,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:19,891 INFO L93 Difference]: Finished difference Result 1838 states and 5174 transitions. [2025-04-13 22:35:19,891 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:35:19,891 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:19,892 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:19,900 INFO L225 Difference]: With dead ends: 1838 [2025-04-13 22:35:19,900 INFO L226 Difference]: Without dead ends: 1773 [2025-04-13 22:35:19,900 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=786, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:35:19,901 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 270 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:19,901 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 94 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:19,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2025-04-13 22:35:19,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1752. [2025-04-13 22:35:19,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1751 states have (on average 2.835522558537978) internal successors, (4965), 1751 states have internal predecessors, (4965), 0 states have call successors, (0), 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:35:19,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 4965 transitions. [2025-04-13 22:35:19,922 INFO L79 Accepts]: Start accepts. Automaton has 1752 states and 4965 transitions. Word has length 56 [2025-04-13 22:35:19,922 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:19,922 INFO L485 AbstractCegarLoop]: Abstraction has 1752 states and 4965 transitions. [2025-04-13 22:35:19,922 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:19,922 INFO L278 IsEmpty]: Start isEmpty. Operand 1752 states and 4965 transitions. [2025-04-13 22:35:19,924 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:19,924 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:19,924 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:19,924 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2025-04-13 22:35:19,924 INFO L403 AbstractCegarLoop]: === Iteration 185 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:19,924 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:19,925 INFO L85 PathProgramCache]: Analyzing trace with hash 220773646, now seen corresponding path program 184 times [2025-04-13 22:35:19,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:19,925 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467345996] [2025-04-13 22:35:19,925 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:35:19,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:19,929 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:19,932 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:35:19,932 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:35:19,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:20,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:20,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:20,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467345996] [2025-04-13 22:35:20,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467345996] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:20,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:20,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:35:20,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055754174] [2025-04-13 22:35:20,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:20,006 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:20,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:20,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:20,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:35:20,006 INFO L87 Difference]: Start difference. First operand 1752 states and 4965 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:20,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:20,451 INFO L93 Difference]: Finished difference Result 1801 states and 5060 transitions. [2025-04-13 22:35:20,451 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:35:20,451 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:20,451 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:20,460 INFO L225 Difference]: With dead ends: 1801 [2025-04-13 22:35:20,460 INFO L226 Difference]: Without dead ends: 1763 [2025-04-13 22:35:20,461 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:35:20,461 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 215 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:20,461 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 93 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:20,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2025-04-13 22:35:20,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1742. [2025-04-13 22:35:20,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1742 states, 1741 states have (on average 2.8345778288340036) internal successors, (4935), 1741 states have internal predecessors, (4935), 0 states have call successors, (0), 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:35:20,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 4935 transitions. [2025-04-13 22:35:20,482 INFO L79 Accepts]: Start accepts. Automaton has 1742 states and 4935 transitions. Word has length 56 [2025-04-13 22:35:20,482 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:20,482 INFO L485 AbstractCegarLoop]: Abstraction has 1742 states and 4935 transitions. [2025-04-13 22:35:20,482 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:20,482 INFO L278 IsEmpty]: Start isEmpty. Operand 1742 states and 4935 transitions. [2025-04-13 22:35:20,484 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:20,484 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:20,484 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:20,484 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2025-04-13 22:35:20,484 INFO L403 AbstractCegarLoop]: === Iteration 186 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:20,484 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:20,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1742078958, now seen corresponding path program 185 times [2025-04-13 22:35:20,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:20,485 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900533022] [2025-04-13 22:35:20,485 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:20,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:20,489 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:20,496 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:20,496 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:20,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:21,149 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:35:21,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:21,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900533022] [2025-04-13 22:35:21,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900533022] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:21,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232935346] [2025-04-13 22:35:21,149 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:21,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:21,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:21,151 INFO L229 MonitoredProcess]: Starting monitored process 62 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:35:21,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2025-04-13 22:35:21,238 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:21,257 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:21,257 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:21,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:21,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:35:21,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:21,483 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:21,484 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:35:21,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:35:21,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:21,683 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:35:21,684 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:35:21,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:21,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232935346] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:21,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:35:21,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 33 [2025-04-13 22:35:21,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306471445] [2025-04-13 22:35:21,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:21,720 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:21,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:21,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:21,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1039, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:35:21,720 INFO L87 Difference]: Start difference. First operand 1742 states and 4935 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:22,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:22,373 INFO L93 Difference]: Finished difference Result 1786 states and 5020 transitions. [2025-04-13 22:35:22,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:35:22,373 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:22,373 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:22,381 INFO L225 Difference]: With dead ends: 1786 [2025-04-13 22:35:22,381 INFO L226 Difference]: Without dead ends: 1673 [2025-04-13 22:35:22,381 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=179, Invalid=2271, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:35:22,381 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 208 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:22,381 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 91 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:22,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2025-04-13 22:35:22,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1662. [2025-04-13 22:35:22,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1661 states have (on average 2.861529199277544) internal successors, (4753), 1661 states have internal predecessors, (4753), 0 states have call successors, (0), 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:35:22,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 4753 transitions. [2025-04-13 22:35:22,400 INFO L79 Accepts]: Start accepts. Automaton has 1662 states and 4753 transitions. Word has length 56 [2025-04-13 22:35:22,400 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:22,400 INFO L485 AbstractCegarLoop]: Abstraction has 1662 states and 4753 transitions. [2025-04-13 22:35:22,400 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:22,400 INFO L278 IsEmpty]: Start isEmpty. Operand 1662 states and 4753 transitions. [2025-04-13 22:35:22,402 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:22,402 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:22,402 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:22,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2025-04-13 22:35:22,602 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:22,602 INFO L403 AbstractCegarLoop]: === Iteration 187 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:22,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:22,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2084996210, now seen corresponding path program 186 times [2025-04-13 22:35:22,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:22,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654088449] [2025-04-13 22:35:22,603 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:35:22,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:22,607 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:22,611 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:22,611 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:35:22,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:22,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:22,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:22,714 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654088449] [2025-04-13 22:35:22,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654088449] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:22,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:22,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:35:22,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754984037] [2025-04-13 22:35:22,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:22,714 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:22,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:22,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:22,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:35:22,715 INFO L87 Difference]: Start difference. First operand 1662 states and 4753 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:23,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:23,277 INFO L93 Difference]: Finished difference Result 2019 states and 5739 transitions. [2025-04-13 22:35:23,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:35:23,277 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:23,277 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:23,285 INFO L225 Difference]: With dead ends: 2019 [2025-04-13 22:35:23,285 INFO L226 Difference]: Without dead ends: 1954 [2025-04-13 22:35:23,286 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=1128, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:35:23,286 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 356 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:23,286 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 102 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:23,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2025-04-13 22:35:23,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1782. [2025-04-13 22:35:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1781 states have (on average 2.871982032565974) internal successors, (5115), 1781 states have internal predecessors, (5115), 0 states have call successors, (0), 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:35:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 5115 transitions. [2025-04-13 22:35:23,306 INFO L79 Accepts]: Start accepts. Automaton has 1782 states and 5115 transitions. Word has length 56 [2025-04-13 22:35:23,306 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:23,307 INFO L485 AbstractCegarLoop]: Abstraction has 1782 states and 5115 transitions. [2025-04-13 22:35:23,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:23,307 INFO L278 IsEmpty]: Start isEmpty. Operand 1782 states and 5115 transitions. [2025-04-13 22:35:23,308 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:23,308 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:23,308 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:23,308 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2025-04-13 22:35:23,308 INFO L403 AbstractCegarLoop]: === Iteration 188 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:23,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:23,309 INFO L85 PathProgramCache]: Analyzing trace with hash -229067534, now seen corresponding path program 187 times [2025-04-13 22:35:23,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:23,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399310780] [2025-04-13 22:35:23,309 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:23,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:23,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:35:23,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:23,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:23,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:24,007 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:35:24,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:24,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399310780] [2025-04-13 22:35:24,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399310780] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:24,008 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841068132] [2025-04-13 22:35:24,008 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:24,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:24,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:24,009 INFO L229 MonitoredProcess]: Starting monitored process 63 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:35:24,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2025-04-13 22:35:24,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:35:24,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:24,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:24,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:24,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:35:24,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:24,333 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:24,333 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:35:24,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:35:24,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:24,494 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:35:24,495 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:35:24,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:24,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841068132] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:24,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:35:24,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 31 [2025-04-13 22:35:24,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359087269] [2025-04-13 22:35:24,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:24,520 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:24,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:24,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:24,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:35:24,521 INFO L87 Difference]: Start difference. First operand 1782 states and 5115 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:25,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:25,224 INFO L93 Difference]: Finished difference Result 1997 states and 5660 transitions. [2025-04-13 22:35:25,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:35:25,224 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:25,224 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:25,232 INFO L225 Difference]: With dead ends: 1997 [2025-04-13 22:35:25,232 INFO L226 Difference]: Without dead ends: 1854 [2025-04-13 22:35:25,232 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=2339, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:35:25,232 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 285 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:25,233 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 97 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:25,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2025-04-13 22:35:25,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1732. [2025-04-13 22:35:25,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1731 states have (on average 2.8359329867128826) internal successors, (4909), 1731 states have internal predecessors, (4909), 0 states have call successors, (0), 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:35:25,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 4909 transitions. [2025-04-13 22:35:25,252 INFO L79 Accepts]: Start accepts. Automaton has 1732 states and 4909 transitions. Word has length 56 [2025-04-13 22:35:25,253 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:25,253 INFO L485 AbstractCegarLoop]: Abstraction has 1732 states and 4909 transitions. [2025-04-13 22:35:25,253 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:25,253 INFO L278 IsEmpty]: Start isEmpty. Operand 1732 states and 4909 transitions. [2025-04-13 22:35:25,254 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:25,254 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:25,254 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:25,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2025-04-13 22:35:25,455 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187,63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:25,455 INFO L403 AbstractCegarLoop]: === Iteration 189 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:25,455 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:25,455 INFO L85 PathProgramCache]: Analyzing trace with hash -527503318, now seen corresponding path program 188 times [2025-04-13 22:35:25,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:25,455 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299717594] [2025-04-13 22:35:25,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:35:25,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:25,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:25,464 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:25,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:35:25,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:25,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:25,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:25,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299717594] [2025-04-13 22:35:25,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299717594] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:25,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:25,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:35:25,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006455114] [2025-04-13 22:35:25,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:25,579 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:25,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:25,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:25,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:35:25,580 INFO L87 Difference]: Start difference. First operand 1732 states and 4909 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:26,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:26,098 INFO L93 Difference]: Finished difference Result 1882 states and 5313 transitions. [2025-04-13 22:35:26,098 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:35:26,099 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:26,099 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:26,106 INFO L225 Difference]: With dead ends: 1882 [2025-04-13 22:35:26,106 INFO L226 Difference]: Without dead ends: 1844 [2025-04-13 22:35:26,107 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:35:26,107 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 251 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:26,107 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 94 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:26,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-04-13 22:35:26,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1722. [2025-04-13 22:35:26,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1722 states, 1721 states have (on average 2.8349796629866355) internal successors, (4879), 1721 states have internal predecessors, (4879), 0 states have call successors, (0), 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:35:26,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 4879 transitions. [2025-04-13 22:35:26,127 INFO L79 Accepts]: Start accepts. Automaton has 1722 states and 4879 transitions. Word has length 56 [2025-04-13 22:35:26,127 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:26,127 INFO L485 AbstractCegarLoop]: Abstraction has 1722 states and 4879 transitions. [2025-04-13 22:35:26,127 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:26,128 INFO L278 IsEmpty]: Start isEmpty. Operand 1722 states and 4879 transitions. [2025-04-13 22:35:26,129 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:26,129 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:26,129 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:26,129 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2025-04-13 22:35:26,129 INFO L403 AbstractCegarLoop]: === Iteration 190 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:26,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:26,129 INFO L85 PathProgramCache]: Analyzing trace with hash 20329554, now seen corresponding path program 189 times [2025-04-13 22:35:26,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:26,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198000950] [2025-04-13 22:35:26,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:35:26,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:26,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:26,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:26,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:35:26,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:26,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:26,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:26,248 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198000950] [2025-04-13 22:35:26,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198000950] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:26,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:26,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:35:26,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489877087] [2025-04-13 22:35:26,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:26,248 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:26,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:26,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:26,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:35:26,249 INFO L87 Difference]: Start difference. First operand 1722 states and 4879 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:26,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:26,864 INFO L93 Difference]: Finished difference Result 2009 states and 5691 transitions. [2025-04-13 22:35:26,864 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:35:26,864 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:26,864 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:26,872 INFO L225 Difference]: With dead ends: 2009 [2025-04-13 22:35:26,872 INFO L226 Difference]: Without dead ends: 1906 [2025-04-13 22:35:26,872 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=1085, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:35:26,872 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 309 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 1617 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:26,872 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 128 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:26,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2025-04-13 22:35:26,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1652. [2025-04-13 22:35:26,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1652 states, 1651 states have (on average 2.8588734100545126) internal successors, (4720), 1651 states have internal predecessors, (4720), 0 states have call successors, (0), 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:35:26,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 4720 transitions. [2025-04-13 22:35:26,892 INFO L79 Accepts]: Start accepts. Automaton has 1652 states and 4720 transitions. Word has length 56 [2025-04-13 22:35:26,892 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:26,892 INFO L485 AbstractCegarLoop]: Abstraction has 1652 states and 4720 transitions. [2025-04-13 22:35:26,893 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:26,893 INFO L278 IsEmpty]: Start isEmpty. Operand 1652 states and 4720 transitions. [2025-04-13 22:35:26,894 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:26,894 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:26,894 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:26,894 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2025-04-13 22:35:26,894 INFO L403 AbstractCegarLoop]: === Iteration 191 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:26,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:26,894 INFO L85 PathProgramCache]: Analyzing trace with hash 543352192, now seen corresponding path program 190 times [2025-04-13 22:35:26,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:26,895 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397493304] [2025-04-13 22:35:26,895 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:35:26,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:26,899 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:26,901 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:35:26,901 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:35:26,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:26,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:26,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:26,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397493304] [2025-04-13 22:35:26,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397493304] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:26,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:26,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:35:26,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134131925] [2025-04-13 22:35:26,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:26,971 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:35:26,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:26,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:35:26,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:35:26,972 INFO L87 Difference]: Start difference. First operand 1652 states and 4720 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:27,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:27,545 INFO L93 Difference]: Finished difference Result 1985 states and 5620 transitions. [2025-04-13 22:35:27,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:35:27,545 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:27,545 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:27,553 INFO L225 Difference]: With dead ends: 1985 [2025-04-13 22:35:27,553 INFO L226 Difference]: Without dead ends: 1761 [2025-04-13 22:35:27,554 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=1126, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:35:27,554 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 276 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:27,554 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 116 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:27,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2025-04-13 22:35:27,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1632. [2025-04-13 22:35:27,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1632 states, 1631 states have (on average 2.8595953402820355) internal successors, (4664), 1631 states have internal predecessors, (4664), 0 states have call successors, (0), 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:35:27,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 4664 transitions. [2025-04-13 22:35:27,573 INFO L79 Accepts]: Start accepts. Automaton has 1632 states and 4664 transitions. Word has length 56 [2025-04-13 22:35:27,573 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:27,573 INFO L485 AbstractCegarLoop]: Abstraction has 1632 states and 4664 transitions. [2025-04-13 22:35:27,573 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:27,573 INFO L278 IsEmpty]: Start isEmpty. Operand 1632 states and 4664 transitions. [2025-04-13 22:35:27,575 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:27,575 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:27,575 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:27,575 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2025-04-13 22:35:27,575 INFO L403 AbstractCegarLoop]: === Iteration 192 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:27,575 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:27,575 INFO L85 PathProgramCache]: Analyzing trace with hash -18131412, now seen corresponding path program 191 times [2025-04-13 22:35:27,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:27,575 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677653027] [2025-04-13 22:35:27,575 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:27,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:27,580 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:27,587 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:27,587 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:27,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:28,174 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:35:28,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:28,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677653027] [2025-04-13 22:35:28,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677653027] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:28,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797673562] [2025-04-13 22:35:28,175 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:28,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:28,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:28,177 INFO L229 MonitoredProcess]: Starting monitored process 64 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:35:28,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2025-04-13 22:35:28,266 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:28,284 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:28,284 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:28,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:28,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:35:28,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:28,478 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:28,478 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:35:28,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:35:28,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:28,617 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:35:28,618 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:35:28,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:28,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797673562] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:28,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:35:28,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 22:35:28,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274723267] [2025-04-13 22:35:28,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:28,647 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:28,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:28,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:28,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:35:28,648 INFO L87 Difference]: Start difference. First operand 1632 states and 4664 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:29,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:29,365 INFO L93 Difference]: Finished difference Result 1838 states and 5175 transitions. [2025-04-13 22:35:29,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:35:29,365 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:29,365 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:29,372 INFO L225 Difference]: With dead ends: 1838 [2025-04-13 22:35:29,372 INFO L226 Difference]: Without dead ends: 1674 [2025-04-13 22:35:29,373 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=203, Invalid=2247, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:35:29,373 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 270 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:29,373 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 107 Invalid, 1286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:29,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2025-04-13 22:35:29,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1632. [2025-04-13 22:35:29,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1632 states, 1631 states have (on average 2.8289393010423054) internal successors, (4614), 1631 states have internal predecessors, (4614), 0 states have call successors, (0), 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:35:29,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 4614 transitions. [2025-04-13 22:35:29,391 INFO L79 Accepts]: Start accepts. Automaton has 1632 states and 4614 transitions. Word has length 56 [2025-04-13 22:35:29,391 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:29,391 INFO L485 AbstractCegarLoop]: Abstraction has 1632 states and 4614 transitions. [2025-04-13 22:35:29,391 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:29,392 INFO L278 IsEmpty]: Start isEmpty. Operand 1632 states and 4614 transitions. [2025-04-13 22:35:29,393 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:29,393 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:29,393 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:29,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2025-04-13 22:35:29,593 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191,64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:29,594 INFO L403 AbstractCegarLoop]: === Iteration 193 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:29,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:29,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1108396820, now seen corresponding path program 192 times [2025-04-13 22:35:29,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:29,594 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004977219] [2025-04-13 22:35:29,594 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:35:29,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:29,599 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:29,603 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:29,603 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:35:29,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:29,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:29,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:29,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004977219] [2025-04-13 22:35:29,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004977219] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:29,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:29,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:35:29,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405296635] [2025-04-13 22:35:29,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:29,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:29,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:29,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:29,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:35:29,707 INFO L87 Difference]: Start difference. First operand 1632 states and 4614 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:30,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:30,204 INFO L93 Difference]: Finished difference Result 1718 states and 4813 transitions. [2025-04-13 22:35:30,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:35:30,204 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:30,204 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:30,211 INFO L225 Difference]: With dead ends: 1718 [2025-04-13 22:35:30,212 INFO L226 Difference]: Without dead ends: 1653 [2025-04-13 22:35:30,212 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:35:30,212 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 221 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:30,212 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 104 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:30,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2025-04-13 22:35:30,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1632. [2025-04-13 22:35:30,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1632 states, 1631 states have (on average 2.822808093194359) internal successors, (4604), 1631 states have internal predecessors, (4604), 0 states have call successors, (0), 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:35:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 4604 transitions. [2025-04-13 22:35:30,231 INFO L79 Accepts]: Start accepts. Automaton has 1632 states and 4604 transitions. Word has length 56 [2025-04-13 22:35:30,231 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:30,231 INFO L485 AbstractCegarLoop]: Abstraction has 1632 states and 4604 transitions. [2025-04-13 22:35:30,231 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:30,231 INFO L278 IsEmpty]: Start isEmpty. Operand 1632 states and 4604 transitions. [2025-04-13 22:35:30,233 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:30,233 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:30,233 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:30,233 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2025-04-13 22:35:30,233 INFO L403 AbstractCegarLoop]: === Iteration 194 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:30,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:30,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2116252010, now seen corresponding path program 193 times [2025-04-13 22:35:30,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:30,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444646159] [2025-04-13 22:35:30,233 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:30,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:30,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:35:30,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:30,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:30,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:30,927 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:35:30,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:30,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444646159] [2025-04-13 22:35:30,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444646159] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:30,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323182145] [2025-04-13 22:35:30,928 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:30,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:30,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:30,930 INFO L229 MonitoredProcess]: Starting monitored process 65 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:35:30,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2025-04-13 22:35:31,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:35:31,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:31,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:31,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:31,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:35:31,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:31,208 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:31,208 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:35:31,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:35:31,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:31,349 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:35:31,350 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:35:31,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:31,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323182145] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:31,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:35:31,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 29 [2025-04-13 22:35:31,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389887834] [2025-04-13 22:35:31,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:31,373 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:31,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:31,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:31,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:35:31,373 INFO L87 Difference]: Start difference. First operand 1632 states and 4604 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:32,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:32,065 INFO L93 Difference]: Finished difference Result 1686 states and 4709 transitions. [2025-04-13 22:35:32,066 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:35:32,066 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:32,066 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:32,073 INFO L225 Difference]: With dead ends: 1686 [2025-04-13 22:35:32,073 INFO L226 Difference]: Without dead ends: 1648 [2025-04-13 22:35:32,073 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=195, Invalid=2061, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:35:32,074 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 211 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:32,074 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 103 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:32,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2025-04-13 22:35:32,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1627. [2025-04-13 22:35:32,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1626 states have (on average 2.8222632226322264) internal successors, (4589), 1626 states have internal predecessors, (4589), 0 states have call successors, (0), 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:35:32,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 4589 transitions. [2025-04-13 22:35:32,092 INFO L79 Accepts]: Start accepts. Automaton has 1627 states and 4589 transitions. Word has length 56 [2025-04-13 22:35:32,092 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:32,092 INFO L485 AbstractCegarLoop]: Abstraction has 1627 states and 4589 transitions. [2025-04-13 22:35:32,092 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:32,092 INFO L278 IsEmpty]: Start isEmpty. Operand 1627 states and 4589 transitions. [2025-04-13 22:35:32,094 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:32,094 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:32,094 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:32,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2025-04-13 22:35:32,294 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:32,294 INFO L403 AbstractCegarLoop]: === Iteration 195 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:32,294 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:32,294 INFO L85 PathProgramCache]: Analyzing trace with hash -713996096, now seen corresponding path program 194 times [2025-04-13 22:35:32,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:32,294 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598417642] [2025-04-13 22:35:32,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:35:32,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:32,299 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:32,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:32,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:35:32,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:32,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:32,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:32,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598417642] [2025-04-13 22:35:32,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598417642] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:32,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:32,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:35:32,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920573632] [2025-04-13 22:35:32,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:32,412 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:32,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:32,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:32,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:35:32,412 INFO L87 Difference]: Start difference. First operand 1627 states and 4589 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:33,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:33,104 INFO L93 Difference]: Finished difference Result 1893 states and 5300 transitions. [2025-04-13 22:35:33,104 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:35:33,104 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:33,104 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:33,113 INFO L225 Difference]: With dead ends: 1893 [2025-04-13 22:35:33,113 INFO L226 Difference]: Without dead ends: 1795 [2025-04-13 22:35:33,113 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=1079, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:35:33,113 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 322 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 1787 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 1796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:33,113 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 159 Invalid, 1796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1787 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:35:33,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2025-04-13 22:35:33,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1562. [2025-04-13 22:35:33,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1561 states have (on average 2.8430493273542603) internal successors, (4438), 1561 states have internal predecessors, (4438), 0 states have call successors, (0), 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:35:33,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 4438 transitions. [2025-04-13 22:35:33,134 INFO L79 Accepts]: Start accepts. Automaton has 1562 states and 4438 transitions. Word has length 56 [2025-04-13 22:35:33,134 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:33,134 INFO L485 AbstractCegarLoop]: Abstraction has 1562 states and 4438 transitions. [2025-04-13 22:35:33,134 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:33,134 INFO L278 IsEmpty]: Start isEmpty. Operand 1562 states and 4438 transitions. [2025-04-13 22:35:33,135 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:33,135 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:33,135 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:33,135 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2025-04-13 22:35:33,135 INFO L403 AbstractCegarLoop]: === Iteration 196 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:33,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:33,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1183618990, now seen corresponding path program 195 times [2025-04-13 22:35:33,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:33,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132307315] [2025-04-13 22:35:33,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:35:33,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:33,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:33,144 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:33,144 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:35:33,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:33,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:33,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:33,245 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132307315] [2025-04-13 22:35:33,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132307315] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:33,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:33,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:35:33,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420572121] [2025-04-13 22:35:33,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:33,246 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:35:33,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:33,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:35:33,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:35:33,246 INFO L87 Difference]: Start difference. First operand 1562 states and 4438 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:33,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:33,811 INFO L93 Difference]: Finished difference Result 1875 states and 5282 transitions. [2025-04-13 22:35:33,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:35:33,812 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:33,812 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:33,819 INFO L225 Difference]: With dead ends: 1875 [2025-04-13 22:35:33,820 INFO L226 Difference]: Without dead ends: 1681 [2025-04-13 22:35:33,820 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:35:33,820 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 317 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:33,820 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 133 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:33,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2025-04-13 22:35:33,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1552. [2025-04-13 22:35:33,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1551 states have (on average 2.8401031592520956) internal successors, (4405), 1551 states have internal predecessors, (4405), 0 states have call successors, (0), 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:35:33,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 4405 transitions. [2025-04-13 22:35:33,840 INFO L79 Accepts]: Start accepts. Automaton has 1552 states and 4405 transitions. Word has length 56 [2025-04-13 22:35:33,840 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:33,840 INFO L485 AbstractCegarLoop]: Abstraction has 1552 states and 4405 transitions. [2025-04-13 22:35:33,840 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:33,840 INFO L278 IsEmpty]: Start isEmpty. Operand 1552 states and 4405 transitions. [2025-04-13 22:35:33,842 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:33,842 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:33,842 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:33,842 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195 [2025-04-13 22:35:33,842 INFO L403 AbstractCegarLoop]: === Iteration 197 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:33,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:33,842 INFO L85 PathProgramCache]: Analyzing trace with hash -558222074, now seen corresponding path program 196 times [2025-04-13 22:35:33,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:33,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250243768] [2025-04-13 22:35:33,843 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:35:33,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:33,847 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:33,849 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:35:33,849 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:35:33,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:33,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:33,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250243768] [2025-04-13 22:35:33,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250243768] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:33,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:33,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:35:33,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032509981] [2025-04-13 22:35:33,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:33,922 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:35:33,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:33,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:35:33,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:35:33,922 INFO L87 Difference]: Start difference. First operand 1552 states and 4405 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:34,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:34,515 INFO L93 Difference]: Finished difference Result 1885 states and 5305 transitions. [2025-04-13 22:35:34,515 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:35:34,515 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:34,515 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:34,523 INFO L225 Difference]: With dead ends: 1885 [2025-04-13 22:35:34,523 INFO L226 Difference]: Without dead ends: 1671 [2025-04-13 22:35:34,524 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=1136, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:35:34,524 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 337 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:34,524 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 134 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:34,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2025-04-13 22:35:34,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1542. [2025-04-13 22:35:34,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1541 states have (on average 2.837118754055808) internal successors, (4372), 1541 states have internal predecessors, (4372), 0 states have call successors, (0), 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:35:34,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 4372 transitions. [2025-04-13 22:35:34,543 INFO L79 Accepts]: Start accepts. Automaton has 1542 states and 4372 transitions. Word has length 56 [2025-04-13 22:35:34,543 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:34,543 INFO L485 AbstractCegarLoop]: Abstraction has 1542 states and 4372 transitions. [2025-04-13 22:35:34,543 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:34,543 INFO L278 IsEmpty]: Start isEmpty. Operand 1542 states and 4372 transitions. [2025-04-13 22:35:34,544 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:34,545 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:34,545 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:34,545 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196 [2025-04-13 22:35:34,545 INFO L403 AbstractCegarLoop]: === Iteration 198 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:34,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:34,545 INFO L85 PathProgramCache]: Analyzing trace with hash 389590544, now seen corresponding path program 197 times [2025-04-13 22:35:34,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:34,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966449047] [2025-04-13 22:35:34,545 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:34,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:34,549 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:34,556 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:34,556 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:34,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:35,275 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:35:35,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:35,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966449047] [2025-04-13 22:35:35,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966449047] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:35,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470268218] [2025-04-13 22:35:35,276 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:35,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:35,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:35,277 INFO L229 MonitoredProcess]: Starting monitored process 66 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:35:35,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2025-04-13 22:35:35,368 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:35,385 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:35,386 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:35,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:35,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:35:35,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:35,580 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:35,581 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:35:35,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:35:35,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:35,705 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:35:35,705 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:35:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:35,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470268218] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:35,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:35:35,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 29 [2025-04-13 22:35:35,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364160014] [2025-04-13 22:35:35,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:35,729 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:35,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:35,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:35,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:35:35,729 INFO L87 Difference]: Start difference. First operand 1542 states and 4372 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:36,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:36,337 INFO L93 Difference]: Finished difference Result 1566 states and 4417 transitions. [2025-04-13 22:35:36,337 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:35:36,338 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:36,338 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:36,345 INFO L225 Difference]: With dead ends: 1566 [2025-04-13 22:35:36,345 INFO L226 Difference]: Without dead ends: 1146 [2025-04-13 22:35:36,346 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=1739, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:35:36,346 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 229 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:36,346 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 120 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:36,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-04-13 22:35:36,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1146. [2025-04-13 22:35:36,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1145 states have (on average 2.8593886462882097) internal successors, (3274), 1145 states have internal predecessors, (3274), 0 states have call successors, (0), 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:35:36,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 3274 transitions. [2025-04-13 22:35:36,361 INFO L79 Accepts]: Start accepts. Automaton has 1146 states and 3274 transitions. Word has length 56 [2025-04-13 22:35:36,361 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:36,361 INFO L485 AbstractCegarLoop]: Abstraction has 1146 states and 3274 transitions. [2025-04-13 22:35:36,361 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:36,361 INFO L278 IsEmpty]: Start isEmpty. Operand 1146 states and 3274 transitions. [2025-04-13 22:35:36,362 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:36,363 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:36,363 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:36,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2025-04-13 22:35:36,563 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable197 [2025-04-13 22:35:36,563 INFO L403 AbstractCegarLoop]: === Iteration 199 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:36,563 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:36,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1113472696, now seen corresponding path program 198 times [2025-04-13 22:35:36,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:36,563 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981423491] [2025-04-13 22:35:36,563 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:35:36,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:36,568 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:36,570 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:36,570 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:35:36,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:36,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:36,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:36,585 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981423491] [2025-04-13 22:35:36,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981423491] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:36,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:36,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:35:36,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142675374] [2025-04-13 22:35:36,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:36,585 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:35:36,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:36,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:35:36,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:35:36,586 INFO L87 Difference]: Start difference. First operand 1146 states and 3274 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:36,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:36,633 INFO L93 Difference]: Finished difference Result 1788 states and 5061 transitions. [2025-04-13 22:35:36,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:35:36,633 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:36,633 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:36,641 INFO L225 Difference]: With dead ends: 1788 [2025-04-13 22:35:36,641 INFO L226 Difference]: Without dead ends: 1074 [2025-04-13 22:35:36,641 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 22:35:36,642 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 16 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:36,642 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 10 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:35:36,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2025-04-13 22:35:36,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1074. [2025-04-13 22:35:36,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 1073 states have (on average 2.8331780055917988) internal successors, (3040), 1073 states have internal predecessors, (3040), 0 states have call successors, (0), 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:35:36,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 3040 transitions. [2025-04-13 22:35:36,656 INFO L79 Accepts]: Start accepts. Automaton has 1074 states and 3040 transitions. Word has length 56 [2025-04-13 22:35:36,656 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:36,656 INFO L485 AbstractCegarLoop]: Abstraction has 1074 states and 3040 transitions. [2025-04-13 22:35:36,656 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:36,656 INFO L278 IsEmpty]: Start isEmpty. Operand 1074 states and 3040 transitions. [2025-04-13 22:35:36,657 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:36,657 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:36,657 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:36,658 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198 [2025-04-13 22:35:36,658 INFO L403 AbstractCegarLoop]: === Iteration 200 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:36,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:36,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1718325476, now seen corresponding path program 199 times [2025-04-13 22:35:36,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:36,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242366874] [2025-04-13 22:35:36,658 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:36,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:36,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:35:36,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:36,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:36,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:37,550 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:35:37,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:37,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242366874] [2025-04-13 22:35:37,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242366874] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:37,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173769121] [2025-04-13 22:35:37,551 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:37,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:37,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:37,552 INFO L229 MonitoredProcess]: Starting monitored process 67 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:35:37,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2025-04-13 22:35:37,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:35:37,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:37,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:37,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:37,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:35:37,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:37,860 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:37,860 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:35:37,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:35:37,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:37,993 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:35:37,994 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:35:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:38,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173769121] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:38,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:35:38,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 29 [2025-04-13 22:35:38,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482686476] [2025-04-13 22:35:38,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:38,014 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:38,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:38,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:38,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:35:38,015 INFO L87 Difference]: Start difference. First operand 1074 states and 3040 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:38,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:38,603 INFO L93 Difference]: Finished difference Result 1258 states and 3509 transitions. [2025-04-13 22:35:38,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:35:38,603 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:38,603 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:38,610 INFO L225 Difference]: With dead ends: 1258 [2025-04-13 22:35:38,610 INFO L226 Difference]: Without dead ends: 1014 [2025-04-13 22:35:38,611 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=1737, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:35:38,611 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 204 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:38,611 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 123 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:38,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2025-04-13 22:35:38,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1014. [2025-04-13 22:35:38,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1013 states have (on average 2.8173741362290228) internal successors, (2854), 1013 states have internal predecessors, (2854), 0 states have call successors, (0), 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:35:38,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 2854 transitions. [2025-04-13 22:35:38,625 INFO L79 Accepts]: Start accepts. Automaton has 1014 states and 2854 transitions. Word has length 56 [2025-04-13 22:35:38,625 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:38,625 INFO L485 AbstractCegarLoop]: Abstraction has 1014 states and 2854 transitions. [2025-04-13 22:35:38,625 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:38,625 INFO L278 IsEmpty]: Start isEmpty. Operand 1014 states and 2854 transitions. [2025-04-13 22:35:38,626 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:38,626 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:38,626 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:38,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2025-04-13 22:35:38,826 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable199 [2025-04-13 22:35:38,826 INFO L403 AbstractCegarLoop]: === Iteration 201 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:38,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:38,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1856131946, now seen corresponding path program 200 times [2025-04-13 22:35:38,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:38,827 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933075532] [2025-04-13 22:35:38,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:35:38,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:38,831 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:38,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:38,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:35:38,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:38,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:38,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:38,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933075532] [2025-04-13 22:35:38,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933075532] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:38,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:38,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:35:38,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275694997] [2025-04-13 22:35:38,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:38,931 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:35:38,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:38,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:35:38,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:35:38,932 INFO L87 Difference]: Start difference. First operand 1014 states and 2854 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:39,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:39,307 INFO L93 Difference]: Finished difference Result 1111 states and 3092 transitions. [2025-04-13 22:35:39,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:35:39,307 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:39,308 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:39,314 INFO L225 Difference]: With dead ends: 1111 [2025-04-13 22:35:39,315 INFO L226 Difference]: Without dead ends: 979 [2025-04-13 22:35:39,315 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:35:39,315 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 183 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:39,315 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 45 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:39,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2025-04-13 22:35:39,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 979. [2025-04-13 22:35:39,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 978 states have (on average 2.821063394683027) internal successors, (2759), 978 states have internal predecessors, (2759), 0 states have call successors, (0), 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:35:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 2759 transitions. [2025-04-13 22:35:39,328 INFO L79 Accepts]: Start accepts. Automaton has 979 states and 2759 transitions. Word has length 56 [2025-04-13 22:35:39,328 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:39,328 INFO L485 AbstractCegarLoop]: Abstraction has 979 states and 2759 transitions. [2025-04-13 22:35:39,328 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:39,328 INFO L278 IsEmpty]: Start isEmpty. Operand 979 states and 2759 transitions. [2025-04-13 22:35:39,329 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:39,329 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:39,329 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:39,329 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200 [2025-04-13 22:35:39,329 INFO L403 AbstractCegarLoop]: === Iteration 202 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:39,329 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:39,329 INFO L85 PathProgramCache]: Analyzing trace with hash 441371998, now seen corresponding path program 201 times [2025-04-13 22:35:39,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:39,330 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051350173] [2025-04-13 22:35:39,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:35:39,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:39,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:39,338 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:39,338 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:35:39,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:39,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:39,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051350173] [2025-04-13 22:35:39,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051350173] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:39,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:39,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:35:39,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139345286] [2025-04-13 22:35:39,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:39,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:39,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:39,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:39,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:35:39,446 INFO L87 Difference]: Start difference. First operand 979 states and 2759 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:39,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:39,962 INFO L93 Difference]: Finished difference Result 1305 states and 3674 transitions. [2025-04-13 22:35:39,962 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:35:39,962 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:39,963 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:39,970 INFO L225 Difference]: With dead ends: 1305 [2025-04-13 22:35:39,970 INFO L226 Difference]: Without dead ends: 1246 [2025-04-13 22:35:39,970 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:35:39,970 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 220 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:39,970 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 114 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:39,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2025-04-13 22:35:39,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1103. [2025-04-13 22:35:39,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 1102 states have (on average 2.8502722323049) internal successors, (3141), 1102 states have internal predecessors, (3141), 0 states have call successors, (0), 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:35:39,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 3141 transitions. [2025-04-13 22:35:39,986 INFO L79 Accepts]: Start accepts. Automaton has 1103 states and 3141 transitions. Word has length 56 [2025-04-13 22:35:39,986 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:39,986 INFO L485 AbstractCegarLoop]: Abstraction has 1103 states and 3141 transitions. [2025-04-13 22:35:39,986 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:39,986 INFO L278 IsEmpty]: Start isEmpty. Operand 1103 states and 3141 transitions. [2025-04-13 22:35:39,987 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:39,987 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:39,987 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:39,987 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2025-04-13 22:35:39,987 INFO L403 AbstractCegarLoop]: === Iteration 203 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:39,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:39,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1420512594, now seen corresponding path program 202 times [2025-04-13 22:35:39,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:39,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272386665] [2025-04-13 22:35:39,987 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:35:39,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:39,992 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:39,994 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:35:39,994 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:35:39,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:40,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:40,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:40,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272386665] [2025-04-13 22:35:40,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272386665] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:40,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:40,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:35:40,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564714085] [2025-04-13 22:35:40,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:40,079 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:35:40,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:40,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:35:40,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:35:40,080 INFO L87 Difference]: Start difference. First operand 1103 states and 3141 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:40,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:40,452 INFO L93 Difference]: Finished difference Result 1227 states and 3454 transitions. [2025-04-13 22:35:40,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:35:40,453 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:40,453 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:40,460 INFO L225 Difference]: With dead ends: 1227 [2025-04-13 22:35:40,460 INFO L226 Difference]: Without dead ends: 1130 [2025-04-13 22:35:40,461 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:35:40,461 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 196 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:40,461 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 45 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:40,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2025-04-13 22:35:40,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1107. [2025-04-13 22:35:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 1106 states have (on average 2.8471971066907775) internal successors, (3149), 1106 states have internal predecessors, (3149), 0 states have call successors, (0), 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:35:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 3149 transitions. [2025-04-13 22:35:40,475 INFO L79 Accepts]: Start accepts. Automaton has 1107 states and 3149 transitions. Word has length 56 [2025-04-13 22:35:40,476 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:40,476 INFO L485 AbstractCegarLoop]: Abstraction has 1107 states and 3149 transitions. [2025-04-13 22:35:40,476 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:40,476 INFO L278 IsEmpty]: Start isEmpty. Operand 1107 states and 3149 transitions. [2025-04-13 22:35:40,477 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:40,477 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:40,477 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:40,477 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable202 [2025-04-13 22:35:40,477 INFO L403 AbstractCegarLoop]: === Iteration 204 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:40,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:40,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1579660478, now seen corresponding path program 203 times [2025-04-13 22:35:40,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:40,477 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952173519] [2025-04-13 22:35:40,477 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:40,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:40,482 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:40,489 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:40,489 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:40,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:41,194 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:35:41,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:41,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952173519] [2025-04-13 22:35:41,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952173519] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:41,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004379597] [2025-04-13 22:35:41,195 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:41,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:41,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:41,196 INFO L229 MonitoredProcess]: Starting monitored process 68 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:35:41,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2025-04-13 22:35:41,290 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:41,308 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:41,308 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:41,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:41,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:35:41,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:41,491 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:41,491 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:35:41,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:35:41,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:41,639 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:35:41,639 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:35:41,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:41,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004379597] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:41,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:35:41,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18, 12] total 31 [2025-04-13 22:35:41,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973597747] [2025-04-13 22:35:41,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:41,662 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:41,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:41,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:41,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=917, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:35:41,663 INFO L87 Difference]: Start difference. First operand 1107 states and 3149 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:42,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:42,417 INFO L93 Difference]: Finished difference Result 1279 states and 3588 transitions. [2025-04-13 22:35:42,418 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:35:42,418 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:42,418 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:42,426 INFO L225 Difference]: With dead ends: 1279 [2025-04-13 22:35:42,426 INFO L226 Difference]: Without dead ends: 1246 [2025-04-13 22:35:42,426 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=216, Invalid=2436, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:35:42,426 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 208 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:42,427 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 113 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:42,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2025-04-13 22:35:42,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1103. [2025-04-13 22:35:42,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 1102 states have (on average 2.8466424682395646) internal successors, (3137), 1102 states have internal predecessors, (3137), 0 states have call successors, (0), 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:35:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 3137 transitions. [2025-04-13 22:35:42,442 INFO L79 Accepts]: Start accepts. Automaton has 1103 states and 3137 transitions. Word has length 56 [2025-04-13 22:35:42,442 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:42,442 INFO L485 AbstractCegarLoop]: Abstraction has 1103 states and 3137 transitions. [2025-04-13 22:35:42,442 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:42,442 INFO L278 IsEmpty]: Start isEmpty. Operand 1103 states and 3137 transitions. [2025-04-13 22:35:42,443 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:42,443 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:42,443 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:42,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2025-04-13 22:35:42,643 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable203 [2025-04-13 22:35:42,644 INFO L403 AbstractCegarLoop]: === Iteration 205 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:42,644 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:42,644 INFO L85 PathProgramCache]: Analyzing trace with hash 409650382, now seen corresponding path program 204 times [2025-04-13 22:35:42,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:42,644 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316568988] [2025-04-13 22:35:42,644 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:35:42,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:42,648 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:42,653 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:42,653 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:35:42,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:42,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:42,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:42,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316568988] [2025-04-13 22:35:42,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316568988] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:42,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:42,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:35:42,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62514760] [2025-04-13 22:35:42,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:42,755 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:35:42,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:42,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:35:42,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:35:42,755 INFO L87 Difference]: Start difference. First operand 1103 states and 3137 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:43,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:43,117 INFO L93 Difference]: Finished difference Result 1208 states and 3399 transitions. [2025-04-13 22:35:43,117 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:35:43,118 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:43,118 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:43,125 INFO L225 Difference]: With dead ends: 1208 [2025-04-13 22:35:43,125 INFO L226 Difference]: Without dead ends: 1130 [2025-04-13 22:35:43,125 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:35:43,126 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 146 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:43,126 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 45 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:43,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2025-04-13 22:35:43,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1103. [2025-04-13 22:35:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 1102 states have (on average 2.8466424682395646) internal successors, (3137), 1102 states have internal predecessors, (3137), 0 states have call successors, (0), 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:35:43,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 3137 transitions. [2025-04-13 22:35:43,140 INFO L79 Accepts]: Start accepts. Automaton has 1103 states and 3137 transitions. Word has length 56 [2025-04-13 22:35:43,140 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:43,140 INFO L485 AbstractCegarLoop]: Abstraction has 1103 states and 3137 transitions. [2025-04-13 22:35:43,140 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:43,140 INFO L278 IsEmpty]: Start isEmpty. Operand 1103 states and 3137 transitions. [2025-04-13 22:35:43,141 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:43,141 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:43,141 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:43,141 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable204 [2025-04-13 22:35:43,141 INFO L403 AbstractCegarLoop]: === Iteration 206 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:43,141 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:43,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1236112324, now seen corresponding path program 205 times [2025-04-13 22:35:43,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:43,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199795894] [2025-04-13 22:35:43,142 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:43,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:43,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:35:43,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:43,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:43,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:44,007 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:35:44,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:44,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199795894] [2025-04-13 22:35:44,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199795894] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:44,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851880037] [2025-04-13 22:35:44,007 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:44,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:44,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:44,009 INFO L229 MonitoredProcess]: Starting monitored process 69 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:35:44,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2025-04-13 22:35:44,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:35:44,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:44,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:44,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:44,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:35:44,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:44,352 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:44,353 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:35:44,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:35:44,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:44,541 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:35:44,542 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:35:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:44,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851880037] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:44,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:35:44,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 31 [2025-04-13 22:35:44,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257502877] [2025-04-13 22:35:44,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:44,565 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:44,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:44,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:44,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=916, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:35:44,565 INFO L87 Difference]: Start difference. First operand 1103 states and 3137 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:45,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:45,346 INFO L93 Difference]: Finished difference Result 1283 states and 3596 transitions. [2025-04-13 22:35:45,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:35:45,346 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:45,346 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:45,353 INFO L225 Difference]: With dead ends: 1283 [2025-04-13 22:35:45,353 INFO L226 Difference]: Without dead ends: 1242 [2025-04-13 22:35:45,354 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=212, Invalid=2440, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:35:45,354 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 224 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:45,354 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 112 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:45,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2025-04-13 22:35:45,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1099. [2025-04-13 22:35:45,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 1098 states have (on average 2.8460837887067396) internal successors, (3125), 1098 states have internal predecessors, (3125), 0 states have call successors, (0), 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:35:45,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 3125 transitions. [2025-04-13 22:35:45,368 INFO L79 Accepts]: Start accepts. Automaton has 1099 states and 3125 transitions. Word has length 56 [2025-04-13 22:35:45,368 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:45,368 INFO L485 AbstractCegarLoop]: Abstraction has 1099 states and 3125 transitions. [2025-04-13 22:35:45,368 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:45,368 INFO L278 IsEmpty]: Start isEmpty. Operand 1099 states and 3125 transitions. [2025-04-13 22:35:45,369 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:45,369 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:45,369 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:45,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2025-04-13 22:35:45,569 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable205 [2025-04-13 22:35:45,570 INFO L403 AbstractCegarLoop]: === Iteration 207 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:45,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:45,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1044710548, now seen corresponding path program 206 times [2025-04-13 22:35:45,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:45,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383232828] [2025-04-13 22:35:45,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:35:45,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:45,575 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:45,578 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:45,578 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:35:45,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:45,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:45,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:45,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383232828] [2025-04-13 22:35:45,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383232828] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:45,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:45,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:35:45,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278485858] [2025-04-13 22:35:45,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:45,677 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:45,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:45,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:45,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:35:45,678 INFO L87 Difference]: Start difference. First operand 1099 states and 3125 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:46,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:46,079 INFO L93 Difference]: Finished difference Result 1189 states and 3344 transitions. [2025-04-13 22:35:46,080 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:35:46,080 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:46,080 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:46,087 INFO L225 Difference]: With dead ends: 1189 [2025-04-13 22:35:46,087 INFO L226 Difference]: Without dead ends: 1130 [2025-04-13 22:35:46,087 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:35:46,087 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 159 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:46,087 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 50 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:46,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2025-04-13 22:35:46,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1107. [2025-04-13 22:35:46,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 1106 states have (on average 2.8399638336347195) internal successors, (3141), 1106 states have internal predecessors, (3141), 0 states have call successors, (0), 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:35:46,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 3141 transitions. [2025-04-13 22:35:46,101 INFO L79 Accepts]: Start accepts. Automaton has 1107 states and 3141 transitions. Word has length 56 [2025-04-13 22:35:46,101 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:46,101 INFO L485 AbstractCegarLoop]: Abstraction has 1107 states and 3141 transitions. [2025-04-13 22:35:46,102 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:46,102 INFO L278 IsEmpty]: Start isEmpty. Operand 1107 states and 3141 transitions. [2025-04-13 22:35:46,102 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:46,103 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:46,103 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:46,103 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2025-04-13 22:35:46,103 INFO L403 AbstractCegarLoop]: === Iteration 208 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:46,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:46,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1102088220, now seen corresponding path program 207 times [2025-04-13 22:35:46,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:46,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495746488] [2025-04-13 22:35:46,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:35:46,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:46,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:46,111 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:46,111 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:35:46,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:46,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:46,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:46,221 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495746488] [2025-04-13 22:35:46,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495746488] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:46,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:46,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:35:46,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521111782] [2025-04-13 22:35:46,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:46,221 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:35:46,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:46,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:35:46,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:35:46,222 INFO L87 Difference]: Start difference. First operand 1107 states and 3141 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:46,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:46,664 INFO L93 Difference]: Finished difference Result 1271 states and 3564 transitions. [2025-04-13 22:35:46,665 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:35:46,665 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:46,665 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:46,672 INFO L225 Difference]: With dead ends: 1271 [2025-04-13 22:35:46,672 INFO L226 Difference]: Without dead ends: 1102 [2025-04-13 22:35:46,672 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:35:46,672 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 208 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:46,672 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 100 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:46,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2025-04-13 22:35:46,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1011. [2025-04-13 22:35:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1010 states have (on average 2.8108910891089107) internal successors, (2839), 1010 states have internal predecessors, (2839), 0 states have call successors, (0), 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:35:46,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 2839 transitions. [2025-04-13 22:35:46,685 INFO L79 Accepts]: Start accepts. Automaton has 1011 states and 2839 transitions. Word has length 56 [2025-04-13 22:35:46,685 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:46,685 INFO L485 AbstractCegarLoop]: Abstraction has 1011 states and 2839 transitions. [2025-04-13 22:35:46,685 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:46,685 INFO L278 IsEmpty]: Start isEmpty. Operand 1011 states and 2839 transitions. [2025-04-13 22:35:46,686 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:46,686 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:46,686 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:46,686 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207 [2025-04-13 22:35:46,686 INFO L403 AbstractCegarLoop]: === Iteration 209 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:46,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:46,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1828371662, now seen corresponding path program 208 times [2025-04-13 22:35:46,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:46,686 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490297715] [2025-04-13 22:35:46,687 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:35:46,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:46,691 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:46,693 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:35:46,693 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:35:46,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:46,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:46,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490297715] [2025-04-13 22:35:46,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490297715] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:46,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:46,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:35:46,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758215161] [2025-04-13 22:35:46,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:46,775 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:46,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:46,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:46,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:35:46,775 INFO L87 Difference]: Start difference. First operand 1011 states and 2839 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:47,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:47,134 INFO L93 Difference]: Finished difference Result 1059 states and 2944 transitions. [2025-04-13 22:35:47,134 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:35:47,134 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:47,134 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:47,141 INFO L225 Difference]: With dead ends: 1059 [2025-04-13 22:35:47,141 INFO L226 Difference]: Without dead ends: 991 [2025-04-13 22:35:47,141 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:35:47,141 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 126 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:47,142 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 50 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:47,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2025-04-13 22:35:47,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2025-04-13 22:35:47,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 2.8212121212121213) internal successors, (2793), 990 states have internal predecessors, (2793), 0 states have call successors, (0), 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:35:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 2793 transitions. [2025-04-13 22:35:47,154 INFO L79 Accepts]: Start accepts. Automaton has 991 states and 2793 transitions. Word has length 56 [2025-04-13 22:35:47,154 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:47,154 INFO L485 AbstractCegarLoop]: Abstraction has 991 states and 2793 transitions. [2025-04-13 22:35:47,154 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:47,154 INFO L278 IsEmpty]: Start isEmpty. Operand 991 states and 2793 transitions. [2025-04-13 22:35:47,155 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:47,155 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:47,155 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:47,155 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208 [2025-04-13 22:35:47,155 INFO L403 AbstractCegarLoop]: === Iteration 210 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:47,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:47,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1510839070, now seen corresponding path program 209 times [2025-04-13 22:35:47,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:47,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680698367] [2025-04-13 22:35:47,155 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:47,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:47,159 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:47,165 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:47,165 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:47,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:47,752 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:35:47,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:47,752 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680698367] [2025-04-13 22:35:47,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680698367] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:47,752 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920643469] [2025-04-13 22:35:47,752 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:47,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:47,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:47,754 INFO L229 MonitoredProcess]: Starting monitored process 70 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:35:47,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2025-04-13 22:35:47,849 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:47,868 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:47,868 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:47,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:47,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:35:47,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:48,066 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:48,066 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:35:48,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:35:48,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:48,214 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:35:48,215 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:35:48,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:48,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920643469] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:48,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:35:48,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 22:35:48,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352264749] [2025-04-13 22:35:48,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:48,238 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:48,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:48,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:48,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:35:48,239 INFO L87 Difference]: Start difference. First operand 991 states and 2793 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:48,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:48,906 INFO L93 Difference]: Finished difference Result 1246 states and 3485 transitions. [2025-04-13 22:35:48,906 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:35:48,906 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:48,907 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:48,915 INFO L225 Difference]: With dead ends: 1246 [2025-04-13 22:35:48,915 INFO L226 Difference]: Without dead ends: 1072 [2025-04-13 22:35:48,915 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=2345, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:35:48,916 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 270 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:48,916 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 108 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:48,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-04-13 22:35:48,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 981. [2025-04-13 22:35:48,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 2.816326530612245) internal successors, (2760), 980 states have internal predecessors, (2760), 0 states have call successors, (0), 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:35:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 2760 transitions. [2025-04-13 22:35:48,931 INFO L79 Accepts]: Start accepts. Automaton has 981 states and 2760 transitions. Word has length 56 [2025-04-13 22:35:48,931 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:48,931 INFO L485 AbstractCegarLoop]: Abstraction has 981 states and 2760 transitions. [2025-04-13 22:35:48,931 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:48,931 INFO L278 IsEmpty]: Start isEmpty. Operand 981 states and 2760 transitions. [2025-04-13 22:35:48,932 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:48,932 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:48,933 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:48,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2025-04-13 22:35:49,133 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable209,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:49,133 INFO L403 AbstractCegarLoop]: === Iteration 211 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:49,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:49,133 INFO L85 PathProgramCache]: Analyzing trace with hash -464940130, now seen corresponding path program 210 times [2025-04-13 22:35:49,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:49,133 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045370003] [2025-04-13 22:35:49,134 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:35:49,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:49,138 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:49,142 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:49,142 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:35:49,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:49,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:49,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045370003] [2025-04-13 22:35:49,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045370003] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:49,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:49,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:35:49,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027856130] [2025-04-13 22:35:49,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:49,234 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:35:49,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:49,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:35:49,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:35:49,234 INFO L87 Difference]: Start difference. First operand 981 states and 2760 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:49,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:49,614 INFO L93 Difference]: Finished difference Result 1121 states and 3121 transitions. [2025-04-13 22:35:49,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:35:49,614 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:49,614 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:49,621 INFO L225 Difference]: With dead ends: 1121 [2025-04-13 22:35:49,622 INFO L226 Difference]: Without dead ends: 1024 [2025-04-13 22:35:49,622 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:35:49,622 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 227 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:49,622 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 44 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:49,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2025-04-13 22:35:49,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 989. [2025-04-13 22:35:49,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 988 states have (on average 2.8137651821862346) internal successors, (2780), 988 states have internal predecessors, (2780), 0 states have call successors, (0), 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:35:49,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 2780 transitions. [2025-04-13 22:35:49,636 INFO L79 Accepts]: Start accepts. Automaton has 989 states and 2780 transitions. Word has length 56 [2025-04-13 22:35:49,636 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:49,636 INFO L485 AbstractCegarLoop]: Abstraction has 989 states and 2780 transitions. [2025-04-13 22:35:49,636 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:49,636 INFO L278 IsEmpty]: Start isEmpty. Operand 989 states and 2780 transitions. [2025-04-13 22:35:49,637 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:49,637 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:49,637 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:49,637 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable210 [2025-04-13 22:35:49,637 INFO L403 AbstractCegarLoop]: === Iteration 212 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:49,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:49,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1079754164, now seen corresponding path program 211 times [2025-04-13 22:35:49,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:49,637 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215170762] [2025-04-13 22:35:49,637 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:49,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:49,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:35:49,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:49,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:49,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:50,547 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:35:50,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:50,547 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215170762] [2025-04-13 22:35:50,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215170762] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:50,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120998406] [2025-04-13 22:35:50,548 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:50,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:50,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:50,549 INFO L229 MonitoredProcess]: Starting monitored process 71 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:35:50,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2025-04-13 22:35:50,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:35:50,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:50,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:50,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:50,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:35:50,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:50,852 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:50,852 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:35:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:35:50,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:50,985 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:35:50,986 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:35:51,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:51,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120998406] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:51,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:35:51,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 29 [2025-04-13 22:35:51,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341639683] [2025-04-13 22:35:51,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:51,006 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:51,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:51,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:51,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:35:51,007 INFO L87 Difference]: Start difference. First operand 989 states and 2780 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:51,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:51,648 INFO L93 Difference]: Finished difference Result 1173 states and 3249 transitions. [2025-04-13 22:35:51,648 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:35:51,648 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:51,648 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:51,655 INFO L225 Difference]: With dead ends: 1173 [2025-04-13 22:35:51,655 INFO L226 Difference]: Without dead ends: 949 [2025-04-13 22:35:51,656 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=206, Invalid=2146, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:35:51,656 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 272 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:51,656 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 106 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:51,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2025-04-13 22:35:51,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 949. [2025-04-13 22:35:51,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 948 states have (on average 2.810126582278481) internal successors, (2664), 948 states have internal predecessors, (2664), 0 states have call successors, (0), 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:35:51,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2664 transitions. [2025-04-13 22:35:51,668 INFO L79 Accepts]: Start accepts. Automaton has 949 states and 2664 transitions. Word has length 56 [2025-04-13 22:35:51,668 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:51,668 INFO L485 AbstractCegarLoop]: Abstraction has 949 states and 2664 transitions. [2025-04-13 22:35:51,668 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:51,668 INFO L278 IsEmpty]: Start isEmpty. Operand 949 states and 2664 transitions. [2025-04-13 22:35:51,669 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:51,669 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:51,669 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:51,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2025-04-13 22:35:51,869 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable211 [2025-04-13 22:35:51,870 INFO L403 AbstractCegarLoop]: === Iteration 213 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:51,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:51,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1365222846, now seen corresponding path program 212 times [2025-04-13 22:35:51,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:51,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924710840] [2025-04-13 22:35:51,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:35:51,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:51,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:51,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:51,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:35:51,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:51,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:51,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924710840] [2025-04-13 22:35:51,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924710840] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:51,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:51,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:35:51,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378746176] [2025-04-13 22:35:51,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:51,970 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:35:51,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:51,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:35:51,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:35:51,970 INFO L87 Difference]: Start difference. First operand 949 states and 2664 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:52,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:52,348 INFO L93 Difference]: Finished difference Result 1089 states and 3025 transitions. [2025-04-13 22:35:52,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:35:52,348 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:52,348 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:52,355 INFO L225 Difference]: With dead ends: 1089 [2025-04-13 22:35:52,355 INFO L226 Difference]: Without dead ends: 1011 [2025-04-13 22:35:52,355 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:35:52,355 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 198 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:52,356 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 44 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:52,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-04-13 22:35:52,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 949. [2025-04-13 22:35:52,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 948 states have (on average 2.810126582278481) internal successors, (2664), 948 states have internal predecessors, (2664), 0 states have call successors, (0), 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:35:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2664 transitions. [2025-04-13 22:35:52,367 INFO L79 Accepts]: Start accepts. Automaton has 949 states and 2664 transitions. Word has length 56 [2025-04-13 22:35:52,367 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:52,367 INFO L485 AbstractCegarLoop]: Abstraction has 949 states and 2664 transitions. [2025-04-13 22:35:52,367 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:52,367 INFO L278 IsEmpty]: Start isEmpty. Operand 949 states and 2664 transitions. [2025-04-13 22:35:52,368 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:52,368 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:52,368 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:52,368 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable212 [2025-04-13 22:35:52,368 INFO L403 AbstractCegarLoop]: === Iteration 214 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:52,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:52,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1211991514, now seen corresponding path program 213 times [2025-04-13 22:35:52,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:52,369 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895191329] [2025-04-13 22:35:52,369 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:35:52,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:52,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:52,377 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:52,377 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:35:52,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:52,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:52,466 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895191329] [2025-04-13 22:35:52,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895191329] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:52,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:52,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:35:52,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68583377] [2025-04-13 22:35:52,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:52,467 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:35:52,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:52,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:35:52,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:35:52,467 INFO L87 Difference]: Start difference. First operand 949 states and 2664 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:52,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:52,856 INFO L93 Difference]: Finished difference Result 1126 states and 3154 transitions. [2025-04-13 22:35:52,857 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:35:52,857 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:52,857 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:52,864 INFO L225 Difference]: With dead ends: 1126 [2025-04-13 22:35:52,864 INFO L226 Difference]: Without dead ends: 1048 [2025-04-13 22:35:52,864 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:35:52,864 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 173 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:52,864 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 80 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:52,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2025-04-13 22:35:52,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 949. [2025-04-13 22:35:52,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 948 states have (on average 2.810126582278481) internal successors, (2664), 948 states have internal predecessors, (2664), 0 states have call successors, (0), 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:35:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2664 transitions. [2025-04-13 22:35:52,876 INFO L79 Accepts]: Start accepts. Automaton has 949 states and 2664 transitions. Word has length 56 [2025-04-13 22:35:52,876 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:52,877 INFO L485 AbstractCegarLoop]: Abstraction has 949 states and 2664 transitions. [2025-04-13 22:35:52,877 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:52,877 INFO L278 IsEmpty]: Start isEmpty. Operand 949 states and 2664 transitions. [2025-04-13 22:35:52,877 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:52,877 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:52,878 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:52,878 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable213 [2025-04-13 22:35:52,878 INFO L403 AbstractCegarLoop]: === Iteration 215 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:52,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:52,878 INFO L85 PathProgramCache]: Analyzing trace with hash -89138084, now seen corresponding path program 214 times [2025-04-13 22:35:52,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:52,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858432039] [2025-04-13 22:35:52,878 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:35:52,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:52,882 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:52,885 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:35:52,885 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:35:52,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:52,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:52,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858432039] [2025-04-13 22:35:52,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858432039] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:52,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:52,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:35:52,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592627263] [2025-04-13 22:35:52,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:52,964 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:52,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:52,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:52,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:35:52,964 INFO L87 Difference]: Start difference. First operand 949 states and 2664 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:53,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:53,369 INFO L93 Difference]: Finished difference Result 1074 states and 2982 transitions. [2025-04-13 22:35:53,369 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:35:53,369 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:53,369 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:53,376 INFO L225 Difference]: With dead ends: 1074 [2025-04-13 22:35:53,376 INFO L226 Difference]: Without dead ends: 1015 [2025-04-13 22:35:53,377 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:35:53,377 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 180 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:53,377 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 49 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:53,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2025-04-13 22:35:53,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 957. [2025-04-13 22:35:53,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 956 states have (on average 2.803347280334728) internal successors, (2680), 956 states have internal predecessors, (2680), 0 states have call successors, (0), 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:35:53,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 2680 transitions. [2025-04-13 22:35:53,391 INFO L79 Accepts]: Start accepts. Automaton has 957 states and 2680 transitions. Word has length 56 [2025-04-13 22:35:53,391 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:53,391 INFO L485 AbstractCegarLoop]: Abstraction has 957 states and 2680 transitions. [2025-04-13 22:35:53,391 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:53,391 INFO L278 IsEmpty]: Start isEmpty. Operand 957 states and 2680 transitions. [2025-04-13 22:35:53,392 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:53,392 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:53,392 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:53,392 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable214 [2025-04-13 22:35:53,392 INFO L403 AbstractCegarLoop]: === Iteration 216 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:53,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:53,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1645336040, now seen corresponding path program 215 times [2025-04-13 22:35:53,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:53,392 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726418634] [2025-04-13 22:35:53,392 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:53,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:53,399 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:53,407 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:53,408 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:53,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:54,260 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:35:54,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:54,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726418634] [2025-04-13 22:35:54,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726418634] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:54,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000227704] [2025-04-13 22:35:54,260 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:54,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:54,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:54,262 INFO L229 MonitoredProcess]: Starting monitored process 72 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:35:54,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2025-04-13 22:35:54,361 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:54,379 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:54,379 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:54,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:54,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:35:54,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:54,555 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:54,556 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:35:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:35:54,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:54,744 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:35:54,744 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:35:54,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:54,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000227704] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:54,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:35:54,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 32 [2025-04-13 22:35:54,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587424967] [2025-04-13 22:35:54,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:54,767 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:54,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:54,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:54,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:35:54,768 INFO L87 Difference]: Start difference. First operand 957 states and 2680 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:55,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:55,428 INFO L93 Difference]: Finished difference Result 1146 states and 3198 transitions. [2025-04-13 22:35:55,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:35:55,428 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:55,428 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:55,436 INFO L225 Difference]: With dead ends: 1146 [2025-04-13 22:35:55,436 INFO L226 Difference]: Without dead ends: 1087 [2025-04-13 22:35:55,436 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=2551, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:35:55,436 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 228 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:55,436 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 79 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:55,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2025-04-13 22:35:55,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 961. [2025-04-13 22:35:55,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 960 states have (on average 2.8041666666666667) internal successors, (2692), 960 states have internal predecessors, (2692), 0 states have call successors, (0), 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:35:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 2692 transitions. [2025-04-13 22:35:55,451 INFO L79 Accepts]: Start accepts. Automaton has 961 states and 2692 transitions. Word has length 56 [2025-04-13 22:35:55,451 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:55,451 INFO L485 AbstractCegarLoop]: Abstraction has 961 states and 2692 transitions. [2025-04-13 22:35:55,451 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:55,451 INFO L278 IsEmpty]: Start isEmpty. Operand 961 states and 2692 transitions. [2025-04-13 22:35:55,452 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:55,452 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:55,452 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:55,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Ended with exit code 0 [2025-04-13 22:35:55,652 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable215,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:55,652 INFO L403 AbstractCegarLoop]: === Iteration 217 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:55,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:55,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1511023170, now seen corresponding path program 216 times [2025-04-13 22:35:55,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:55,653 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005217214] [2025-04-13 22:35:55,653 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:35:55,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:55,657 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:55,661 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:55,661 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:35:55,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:55,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:55,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005217214] [2025-04-13 22:35:55,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005217214] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:55,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:55,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:35:55,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443243669] [2025-04-13 22:35:55,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:55,766 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:55,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:55,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:55,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:35:55,767 INFO L87 Difference]: Start difference. First operand 961 states and 2692 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:56,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:56,148 INFO L93 Difference]: Finished difference Result 1052 states and 2912 transitions. [2025-04-13 22:35:56,149 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:35:56,149 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:56,149 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:56,156 INFO L225 Difference]: With dead ends: 1052 [2025-04-13 22:35:56,156 INFO L226 Difference]: Without dead ends: 992 [2025-04-13 22:35:56,156 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:35:56,156 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 143 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:56,156 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 49 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:56,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2025-04-13 22:35:56,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 957. [2025-04-13 22:35:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 956 states have (on average 2.803347280334728) internal successors, (2680), 956 states have internal predecessors, (2680), 0 states have call successors, (0), 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:35:56,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 2680 transitions. [2025-04-13 22:35:56,170 INFO L79 Accepts]: Start accepts. Automaton has 957 states and 2680 transitions. Word has length 56 [2025-04-13 22:35:56,170 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:56,170 INFO L485 AbstractCegarLoop]: Abstraction has 957 states and 2680 transitions. [2025-04-13 22:35:56,170 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:56,170 INFO L278 IsEmpty]: Start isEmpty. Operand 957 states and 2680 transitions. [2025-04-13 22:35:56,171 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:56,171 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:56,171 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:56,171 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable216 [2025-04-13 22:35:56,171 INFO L403 AbstractCegarLoop]: === Iteration 218 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:56,171 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:56,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1152547366, now seen corresponding path program 217 times [2025-04-13 22:35:56,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:56,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423357772] [2025-04-13 22:35:56,171 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:56,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:56,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:35:56,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:56,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:56,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:57,169 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:35:57,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:57,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423357772] [2025-04-13 22:35:57,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423357772] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:57,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901224752] [2025-04-13 22:35:57,169 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:57,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:57,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:57,171 INFO L229 MonitoredProcess]: Starting monitored process 73 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:35:57,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2025-04-13 22:35:57,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:35:57,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:35:57,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:57,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:57,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:35:57,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:57,453 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:57,453 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:35:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:35:57,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:57,636 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:35:57,636 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:35:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:57,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901224752] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:57,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:35:57,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 31 [2025-04-13 22:35:57,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148551073] [2025-04-13 22:35:57,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:57,663 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:57,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:57,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:57,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=912, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:35:57,663 INFO L87 Difference]: Start difference. First operand 957 states and 2680 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:58,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:58,293 INFO L93 Difference]: Finished difference Result 1096 states and 3064 transitions. [2025-04-13 22:35:58,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:35:58,293 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:58,293 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:58,300 INFO L225 Difference]: With dead ends: 1096 [2025-04-13 22:35:58,300 INFO L226 Difference]: Without dead ends: 1040 [2025-04-13 22:35:58,301 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=192, Invalid=2258, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:35:58,301 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 179 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:58,301 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 78 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:58,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2025-04-13 22:35:58,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 949. [2025-04-13 22:35:58,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 948 states have (on average 2.8059071729957807) internal successors, (2660), 948 states have internal predecessors, (2660), 0 states have call successors, (0), 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:35:58,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2660 transitions. [2025-04-13 22:35:58,325 INFO L79 Accepts]: Start accepts. Automaton has 949 states and 2660 transitions. Word has length 56 [2025-04-13 22:35:58,325 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:58,325 INFO L485 AbstractCegarLoop]: Abstraction has 949 states and 2660 transitions. [2025-04-13 22:35:58,325 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:58,325 INFO L278 IsEmpty]: Start isEmpty. Operand 949 states and 2660 transitions. [2025-04-13 22:35:58,326 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:58,326 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:58,326 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:58,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2025-04-13 22:35:58,526 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable217 [2025-04-13 22:35:58,527 INFO L403 AbstractCegarLoop]: === Iteration 219 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:58,527 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:58,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2053544636, now seen corresponding path program 218 times [2025-04-13 22:35:58,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:58,527 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497901485] [2025-04-13 22:35:58,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:35:58,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:58,531 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:58,536 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:58,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:35:58,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:58,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:58,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497901485] [2025-04-13 22:35:58,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497901485] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:58,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:58,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:35:58,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050723825] [2025-04-13 22:35:58,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:58,627 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:35:58,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:58,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:35:58,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:35:58,627 INFO L87 Difference]: Start difference. First operand 949 states and 2660 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:58,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:58,990 INFO L93 Difference]: Finished difference Result 1062 states and 2946 transitions. [2025-04-13 22:35:58,990 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:35:58,990 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:58,990 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:58,997 INFO L225 Difference]: With dead ends: 1062 [2025-04-13 22:35:58,997 INFO L226 Difference]: Without dead ends: 984 [2025-04-13 22:35:58,998 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:35:58,998 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 213 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:58,998 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 44 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:58,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2025-04-13 22:35:59,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 949. [2025-04-13 22:35:59,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 948 states have (on average 2.8059071729957807) internal successors, (2660), 948 states have internal predecessors, (2660), 0 states have call successors, (0), 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:35:59,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2660 transitions. [2025-04-13 22:35:59,010 INFO L79 Accepts]: Start accepts. Automaton has 949 states and 2660 transitions. Word has length 56 [2025-04-13 22:35:59,010 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:59,010 INFO L485 AbstractCegarLoop]: Abstraction has 949 states and 2660 transitions. [2025-04-13 22:35:59,010 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:59,010 INFO L278 IsEmpty]: Start isEmpty. Operand 949 states and 2660 transitions. [2025-04-13 22:35:59,011 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:59,011 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:59,011 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:59,011 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable218 [2025-04-13 22:35:59,011 INFO L403 AbstractCegarLoop]: === Iteration 220 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:59,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:59,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1954211076, now seen corresponding path program 219 times [2025-04-13 22:35:59,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:59,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530670723] [2025-04-13 22:35:59,012 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:35:59,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:59,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:59,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:35:59,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:35:59,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:59,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:59,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:59,109 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530670723] [2025-04-13 22:35:59,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530670723] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:59,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:59,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:35:59,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145549224] [2025-04-13 22:35:59,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:59,110 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:35:59,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:59,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:35:59,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:35:59,110 INFO L87 Difference]: Start difference. First operand 949 states and 2660 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:59,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:59,524 INFO L93 Difference]: Finished difference Result 1142 states and 3190 transitions. [2025-04-13 22:35:59,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:35:59,524 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:35:59,524 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:59,532 INFO L225 Difference]: With dead ends: 1142 [2025-04-13 22:35:59,532 INFO L226 Difference]: Without dead ends: 1083 [2025-04-13 22:35:59,532 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:35:59,532 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 232 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:59,532 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 81 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:59,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2025-04-13 22:35:59,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 957. [2025-04-13 22:35:59,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 956 states have (on average 2.803347280334728) internal successors, (2680), 956 states have internal predecessors, (2680), 0 states have call successors, (0), 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:35:59,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 2680 transitions. [2025-04-13 22:35:59,544 INFO L79 Accepts]: Start accepts. Automaton has 957 states and 2680 transitions. Word has length 56 [2025-04-13 22:35:59,544 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:59,544 INFO L485 AbstractCegarLoop]: Abstraction has 957 states and 2680 transitions. [2025-04-13 22:35:59,544 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:35:59,544 INFO L278 IsEmpty]: Start isEmpty. Operand 957 states and 2680 transitions. [2025-04-13 22:35:59,545 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:35:59,545 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:59,545 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:59,545 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable219 [2025-04-13 22:35:59,545 INFO L403 AbstractCegarLoop]: === Iteration 221 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:35:59,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:59,546 INFO L85 PathProgramCache]: Analyzing trace with hash 599183706, now seen corresponding path program 220 times [2025-04-13 22:35:59,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:59,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275137688] [2025-04-13 22:35:59,546 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:35:59,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:59,550 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:35:59,552 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:35:59,552 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:35:59,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:59,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:35:59,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:59,629 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275137688] [2025-04-13 22:35:59,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275137688] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:59,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:59,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:35:59,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540692835] [2025-04-13 22:35:59,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:59,630 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:35:59,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:59,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:35:59,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:35:59,630 INFO L87 Difference]: Start difference. First operand 957 states and 2680 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:00,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:00,025 INFO L93 Difference]: Finished difference Result 1078 states and 2986 transitions. [2025-04-13 22:36:00,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:36:00,025 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:00,025 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:00,032 INFO L225 Difference]: With dead ends: 1078 [2025-04-13 22:36:00,032 INFO L226 Difference]: Without dead ends: 1019 [2025-04-13 22:36:00,033 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:36:00,033 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 202 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:00,033 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 49 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:00,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2025-04-13 22:36:00,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 965. [2025-04-13 22:36:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 2.800829875518672) internal successors, (2700), 964 states have internal predecessors, (2700), 0 states have call successors, (0), 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:36:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 2700 transitions. [2025-04-13 22:36:00,045 INFO L79 Accepts]: Start accepts. Automaton has 965 states and 2700 transitions. Word has length 56 [2025-04-13 22:36:00,045 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:00,045 INFO L485 AbstractCegarLoop]: Abstraction has 965 states and 2700 transitions. [2025-04-13 22:36:00,045 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:00,045 INFO L278 IsEmpty]: Start isEmpty. Operand 965 states and 2700 transitions. [2025-04-13 22:36:00,046 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:00,046 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:00,046 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:00,046 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable220 [2025-04-13 22:36:00,046 INFO L403 AbstractCegarLoop]: === Iteration 222 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:00,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:00,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1461422402, now seen corresponding path program 221 times [2025-04-13 22:36:00,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:00,046 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827803] [2025-04-13 22:36:00,046 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:00,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:00,050 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:00,056 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:00,056 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:00,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:00,785 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:36:00,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:00,785 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827803] [2025-04-13 22:36:00,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827803] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:00,785 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676644586] [2025-04-13 22:36:00,785 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:00,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:00,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:00,787 INFO L229 MonitoredProcess]: Starting monitored process 74 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:36:00,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2025-04-13 22:36:00,884 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:00,903 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:00,903 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:00,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:00,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:36:00,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:01,051 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:36:01,051 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:36:01,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:01,058 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:36:01,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676644586] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:01,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:36:01,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 23 [2025-04-13 22:36:01,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114548424] [2025-04-13 22:36:01,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:01,058 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:01,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:01,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:01,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:36:01,058 INFO L87 Difference]: Start difference. First operand 965 states and 2700 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:01,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:01,817 INFO L93 Difference]: Finished difference Result 1143 states and 3183 transitions. [2025-04-13 22:36:01,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:36:01,817 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:01,817 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:01,824 INFO L225 Difference]: With dead ends: 1143 [2025-04-13 22:36:01,824 INFO L226 Difference]: Without dead ends: 1091 [2025-04-13 22:36:01,825 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=1708, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:36:01,825 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 212 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:01,825 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 86 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:36:01,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2025-04-13 22:36:01,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 965. [2025-04-13 22:36:01,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 2.796680497925311) internal successors, (2696), 964 states have internal predecessors, (2696), 0 states have call successors, (0), 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:36:01,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 2696 transitions. [2025-04-13 22:36:01,838 INFO L79 Accepts]: Start accepts. Automaton has 965 states and 2696 transitions. Word has length 56 [2025-04-13 22:36:01,838 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:01,838 INFO L485 AbstractCegarLoop]: Abstraction has 965 states and 2696 transitions. [2025-04-13 22:36:01,838 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:01,838 INFO L278 IsEmpty]: Start isEmpty. Operand 965 states and 2696 transitions. [2025-04-13 22:36:01,839 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:01,839 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:01,839 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:01,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Ended with exit code 0 [2025-04-13 22:36:02,039 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable221,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:02,039 INFO L403 AbstractCegarLoop]: === Iteration 223 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:02,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:02,040 INFO L85 PathProgramCache]: Analyzing trace with hash -822701380, now seen corresponding path program 222 times [2025-04-13 22:36:02,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:02,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127651783] [2025-04-13 22:36:02,040 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:36:02,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:02,044 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:02,048 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:02,048 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:36:02,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:02,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:02,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:02,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127651783] [2025-04-13 22:36:02,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127651783] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:02,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:02,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:36:02,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927103988] [2025-04-13 22:36:02,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:02,143 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:02,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:02,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:02,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:36:02,143 INFO L87 Difference]: Start difference. First operand 965 states and 2696 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:02,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:02,527 INFO L93 Difference]: Finished difference Result 1040 states and 2876 transitions. [2025-04-13 22:36:02,527 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:36:02,527 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:02,527 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:02,534 INFO L225 Difference]: With dead ends: 1040 [2025-04-13 22:36:02,534 INFO L226 Difference]: Without dead ends: 984 [2025-04-13 22:36:02,535 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:36:02,535 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 154 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:02,535 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 49 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:02,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2025-04-13 22:36:02,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 957. [2025-04-13 22:36:02,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 956 states have (on average 2.799163179916318) internal successors, (2676), 956 states have internal predecessors, (2676), 0 states have call successors, (0), 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:36:02,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 2676 transitions. [2025-04-13 22:36:02,547 INFO L79 Accepts]: Start accepts. Automaton has 957 states and 2676 transitions. Word has length 56 [2025-04-13 22:36:02,547 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:02,547 INFO L485 AbstractCegarLoop]: Abstraction has 957 states and 2676 transitions. [2025-04-13 22:36:02,547 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:02,547 INFO L278 IsEmpty]: Start isEmpty. Operand 957 states and 2676 transitions. [2025-04-13 22:36:02,548 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:02,548 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:02,548 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:02,548 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable222 [2025-04-13 22:36:02,548 INFO L403 AbstractCegarLoop]: === Iteration 224 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:02,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:02,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1117874248, now seen corresponding path program 223 times [2025-04-13 22:36:02,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:02,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187736995] [2025-04-13 22:36:02,549 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:02,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:02,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:36:02,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:02,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:02,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:03,479 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:36:03,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:03,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187736995] [2025-04-13 22:36:03,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187736995] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:03,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075088357] [2025-04-13 22:36:03,479 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:03,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:03,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:03,481 INFO L229 MonitoredProcess]: Starting monitored process 75 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:36:03,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2025-04-13 22:36:03,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:36:03,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:03,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:03,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:03,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:36:03,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:03,784 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:36:03,784 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:36:03,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:36:03,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:03,998 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:36:03,998 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:36:04,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:04,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075088357] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:04,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:36:04,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 33 [2025-04-13 22:36:04,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451627377] [2025-04-13 22:36:04,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:04,021 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:04,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:04,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:04,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1035, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:36:04,021 INFO L87 Difference]: Start difference. First operand 957 states and 2676 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:04,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:04,705 INFO L93 Difference]: Finished difference Result 1104 states and 3080 transitions. [2025-04-13 22:36:04,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:36:04,706 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:04,706 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:04,713 INFO L225 Difference]: With dead ends: 1104 [2025-04-13 22:36:04,713 INFO L226 Difference]: Without dead ends: 1040 [2025-04-13 22:36:04,713 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=216, Invalid=2646, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:36:04,713 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 211 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:04,713 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 77 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:04,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2025-04-13 22:36:04,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 949. [2025-04-13 22:36:04,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 948 states have (on average 2.80168776371308) internal successors, (2656), 948 states have internal predecessors, (2656), 0 states have call successors, (0), 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:36:04,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2656 transitions. [2025-04-13 22:36:04,726 INFO L79 Accepts]: Start accepts. Automaton has 949 states and 2656 transitions. Word has length 56 [2025-04-13 22:36:04,726 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:04,726 INFO L485 AbstractCegarLoop]: Abstraction has 949 states and 2656 transitions. [2025-04-13 22:36:04,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:04,726 INFO L278 IsEmpty]: Start isEmpty. Operand 949 states and 2656 transitions. [2025-04-13 22:36:04,727 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:04,727 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:04,727 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:04,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2025-04-13 22:36:04,927 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable223 [2025-04-13 22:36:04,927 INFO L403 AbstractCegarLoop]: === Iteration 225 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:04,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:04,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1584375230, now seen corresponding path program 224 times [2025-04-13 22:36:04,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:04,928 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060236657] [2025-04-13 22:36:04,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:36:04,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:04,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:04,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:04,936 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:36:04,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:05,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:05,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:05,031 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060236657] [2025-04-13 22:36:05,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060236657] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:05,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:05,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:36:05,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580662668] [2025-04-13 22:36:05,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:05,031 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:05,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:05,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:05,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:36:05,032 INFO L87 Difference]: Start difference. First operand 949 states and 2656 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:05,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:05,421 INFO L93 Difference]: Finished difference Result 1043 states and 2891 transitions. [2025-04-13 22:36:05,421 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:36:05,421 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:05,422 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:05,429 INFO L225 Difference]: With dead ends: 1043 [2025-04-13 22:36:05,429 INFO L226 Difference]: Without dead ends: 984 [2025-04-13 22:36:05,430 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:36:05,430 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 193 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:05,430 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 50 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:05,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2025-04-13 22:36:05,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 957. [2025-04-13 22:36:05,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 956 states have (on average 2.799163179916318) internal successors, (2676), 956 states have internal predecessors, (2676), 0 states have call successors, (0), 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:36:05,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 2676 transitions. [2025-04-13 22:36:05,443 INFO L79 Accepts]: Start accepts. Automaton has 957 states and 2676 transitions. Word has length 56 [2025-04-13 22:36:05,443 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:05,443 INFO L485 AbstractCegarLoop]: Abstraction has 957 states and 2676 transitions. [2025-04-13 22:36:05,443 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:05,443 INFO L278 IsEmpty]: Start isEmpty. Operand 957 states and 2676 transitions. [2025-04-13 22:36:05,444 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:05,444 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:05,444 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:05,444 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable224 [2025-04-13 22:36:05,445 INFO L403 AbstractCegarLoop]: === Iteration 226 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:05,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:05,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1778050422, now seen corresponding path program 225 times [2025-04-13 22:36:05,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:05,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329399369] [2025-04-13 22:36:05,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:36:05,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:05,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:05,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:05,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:36:05,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:05,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:05,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329399369] [2025-04-13 22:36:05,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329399369] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:05,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:05,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:36:05,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140420885] [2025-04-13 22:36:05,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:05,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:36:05,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:05,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:36:05,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:36:05,546 INFO L87 Difference]: Start difference. First operand 957 states and 2676 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:05,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:05,968 INFO L93 Difference]: Finished difference Result 1131 states and 3155 transitions. [2025-04-13 22:36:05,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:36:05,968 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:05,968 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:05,976 INFO L225 Difference]: With dead ends: 1131 [2025-04-13 22:36:05,976 INFO L226 Difference]: Without dead ends: 1072 [2025-04-13 22:36:05,976 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:36:05,976 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 213 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:05,976 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 87 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:05,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-04-13 22:36:05,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 973. [2025-04-13 22:36:05,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 972 states have (on average 2.794238683127572) internal successors, (2716), 972 states have internal predecessors, (2716), 0 states have call successors, (0), 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:36:05,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 2716 transitions. [2025-04-13 22:36:05,989 INFO L79 Accepts]: Start accepts. Automaton has 973 states and 2716 transitions. Word has length 56 [2025-04-13 22:36:05,989 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:05,989 INFO L485 AbstractCegarLoop]: Abstraction has 973 states and 2716 transitions. [2025-04-13 22:36:05,989 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:05,989 INFO L278 IsEmpty]: Start isEmpty. Operand 973 states and 2716 transitions. [2025-04-13 22:36:05,990 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:05,990 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:05,990 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:05,990 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable225 [2025-04-13 22:36:05,990 INFO L403 AbstractCegarLoop]: === Iteration 227 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:05,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:05,990 INFO L85 PathProgramCache]: Analyzing trace with hash 162490144, now seen corresponding path program 226 times [2025-04-13 22:36:05,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:05,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042968930] [2025-04-13 22:36:05,990 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:36:05,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:05,995 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:05,997 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:36:05,997 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:36:05,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:06,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:06,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042968930] [2025-04-13 22:36:06,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042968930] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:06,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:06,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:36:06,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133146393] [2025-04-13 22:36:06,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:06,075 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:06,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:06,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:06,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:36:06,076 INFO L87 Difference]: Start difference. First operand 973 states and 2716 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:06,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:06,438 INFO L93 Difference]: Finished difference Result 1048 states and 2896 transitions. [2025-04-13 22:36:06,438 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:36:06,438 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:06,438 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:06,446 INFO L225 Difference]: With dead ends: 1048 [2025-04-13 22:36:06,446 INFO L226 Difference]: Without dead ends: 996 [2025-04-13 22:36:06,446 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:36:06,446 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 146 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:06,446 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 50 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:06,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2025-04-13 22:36:06,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 969. [2025-04-13 22:36:06,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 968 states have (on average 2.793388429752066) internal successors, (2704), 968 states have internal predecessors, (2704), 0 states have call successors, (0), 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:36:06,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 2704 transitions. [2025-04-13 22:36:06,458 INFO L79 Accepts]: Start accepts. Automaton has 969 states and 2704 transitions. Word has length 56 [2025-04-13 22:36:06,458 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:06,458 INFO L485 AbstractCegarLoop]: Abstraction has 969 states and 2704 transitions. [2025-04-13 22:36:06,458 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:06,458 INFO L278 IsEmpty]: Start isEmpty. Operand 969 states and 2704 transitions. [2025-04-13 22:36:06,459 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:06,459 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:06,459 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:06,459 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable226 [2025-04-13 22:36:06,459 INFO L403 AbstractCegarLoop]: === Iteration 228 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:06,460 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:06,460 INFO L85 PathProgramCache]: Analyzing trace with hash -639761942, now seen corresponding path program 227 times [2025-04-13 22:36:06,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:06,460 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818018563] [2025-04-13 22:36:06,460 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:06,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:06,464 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:06,471 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:06,471 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:06,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:07,280 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:36:07,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:07,280 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818018563] [2025-04-13 22:36:07,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818018563] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:07,280 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358478468] [2025-04-13 22:36:07,280 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:07,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:07,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:07,282 INFO L229 MonitoredProcess]: Starting monitored process 76 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:36:07,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2025-04-13 22:36:07,381 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:07,399 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:07,400 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:07,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:07,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:36:07,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:07,552 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:36:07,552 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:36:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:07,559 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:36:07,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358478468] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:07,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:36:07,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 23 [2025-04-13 22:36:07,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895684673] [2025-04-13 22:36:07,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:07,559 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:07,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:07,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:07,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:36:07,559 INFO L87 Difference]: Start difference. First operand 969 states and 2704 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:08,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:08,286 INFO L93 Difference]: Finished difference Result 1093 states and 3041 transitions. [2025-04-13 22:36:08,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:36:08,286 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:08,286 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:08,293 INFO L225 Difference]: With dead ends: 1093 [2025-04-13 22:36:08,293 INFO L226 Difference]: Without dead ends: 1060 [2025-04-13 22:36:08,293 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=1397, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:36:08,293 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 179 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:08,294 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 93 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:36:08,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2025-04-13 22:36:08,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 961. [2025-04-13 22:36:08,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 960 states have (on average 2.7916666666666665) internal successors, (2680), 960 states have internal predecessors, (2680), 0 states have call successors, (0), 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:36:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 2680 transitions. [2025-04-13 22:36:08,306 INFO L79 Accepts]: Start accepts. Automaton has 961 states and 2680 transitions. Word has length 56 [2025-04-13 22:36:08,306 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:08,306 INFO L485 AbstractCegarLoop]: Abstraction has 961 states and 2680 transitions. [2025-04-13 22:36:08,306 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:08,306 INFO L278 IsEmpty]: Start isEmpty. Operand 961 states and 2680 transitions. [2025-04-13 22:36:08,307 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:08,307 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:08,307 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:08,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2025-04-13 22:36:08,507 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable227 [2025-04-13 22:36:08,507 INFO L403 AbstractCegarLoop]: === Iteration 229 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:08,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:08,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1897568038, now seen corresponding path program 228 times [2025-04-13 22:36:08,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:08,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297515095] [2025-04-13 22:36:08,507 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:36:08,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:08,512 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:08,515 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:08,515 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:36:08,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:08,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:08,612 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297515095] [2025-04-13 22:36:08,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297515095] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:08,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:08,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:36:08,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988791939] [2025-04-13 22:36:08,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:08,612 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:08,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:08,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:08,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:36:08,612 INFO L87 Difference]: Start difference. First operand 961 states and 2680 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:08,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:08,978 INFO L93 Difference]: Finished difference Result 1017 states and 2805 transitions. [2025-04-13 22:36:08,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:36:08,979 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:08,979 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:08,986 INFO L225 Difference]: With dead ends: 1017 [2025-04-13 22:36:08,986 INFO L226 Difference]: Without dead ends: 941 [2025-04-13 22:36:08,987 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:36:08,987 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 148 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:08,987 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 50 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:08,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-04-13 22:36:08,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 941. [2025-04-13 22:36:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 940 states have (on average 2.802127659574468) internal successors, (2634), 940 states have internal predecessors, (2634), 0 states have call successors, (0), 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:36:08,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2634 transitions. [2025-04-13 22:36:08,999 INFO L79 Accepts]: Start accepts. Automaton has 941 states and 2634 transitions. Word has length 56 [2025-04-13 22:36:08,999 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:08,999 INFO L485 AbstractCegarLoop]: Abstraction has 941 states and 2634 transitions. [2025-04-13 22:36:08,999 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:08,999 INFO L278 IsEmpty]: Start isEmpty. Operand 941 states and 2634 transitions. [2025-04-13 22:36:09,000 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:09,000 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:09,000 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:09,000 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable228 [2025-04-13 22:36:09,000 INFO L403 AbstractCegarLoop]: === Iteration 230 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:09,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:09,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1170737992, now seen corresponding path program 229 times [2025-04-13 22:36:09,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:09,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485746785] [2025-04-13 22:36:09,001 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:09,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:09,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:36:09,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:09,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:09,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:09,877 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:36:09,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:09,878 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485746785] [2025-04-13 22:36:09,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485746785] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:09,878 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92300280] [2025-04-13 22:36:09,878 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:09,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:09,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:09,879 INFO L229 MonitoredProcess]: Starting monitored process 77 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:36:09,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2025-04-13 22:36:09,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:36:09,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:09,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:09,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:09,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:36:09,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:10,192 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:36:10,192 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:36:10,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:36:10,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:10,408 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:36:10,408 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:36:10,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:10,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92300280] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:10,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:36:10,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 33 [2025-04-13 22:36:10,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607824703] [2025-04-13 22:36:10,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:10,428 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:10,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:10,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:10,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1034, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:36:10,429 INFO L87 Difference]: Start difference. First operand 941 states and 2634 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:11,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:11,073 INFO L93 Difference]: Finished difference Result 1061 states and 2963 transitions. [2025-04-13 22:36:11,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:36:11,073 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:11,073 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:11,080 INFO L225 Difference]: With dead ends: 1061 [2025-04-13 22:36:11,080 INFO L226 Difference]: Without dead ends: 936 [2025-04-13 22:36:11,080 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=189, Invalid=2261, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:36:11,080 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 175 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:11,081 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 90 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:11,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-04-13 22:36:11,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 845. [2025-04-13 22:36:11,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 2.8199052132701423) internal successors, (2380), 844 states have internal predecessors, (2380), 0 states have call successors, (0), 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:36:11,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 2380 transitions. [2025-04-13 22:36:11,093 INFO L79 Accepts]: Start accepts. Automaton has 845 states and 2380 transitions. Word has length 56 [2025-04-13 22:36:11,093 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:11,093 INFO L485 AbstractCegarLoop]: Abstraction has 845 states and 2380 transitions. [2025-04-13 22:36:11,093 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:11,093 INFO L278 IsEmpty]: Start isEmpty. Operand 845 states and 2380 transitions. [2025-04-13 22:36:11,094 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:11,094 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:11,094 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:11,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Ended with exit code 0 [2025-04-13 22:36:11,294 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable229,77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:11,294 INFO L403 AbstractCegarLoop]: === Iteration 231 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:11,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:11,295 INFO L85 PathProgramCache]: Analyzing trace with hash -12614066, now seen corresponding path program 230 times [2025-04-13 22:36:11,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:11,295 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890044343] [2025-04-13 22:36:11,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:36:11,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:11,299 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:11,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:11,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:36:11,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:11,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:11,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:11,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890044343] [2025-04-13 22:36:11,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890044343] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:11,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:11,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:36:11,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953380594] [2025-04-13 22:36:11,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:11,395 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:36:11,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:11,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:36:11,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:36:11,395 INFO L87 Difference]: Start difference. First operand 845 states and 2380 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:11,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:11,787 INFO L93 Difference]: Finished difference Result 1010 states and 2828 transitions. [2025-04-13 22:36:11,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:36:11,788 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:11,788 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:11,795 INFO L225 Difference]: With dead ends: 1010 [2025-04-13 22:36:11,795 INFO L226 Difference]: Without dead ends: 913 [2025-04-13 22:36:11,796 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:36:11,796 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 221 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:11,796 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 60 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:11,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2025-04-13 22:36:11,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 853. [2025-04-13 22:36:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 852 states have (on average 2.816901408450704) internal successors, (2400), 852 states have internal predecessors, (2400), 0 states have call successors, (0), 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:36:11,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 2400 transitions. [2025-04-13 22:36:11,807 INFO L79 Accepts]: Start accepts. Automaton has 853 states and 2400 transitions. Word has length 56 [2025-04-13 22:36:11,807 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:11,807 INFO L485 AbstractCegarLoop]: Abstraction has 853 states and 2400 transitions. [2025-04-13 22:36:11,807 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:11,807 INFO L278 IsEmpty]: Start isEmpty. Operand 853 states and 2400 transitions. [2025-04-13 22:36:11,808 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:11,808 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:11,808 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:11,808 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable230 [2025-04-13 22:36:11,808 INFO L403 AbstractCegarLoop]: === Iteration 232 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:11,808 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:11,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1446964220, now seen corresponding path program 231 times [2025-04-13 22:36:11,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:11,808 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756547272] [2025-04-13 22:36:11,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:36:11,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:11,813 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:11,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:11,816 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:36:11,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:11,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:11,919 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756547272] [2025-04-13 22:36:11,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756547272] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:11,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:11,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:36:11,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551502135] [2025-04-13 22:36:11,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:11,919 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:11,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:11,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:11,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:36:11,919 INFO L87 Difference]: Start difference. First operand 853 states and 2400 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:12,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:12,449 INFO L93 Difference]: Finished difference Result 1250 states and 3528 transitions. [2025-04-13 22:36:12,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:36:12,450 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:12,450 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:12,458 INFO L225 Difference]: With dead ends: 1250 [2025-04-13 22:36:12,458 INFO L226 Difference]: Without dead ends: 1191 [2025-04-13 22:36:12,458 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=1212, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:36:12,458 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 304 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:12,458 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 107 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:36:12,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2025-04-13 22:36:12,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 967. [2025-04-13 22:36:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 966 states have (on average 2.8457556935817805) internal successors, (2749), 966 states have internal predecessors, (2749), 0 states have call successors, (0), 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:36:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 2749 transitions. [2025-04-13 22:36:12,472 INFO L79 Accepts]: Start accepts. Automaton has 967 states and 2749 transitions. Word has length 56 [2025-04-13 22:36:12,472 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:12,472 INFO L485 AbstractCegarLoop]: Abstraction has 967 states and 2749 transitions. [2025-04-13 22:36:12,472 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:12,472 INFO L278 IsEmpty]: Start isEmpty. Operand 967 states and 2749 transitions. [2025-04-13 22:36:12,473 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:12,473 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:12,473 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:12,473 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable231 [2025-04-13 22:36:12,473 INFO L403 AbstractCegarLoop]: === Iteration 233 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:12,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:12,473 INFO L85 PathProgramCache]: Analyzing trace with hash 363187980, now seen corresponding path program 232 times [2025-04-13 22:36:12,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:12,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513041862] [2025-04-13 22:36:12,474 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:36:12,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:12,478 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:12,481 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:36:12,481 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:36:12,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:12,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:12,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:12,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513041862] [2025-04-13 22:36:12,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513041862] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:12,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:12,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:36:12,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267045036] [2025-04-13 22:36:12,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:12,559 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:12,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:12,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:12,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:36:12,560 INFO L87 Difference]: Start difference. First operand 967 states and 2749 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:12,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:12,975 INFO L93 Difference]: Finished difference Result 1105 states and 3122 transitions. [2025-04-13 22:36:12,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:36:12,975 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:12,975 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:12,983 INFO L225 Difference]: With dead ends: 1105 [2025-04-13 22:36:12,983 INFO L226 Difference]: Without dead ends: 1046 [2025-04-13 22:36:12,983 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:36:12,983 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 187 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:12,983 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 67 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:12,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-04-13 22:36:12,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 971. [2025-04-13 22:36:12,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 2.8422680412371135) internal successors, (2757), 970 states have internal predecessors, (2757), 0 states have call successors, (0), 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:36:12,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 2757 transitions. [2025-04-13 22:36:12,998 INFO L79 Accepts]: Start accepts. Automaton has 971 states and 2757 transitions. Word has length 56 [2025-04-13 22:36:12,998 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:12,998 INFO L485 AbstractCegarLoop]: Abstraction has 971 states and 2757 transitions. [2025-04-13 22:36:12,998 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:12,998 INFO L278 IsEmpty]: Start isEmpty. Operand 971 states and 2757 transitions. [2025-04-13 22:36:12,999 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:12,999 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:12,999 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:12,999 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable232 [2025-04-13 22:36:12,999 INFO L403 AbstractCegarLoop]: === Iteration 234 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:12,999 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:12,999 INFO L85 PathProgramCache]: Analyzing trace with hash -308675740, now seen corresponding path program 233 times [2025-04-13 22:36:12,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:12,999 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909576374] [2025-04-13 22:36:12,999 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:12,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:13,004 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:13,012 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:13,012 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:13,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:13,729 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:36:13,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:13,729 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909576374] [2025-04-13 22:36:13,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909576374] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:13,729 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923805926] [2025-04-13 22:36:13,729 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:13,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:13,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:13,731 INFO L229 MonitoredProcess]: Starting monitored process 78 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:36:13,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2025-04-13 22:36:13,833 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:13,851 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:13,852 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:13,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:13,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:36:13,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:14,078 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:36:14,078 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:36:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:36:14,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:14,274 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:36:14,274 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:36:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:14,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923805926] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:14,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:36:14,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18, 12] total 33 [2025-04-13 22:36:14,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680559436] [2025-04-13 22:36:14,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:14,296 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:14,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:14,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:14,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1041, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:36:14,296 INFO L87 Difference]: Start difference. First operand 971 states and 2757 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:15,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:15,103 INFO L93 Difference]: Finished difference Result 1224 states and 3442 transitions. [2025-04-13 22:36:15,103 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:36:15,103 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:15,103 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:15,110 INFO L225 Difference]: With dead ends: 1224 [2025-04-13 22:36:15,110 INFO L226 Difference]: Without dead ends: 1191 [2025-04-13 22:36:15,111 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=233, Invalid=2959, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:36:15,111 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 234 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:15,111 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 104 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:36:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2025-04-13 22:36:15,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 967. [2025-04-13 22:36:15,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 966 states have (on average 2.841614906832298) internal successors, (2745), 966 states have internal predecessors, (2745), 0 states have call successors, (0), 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:36:15,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 2745 transitions. [2025-04-13 22:36:15,124 INFO L79 Accepts]: Start accepts. Automaton has 967 states and 2745 transitions. Word has length 56 [2025-04-13 22:36:15,125 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:15,125 INFO L485 AbstractCegarLoop]: Abstraction has 967 states and 2745 transitions. [2025-04-13 22:36:15,125 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:15,125 INFO L278 IsEmpty]: Start isEmpty. Operand 967 states and 2745 transitions. [2025-04-13 22:36:15,125 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:15,125 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:15,126 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:15,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2025-04-13 22:36:15,326 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable233 [2025-04-13 22:36:15,326 INFO L403 AbstractCegarLoop]: === Iteration 235 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:15,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:15,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1058697106, now seen corresponding path program 234 times [2025-04-13 22:36:15,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:15,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011604887] [2025-04-13 22:36:15,326 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:36:15,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:15,331 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:15,335 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:15,335 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:36:15,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:15,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:15,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:15,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011604887] [2025-04-13 22:36:15,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011604887] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:15,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:15,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:36:15,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618036710] [2025-04-13 22:36:15,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:15,430 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:15,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:15,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:15,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:36:15,430 INFO L87 Difference]: Start difference. First operand 967 states and 2745 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:15,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:15,812 INFO L93 Difference]: Finished difference Result 1067 states and 3012 transitions. [2025-04-13 22:36:15,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:36:15,813 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:15,813 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:15,820 INFO L225 Difference]: With dead ends: 1067 [2025-04-13 22:36:15,821 INFO L226 Difference]: Without dead ends: 1007 [2025-04-13 22:36:15,821 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:36:15,821 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 152 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:15,821 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 67 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:15,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2025-04-13 22:36:15,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 955. [2025-04-13 22:36:15,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 954 states have (on average 2.8438155136268346) internal successors, (2713), 954 states have internal predecessors, (2713), 0 states have call successors, (0), 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:36:15,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 2713 transitions. [2025-04-13 22:36:15,834 INFO L79 Accepts]: Start accepts. Automaton has 955 states and 2713 transitions. Word has length 56 [2025-04-13 22:36:15,834 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:15,834 INFO L485 AbstractCegarLoop]: Abstraction has 955 states and 2713 transitions. [2025-04-13 22:36:15,834 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:15,834 INFO L278 IsEmpty]: Start isEmpty. Operand 955 states and 2713 transitions. [2025-04-13 22:36:15,835 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:15,835 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:15,835 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:15,835 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable234 [2025-04-13 22:36:15,835 INFO L403 AbstractCegarLoop]: === Iteration 236 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:15,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:15,835 INFO L85 PathProgramCache]: Analyzing trace with hash -652223894, now seen corresponding path program 235 times [2025-04-13 22:36:15,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:15,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429957663] [2025-04-13 22:36:15,835 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:15,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:15,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:36:15,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:15,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:15,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:16,958 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:36:16,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:16,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429957663] [2025-04-13 22:36:16,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429957663] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:16,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576956335] [2025-04-13 22:36:16,958 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:16,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:16,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:16,960 INFO L229 MonitoredProcess]: Starting monitored process 79 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:36:16,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2025-04-13 22:36:17,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:36:17,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:17,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:17,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:17,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:36:17,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:17,316 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:36:17,316 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:36:17,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:36:17,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:17,588 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:36:17,588 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:36:17,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:17,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576956335] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:17,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:36:17,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 35 [2025-04-13 22:36:17,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141495806] [2025-04-13 22:36:17,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:17,612 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:17,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:17,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:17,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1178, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:36:17,613 INFO L87 Difference]: Start difference. First operand 955 states and 2713 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:18,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:18,461 INFO L93 Difference]: Finished difference Result 1216 states and 3418 transitions. [2025-04-13 22:36:18,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:36:18,461 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:18,461 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:18,468 INFO L225 Difference]: With dead ends: 1216 [2025-04-13 22:36:18,468 INFO L226 Difference]: Without dead ends: 1175 [2025-04-13 22:36:18,469 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=229, Invalid=3077, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 22:36:18,469 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 241 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:18,469 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 103 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:36:18,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2025-04-13 22:36:18,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 951. [2025-04-13 22:36:18,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 950 states have (on average 2.843157894736842) internal successors, (2701), 950 states have internal predecessors, (2701), 0 states have call successors, (0), 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:36:18,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 2701 transitions. [2025-04-13 22:36:18,482 INFO L79 Accepts]: Start accepts. Automaton has 951 states and 2701 transitions. Word has length 56 [2025-04-13 22:36:18,483 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:18,483 INFO L485 AbstractCegarLoop]: Abstraction has 951 states and 2701 transitions. [2025-04-13 22:36:18,483 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:18,483 INFO L278 IsEmpty]: Start isEmpty. Operand 951 states and 2701 transitions. [2025-04-13 22:36:18,484 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:18,484 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:18,484 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:18,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Ended with exit code 0 [2025-04-13 22:36:18,684 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable235,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:18,684 INFO L403 AbstractCegarLoop]: === Iteration 237 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:18,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:18,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2036701294, now seen corresponding path program 236 times [2025-04-13 22:36:18,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:18,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398101815] [2025-04-13 22:36:18,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:36:18,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:18,689 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:18,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:18,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:36:18,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:18,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:18,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:18,787 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398101815] [2025-04-13 22:36:18,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398101815] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:18,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:18,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:36:18,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899774007] [2025-04-13 22:36:18,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:18,787 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:18,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:18,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:18,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:36:18,787 INFO L87 Difference]: Start difference. First operand 951 states and 2701 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:19,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:19,215 INFO L93 Difference]: Finished difference Result 1116 states and 3149 transitions. [2025-04-13 22:36:19,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:36:19,215 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:19,216 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:19,223 INFO L225 Difference]: With dead ends: 1116 [2025-04-13 22:36:19,223 INFO L226 Difference]: Without dead ends: 1057 [2025-04-13 22:36:19,224 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=156, Invalid=900, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:36:19,224 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 221 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:19,224 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 67 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:19,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2025-04-13 22:36:19,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 959. [2025-04-13 22:36:19,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 958 states have (on average 2.8402922755741127) internal successors, (2721), 958 states have internal predecessors, (2721), 0 states have call successors, (0), 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:36:19,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 2721 transitions. [2025-04-13 22:36:19,236 INFO L79 Accepts]: Start accepts. Automaton has 959 states and 2721 transitions. Word has length 56 [2025-04-13 22:36:19,237 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:19,237 INFO L485 AbstractCegarLoop]: Abstraction has 959 states and 2721 transitions. [2025-04-13 22:36:19,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:19,237 INFO L278 IsEmpty]: Start isEmpty. Operand 959 states and 2721 transitions. [2025-04-13 22:36:19,238 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:19,238 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:19,238 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:19,238 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable236 [2025-04-13 22:36:19,238 INFO L403 AbstractCegarLoop]: === Iteration 238 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:19,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:19,238 INFO L85 PathProgramCache]: Analyzing trace with hash -786247998, now seen corresponding path program 237 times [2025-04-13 22:36:19,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:19,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127817843] [2025-04-13 22:36:19,238 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:36:19,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:19,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:19,246 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:19,246 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:36:19,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:19,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:19,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:19,350 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127817843] [2025-04-13 22:36:19,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127817843] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:19,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:19,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:36:19,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262343485] [2025-04-13 22:36:19,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:19,351 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:36:19,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:19,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:36:19,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:36:19,351 INFO L87 Difference]: Start difference. First operand 959 states and 2721 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:19,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:19,785 INFO L93 Difference]: Finished difference Result 1185 states and 3339 transitions. [2025-04-13 22:36:19,786 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:36:19,786 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:19,786 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:19,793 INFO L225 Difference]: With dead ends: 1185 [2025-04-13 22:36:19,793 INFO L226 Difference]: Without dead ends: 1016 [2025-04-13 22:36:19,793 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:36:19,794 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 228 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:19,794 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 94 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:19,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2025-04-13 22:36:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 863. [2025-04-13 22:36:19,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 862 states have (on average 2.8062645011600926) internal successors, (2419), 862 states have internal predecessors, (2419), 0 states have call successors, (0), 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:36:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 2419 transitions. [2025-04-13 22:36:19,805 INFO L79 Accepts]: Start accepts. Automaton has 863 states and 2419 transitions. Word has length 56 [2025-04-13 22:36:19,805 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:19,805 INFO L485 AbstractCegarLoop]: Abstraction has 863 states and 2419 transitions. [2025-04-13 22:36:19,805 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:19,805 INFO L278 IsEmpty]: Start isEmpty. Operand 863 states and 2419 transitions. [2025-04-13 22:36:19,806 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:19,806 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:19,806 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:19,806 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable237 [2025-04-13 22:36:19,806 INFO L403 AbstractCegarLoop]: === Iteration 239 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:19,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:19,806 INFO L85 PathProgramCache]: Analyzing trace with hash 614816208, now seen corresponding path program 238 times [2025-04-13 22:36:19,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:19,806 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802359159] [2025-04-13 22:36:19,806 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:36:19,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:19,811 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:19,813 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:36:19,813 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:36:19,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:19,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:19,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:19,890 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802359159] [2025-04-13 22:36:19,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802359159] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:19,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:19,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:36:19,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975059949] [2025-04-13 22:36:19,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:19,890 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:19,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:19,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:19,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:36:19,890 INFO L87 Difference]: Start difference. First operand 863 states and 2419 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:20,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:20,303 INFO L93 Difference]: Finished difference Result 1009 states and 2812 transitions. [2025-04-13 22:36:20,303 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:36:20,304 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:20,304 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:20,311 INFO L225 Difference]: With dead ends: 1009 [2025-04-13 22:36:20,311 INFO L226 Difference]: Without dead ends: 957 [2025-04-13 22:36:20,311 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:36:20,311 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 177 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:20,311 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 67 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:20,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2025-04-13 22:36:20,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 859. [2025-04-13 22:36:20,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 858 states have (on average 2.8053613053613056) internal successors, (2407), 858 states have internal predecessors, (2407), 0 states have call successors, (0), 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:36:20,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 2407 transitions. [2025-04-13 22:36:20,323 INFO L79 Accepts]: Start accepts. Automaton has 859 states and 2407 transitions. Word has length 56 [2025-04-13 22:36:20,323 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:20,323 INFO L485 AbstractCegarLoop]: Abstraction has 859 states and 2407 transitions. [2025-04-13 22:36:20,323 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:20,323 INFO L278 IsEmpty]: Start isEmpty. Operand 859 states and 2407 transitions. [2025-04-13 22:36:20,324 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:20,324 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:20,324 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:20,324 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable238 [2025-04-13 22:36:20,324 INFO L403 AbstractCegarLoop]: === Iteration 240 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:20,324 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:20,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1853559958, now seen corresponding path program 239 times [2025-04-13 22:36:20,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:20,324 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786669256] [2025-04-13 22:36:20,324 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:20,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:20,329 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:20,337 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:20,337 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:20,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:21,149 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:36:21,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:21,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786669256] [2025-04-13 22:36:21,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786669256] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:21,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284883631] [2025-04-13 22:36:21,149 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:21,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:21,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:21,151 INFO L229 MonitoredProcess]: Starting monitored process 80 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:36:21,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2025-04-13 22:36:21,255 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:21,272 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:21,272 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:21,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:21,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:36:21,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:21,485 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:36:21,485 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:36:21,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:36:21,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:21,678 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:36:21,679 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:36:21,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:21,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284883631] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:21,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:36:21,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18, 12] total 34 [2025-04-13 22:36:21,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637920067] [2025-04-13 22:36:21,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:21,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:21,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:21,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:21,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1103, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:36:21,700 INFO L87 Difference]: Start difference. First operand 859 states and 2407 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:22,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:22,306 INFO L93 Difference]: Finished difference Result 1114 states and 3099 transitions. [2025-04-13 22:36:22,306 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:36:22,306 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:22,306 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:22,314 INFO L225 Difference]: With dead ends: 1114 [2025-04-13 22:36:22,314 INFO L226 Difference]: Without dead ends: 930 [2025-04-13 22:36:22,314 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=2274, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:36:22,314 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 172 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:22,314 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 99 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:22,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-04-13 22:36:22,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 839. [2025-04-13 22:36:22,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 838 states have (on average 2.805489260143198) internal successors, (2351), 838 states have internal predecessors, (2351), 0 states have call successors, (0), 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:36:22,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 2351 transitions. [2025-04-13 22:36:22,326 INFO L79 Accepts]: Start accepts. Automaton has 839 states and 2351 transitions. Word has length 56 [2025-04-13 22:36:22,326 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:22,326 INFO L485 AbstractCegarLoop]: Abstraction has 839 states and 2351 transitions. [2025-04-13 22:36:22,326 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:22,326 INFO L278 IsEmpty]: Start isEmpty. Operand 839 states and 2351 transitions. [2025-04-13 22:36:22,327 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:22,327 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:22,327 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:22,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Ended with exit code 0 [2025-04-13 22:36:22,527 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable239 [2025-04-13 22:36:22,527 INFO L403 AbstractCegarLoop]: === Iteration 241 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:22,528 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:22,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1445241974, now seen corresponding path program 240 times [2025-04-13 22:36:22,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:22,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336491212] [2025-04-13 22:36:22,528 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:36:22,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:22,533 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:22,536 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:22,536 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:36:22,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:22,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:22,640 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336491212] [2025-04-13 22:36:22,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336491212] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:22,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:22,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:36:22,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558942516] [2025-04-13 22:36:22,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:22,640 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:22,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:22,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:22,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:36:22,640 INFO L87 Difference]: Start difference. First operand 839 states and 2351 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:23,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:23,070 INFO L93 Difference]: Finished difference Result 966 states and 2689 transitions. [2025-04-13 22:36:23,070 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:36:23,070 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:23,070 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:23,077 INFO L225 Difference]: With dead ends: 966 [2025-04-13 22:36:23,077 INFO L226 Difference]: Without dead ends: 898 [2025-04-13 22:36:23,077 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:36:23,077 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 179 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:23,077 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 67 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:23,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2025-04-13 22:36:23,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 827. [2025-04-13 22:36:23,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 826 states have (on average 2.807506053268765) internal successors, (2319), 826 states have internal predecessors, (2319), 0 states have call successors, (0), 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:36:23,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 2319 transitions. [2025-04-13 22:36:23,088 INFO L79 Accepts]: Start accepts. Automaton has 827 states and 2319 transitions. Word has length 56 [2025-04-13 22:36:23,088 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:23,088 INFO L485 AbstractCegarLoop]: Abstraction has 827 states and 2319 transitions. [2025-04-13 22:36:23,088 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:23,088 INFO L278 IsEmpty]: Start isEmpty. Operand 827 states and 2319 transitions. [2025-04-13 22:36:23,089 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:23,089 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:23,089 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:23,089 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable240 [2025-04-13 22:36:23,089 INFO L403 AbstractCegarLoop]: === Iteration 242 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:23,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:23,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1399414224, now seen corresponding path program 241 times [2025-04-13 22:36:23,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:23,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605472671] [2025-04-13 22:36:23,090 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:23,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:23,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:36:23,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:23,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:23,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:24,279 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:36:24,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:24,280 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605472671] [2025-04-13 22:36:24,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605472671] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:24,280 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453807402] [2025-04-13 22:36:24,280 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:24,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:24,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:24,282 INFO L229 MonitoredProcess]: Starting monitored process 81 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:36:24,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2025-04-13 22:36:24,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:36:24,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:24,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:24,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:24,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:36:24,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:24,588 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:36:24,588 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:36:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:36:24,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:24,783 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:36:24,783 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:36:24,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:24,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453807402] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:24,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:36:24,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 32 [2025-04-13 22:36:24,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471825652] [2025-04-13 22:36:24,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:24,804 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:24,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:24,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:24,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:36:24,804 INFO L87 Difference]: Start difference. First operand 827 states and 2319 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:25,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:25,658 INFO L93 Difference]: Finished difference Result 1153 states and 3234 transitions. [2025-04-13 22:36:25,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:36:25,658 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:25,658 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:25,666 INFO L225 Difference]: With dead ends: 1153 [2025-04-13 22:36:25,666 INFO L226 Difference]: Without dead ends: 1094 [2025-04-13 22:36:25,666 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=265, Invalid=2927, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:36:25,666 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 303 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:25,667 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 104 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:36:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2025-04-13 22:36:25,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 899. [2025-04-13 22:36:25,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 898 states have (on average 2.83184855233853) internal successors, (2543), 898 states have internal predecessors, (2543), 0 states have call successors, (0), 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:36:25,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 2543 transitions. [2025-04-13 22:36:25,680 INFO L79 Accepts]: Start accepts. Automaton has 899 states and 2543 transitions. Word has length 56 [2025-04-13 22:36:25,680 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:25,680 INFO L485 AbstractCegarLoop]: Abstraction has 899 states and 2543 transitions. [2025-04-13 22:36:25,680 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:25,680 INFO L278 IsEmpty]: Start isEmpty. Operand 899 states and 2543 transitions. [2025-04-13 22:36:25,681 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:25,681 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:25,681 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:25,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2025-04-13 22:36:25,881 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable241,81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:25,881 INFO L403 AbstractCegarLoop]: === Iteration 243 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:25,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:25,882 INFO L85 PathProgramCache]: Analyzing trace with hash -118006004, now seen corresponding path program 242 times [2025-04-13 22:36:25,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:25,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890456754] [2025-04-13 22:36:25,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:36:25,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:25,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:25,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:25,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:36:25,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:25,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:25,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:25,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890456754] [2025-04-13 22:36:25,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890456754] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:25,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:25,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:36:25,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309461557] [2025-04-13 22:36:25,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:25,980 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:36:25,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:25,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:36:25,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:36:25,981 INFO L87 Difference]: Start difference. First operand 899 states and 2543 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:26,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:26,376 INFO L93 Difference]: Finished difference Result 1081 states and 3054 transitions. [2025-04-13 22:36:26,376 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:36:26,376 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:26,376 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:26,384 INFO L225 Difference]: With dead ends: 1081 [2025-04-13 22:36:26,384 INFO L226 Difference]: Without dead ends: 1022 [2025-04-13 22:36:26,384 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:36:26,384 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 225 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:26,384 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 69 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:26,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2025-04-13 22:36:26,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 899. [2025-04-13 22:36:26,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 898 states have (on average 2.83184855233853) internal successors, (2543), 898 states have internal predecessors, (2543), 0 states have call successors, (0), 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:36:26,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 2543 transitions. [2025-04-13 22:36:26,397 INFO L79 Accepts]: Start accepts. Automaton has 899 states and 2543 transitions. Word has length 56 [2025-04-13 22:36:26,397 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:26,397 INFO L485 AbstractCegarLoop]: Abstraction has 899 states and 2543 transitions. [2025-04-13 22:36:26,397 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:26,397 INFO L278 IsEmpty]: Start isEmpty. Operand 899 states and 2543 transitions. [2025-04-13 22:36:26,398 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:26,398 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:26,398 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:26,398 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable242 [2025-04-13 22:36:26,398 INFO L403 AbstractCegarLoop]: === Iteration 244 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:26,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:26,398 INFO L85 PathProgramCache]: Analyzing trace with hash 906625550, now seen corresponding path program 243 times [2025-04-13 22:36:26,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:26,398 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922694902] [2025-04-13 22:36:26,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:36:26,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:26,403 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:26,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:26,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:36:26,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:26,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:26,509 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922694902] [2025-04-13 22:36:26,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922694902] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:26,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:26,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:36:26,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901890132] [2025-04-13 22:36:26,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:26,510 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:26,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:26,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:26,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:36:26,510 INFO L87 Difference]: Start difference. First operand 899 states and 2543 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:27,027 INFO L93 Difference]: Finished difference Result 1190 states and 3345 transitions. [2025-04-13 22:36:27,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:36:27,027 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:27,027 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:27,035 INFO L225 Difference]: With dead ends: 1190 [2025-04-13 22:36:27,035 INFO L226 Difference]: Without dead ends: 1138 [2025-04-13 22:36:27,035 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=1063, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:36:27,035 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 253 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:27,035 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 103 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:27,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2025-04-13 22:36:27,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 995. [2025-04-13 22:36:27,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 994 states have (on average 2.852112676056338) internal successors, (2835), 994 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 2835 transitions. [2025-04-13 22:36:27,048 INFO L79 Accepts]: Start accepts. Automaton has 995 states and 2835 transitions. Word has length 56 [2025-04-13 22:36:27,048 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:27,048 INFO L485 AbstractCegarLoop]: Abstraction has 995 states and 2835 transitions. [2025-04-13 22:36:27,048 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:27,048 INFO L278 IsEmpty]: Start isEmpty. Operand 995 states and 2835 transitions. [2025-04-13 22:36:27,049 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:27,049 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:27,049 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:27,049 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable243 [2025-04-13 22:36:27,049 INFO L403 AbstractCegarLoop]: === Iteration 245 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:27,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:27,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1539891090, now seen corresponding path program 244 times [2025-04-13 22:36:27,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:27,049 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133382400] [2025-04-13 22:36:27,049 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:36:27,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:27,054 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:27,056 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:36:27,056 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:36:27,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:27,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:27,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:27,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133382400] [2025-04-13 22:36:27,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133382400] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:27,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:27,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:36:27,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125870482] [2025-04-13 22:36:27,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:27,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:36:27,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:27,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:36:27,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:36:27,130 INFO L87 Difference]: Start difference. First operand 995 states and 2835 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:27,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:27,512 INFO L93 Difference]: Finished difference Result 1114 states and 3153 transitions. [2025-04-13 22:36:27,512 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:36:27,512 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:27,512 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:27,520 INFO L225 Difference]: With dead ends: 1114 [2025-04-13 22:36:27,520 INFO L226 Difference]: Without dead ends: 1062 [2025-04-13 22:36:27,520 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:36:27,520 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 189 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:27,520 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 69 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:27,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2025-04-13 22:36:27,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 991. [2025-04-13 22:36:27,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 2.8515151515151516) internal successors, (2823), 990 states have internal predecessors, (2823), 0 states have call successors, (0), 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:36:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 2823 transitions. [2025-04-13 22:36:27,533 INFO L79 Accepts]: Start accepts. Automaton has 991 states and 2823 transitions. Word has length 56 [2025-04-13 22:36:27,533 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:27,533 INFO L485 AbstractCegarLoop]: Abstraction has 991 states and 2823 transitions. [2025-04-13 22:36:27,533 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:27,533 INFO L278 IsEmpty]: Start isEmpty. Operand 991 states and 2823 transitions. [2025-04-13 22:36:27,534 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:27,534 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:27,534 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:27,534 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable244 [2025-04-13 22:36:27,534 INFO L403 AbstractCegarLoop]: === Iteration 246 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:27,534 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:27,534 INFO L85 PathProgramCache]: Analyzing trace with hash 53235342, now seen corresponding path program 245 times [2025-04-13 22:36:27,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:27,534 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274661773] [2025-04-13 22:36:27,534 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:27,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:27,539 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:27,546 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:27,546 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:27,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:28,249 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:36:28,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:28,249 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274661773] [2025-04-13 22:36:28,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274661773] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:28,249 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522446338] [2025-04-13 22:36:28,249 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:28,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:28,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:28,251 INFO L229 MonitoredProcess]: Starting monitored process 82 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:36:28,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2025-04-13 22:36:28,356 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:28,373 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:28,373 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:28,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:28,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:36:28,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:28,607 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:36:28,607 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:36:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:36:28,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:28,803 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:36:28,803 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:36:28,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:28,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522446338] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:28,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:36:28,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18, 12] total 34 [2025-04-13 22:36:28,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116402834] [2025-04-13 22:36:28,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:28,825 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:28,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:28,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:28,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1106, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:36:28,826 INFO L87 Difference]: Start difference. First operand 991 states and 2823 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:29,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:29,614 INFO L93 Difference]: Finished difference Result 1167 states and 3270 transitions. [2025-04-13 22:36:29,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:36:29,614 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:29,614 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:29,621 INFO L225 Difference]: With dead ends: 1167 [2025-04-13 22:36:29,621 INFO L226 Difference]: Without dead ends: 1130 [2025-04-13 22:36:29,622 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=223, Invalid=2857, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 22:36:29,622 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 221 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:29,622 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 102 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:36:29,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2025-04-13 22:36:29,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 987. [2025-04-13 22:36:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 986 states have (on average 2.8509127789046653) internal successors, (2811), 986 states have internal predecessors, (2811), 0 states have call successors, (0), 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:36:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 2811 transitions. [2025-04-13 22:36:29,636 INFO L79 Accepts]: Start accepts. Automaton has 987 states and 2811 transitions. Word has length 56 [2025-04-13 22:36:29,636 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:29,636 INFO L485 AbstractCegarLoop]: Abstraction has 987 states and 2811 transitions. [2025-04-13 22:36:29,636 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:29,636 INFO L278 IsEmpty]: Start isEmpty. Operand 987 states and 2811 transitions. [2025-04-13 22:36:29,637 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:29,637 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:29,637 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:29,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Ended with exit code 0 [2025-04-13 22:36:29,838 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable245 [2025-04-13 22:36:29,838 INFO L403 AbstractCegarLoop]: === Iteration 247 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:29,838 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:29,838 INFO L85 PathProgramCache]: Analyzing trace with hash 695018024, now seen corresponding path program 246 times [2025-04-13 22:36:29,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:29,838 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246741921] [2025-04-13 22:36:29,838 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:36:29,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:29,843 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:29,847 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:29,847 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:36:29,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:29,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:29,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:29,938 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246741921] [2025-04-13 22:36:29,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246741921] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:29,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:29,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:36:29,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608379021] [2025-04-13 22:36:29,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:29,939 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:36:29,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:29,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:36:29,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:36:29,939 INFO L87 Difference]: Start difference. First operand 987 states and 2811 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:30,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:30,326 INFO L93 Difference]: Finished difference Result 1114 states and 3149 transitions. [2025-04-13 22:36:30,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:36:30,326 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:30,326 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:30,333 INFO L225 Difference]: With dead ends: 1114 [2025-04-13 22:36:30,333 INFO L226 Difference]: Without dead ends: 1054 [2025-04-13 22:36:30,334 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:36:30,334 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 195 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:30,334 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 69 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:30,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2025-04-13 22:36:30,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 983. [2025-04-13 22:36:30,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 982 states have (on average 2.85030549898167) internal successors, (2799), 982 states have internal predecessors, (2799), 0 states have call successors, (0), 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:36:30,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 2799 transitions. [2025-04-13 22:36:30,347 INFO L79 Accepts]: Start accepts. Automaton has 983 states and 2799 transitions. Word has length 56 [2025-04-13 22:36:30,347 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:30,347 INFO L485 AbstractCegarLoop]: Abstraction has 983 states and 2799 transitions. [2025-04-13 22:36:30,347 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:30,347 INFO L278 IsEmpty]: Start isEmpty. Operand 983 states and 2799 transitions. [2025-04-13 22:36:30,348 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:30,348 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:30,348 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:30,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable246 [2025-04-13 22:36:30,348 INFO L403 AbstractCegarLoop]: === Iteration 248 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:30,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:30,348 INFO L85 PathProgramCache]: Analyzing trace with hash -80788762, now seen corresponding path program 247 times [2025-04-13 22:36:30,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:30,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365511365] [2025-04-13 22:36:30,348 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:30,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:30,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:36:30,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:30,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:30,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:31,482 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:36:31,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:31,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365511365] [2025-04-13 22:36:31,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365511365] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:31,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793864577] [2025-04-13 22:36:31,482 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:31,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:31,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:31,484 INFO L229 MonitoredProcess]: Starting monitored process 83 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:36:31,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2025-04-13 22:36:31,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:36:31,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:31,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:31,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:31,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:36:31,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:31,824 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:36:31,824 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:36:31,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:36:31,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:32,021 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:36:32,021 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:36:32,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:32,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793864577] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:32,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:36:32,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 33 [2025-04-13 22:36:32,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079340238] [2025-04-13 22:36:32,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:32,042 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:32,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:32,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:32,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1040, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:36:32,042 INFO L87 Difference]: Start difference. First operand 983 states and 2799 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:32,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:32,715 INFO L93 Difference]: Finished difference Result 1147 states and 3222 transitions. [2025-04-13 22:36:32,715 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:36:32,716 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:32,716 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:32,723 INFO L225 Difference]: With dead ends: 1147 [2025-04-13 22:36:32,723 INFO L226 Difference]: Without dead ends: 982 [2025-04-13 22:36:32,724 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=195, Invalid=2355, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:36:32,724 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 214 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:32,724 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 103 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:36:32,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2025-04-13 22:36:32,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 891. [2025-04-13 22:36:32,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 890 states have (on average 2.8191011235955057) internal successors, (2509), 890 states have internal predecessors, (2509), 0 states have call successors, (0), 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:36:32,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 2509 transitions. [2025-04-13 22:36:32,736 INFO L79 Accepts]: Start accepts. Automaton has 891 states and 2509 transitions. Word has length 56 [2025-04-13 22:36:32,737 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:32,737 INFO L485 AbstractCegarLoop]: Abstraction has 891 states and 2509 transitions. [2025-04-13 22:36:32,737 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:32,737 INFO L278 IsEmpty]: Start isEmpty. Operand 891 states and 2509 transitions. [2025-04-13 22:36:32,737 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:32,738 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:32,738 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:32,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2025-04-13 22:36:32,938 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable247 [2025-04-13 22:36:32,938 INFO L403 AbstractCegarLoop]: === Iteration 249 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:32,938 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:32,938 INFO L85 PathProgramCache]: Analyzing trace with hash 835238096, now seen corresponding path program 248 times [2025-04-13 22:36:32,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:32,938 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338298505] [2025-04-13 22:36:32,938 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:36:32,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:32,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:32,947 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:32,947 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:36:32,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:33,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:33,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:33,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338298505] [2025-04-13 22:36:33,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338298505] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:33,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:33,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:36:33,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146342269] [2025-04-13 22:36:33,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:33,040 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:36:33,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:33,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:36:33,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:36:33,040 INFO L87 Difference]: Start difference. First operand 891 states and 2509 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:33,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:33,414 INFO L93 Difference]: Finished difference Result 1035 states and 2866 transitions. [2025-04-13 22:36:33,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:36:33,414 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:33,414 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:33,423 INFO L225 Difference]: With dead ends: 1035 [2025-04-13 22:36:33,424 INFO L226 Difference]: Without dead ends: 671 [2025-04-13 22:36:33,424 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:36:33,424 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 187 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:33,424 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 77 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:33,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-04-13 22:36:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2025-04-13 22:36:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 670 states have (on average 2.7477611940298505) internal successors, (1841), 670 states have internal predecessors, (1841), 0 states have call successors, (0), 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:36:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1841 transitions. [2025-04-13 22:36:33,436 INFO L79 Accepts]: Start accepts. Automaton has 671 states and 1841 transitions. Word has length 56 [2025-04-13 22:36:33,436 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:33,436 INFO L485 AbstractCegarLoop]: Abstraction has 671 states and 1841 transitions. [2025-04-13 22:36:33,436 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:33,436 INFO L278 IsEmpty]: Start isEmpty. Operand 671 states and 1841 transitions. [2025-04-13 22:36:33,437 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:33,437 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:33,437 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:33,437 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable248 [2025-04-13 22:36:33,437 INFO L403 AbstractCegarLoop]: === Iteration 250 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:33,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:33,438 INFO L85 PathProgramCache]: Analyzing trace with hash 992818486, now seen corresponding path program 249 times [2025-04-13 22:36:33,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:33,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29826313] [2025-04-13 22:36:33,438 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:36:33,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:33,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:33,446 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:33,446 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:36:33,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:33,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:33,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:33,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29826313] [2025-04-13 22:36:33,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29826313] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:33,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:33,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:36:33,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992797784] [2025-04-13 22:36:33,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:33,544 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:36:33,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:33,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:36:33,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:36:33,545 INFO L87 Difference]: Start difference. First operand 671 states and 1841 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:33,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:33,955 INFO L93 Difference]: Finished difference Result 926 states and 2533 transitions. [2025-04-13 22:36:33,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:36:33,955 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:33,955 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:33,962 INFO L225 Difference]: With dead ends: 926 [2025-04-13 22:36:33,962 INFO L226 Difference]: Without dead ends: 752 [2025-04-13 22:36:33,963 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:36:33,963 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 183 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:33,963 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 93 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:33,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2025-04-13 22:36:33,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 661. [2025-04-13 22:36:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 2.7393939393939393) internal successors, (1808), 660 states have internal predecessors, (1808), 0 states have call successors, (0), 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:36:33,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1808 transitions. [2025-04-13 22:36:33,973 INFO L79 Accepts]: Start accepts. Automaton has 661 states and 1808 transitions. Word has length 56 [2025-04-13 22:36:33,973 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:33,973 INFO L485 AbstractCegarLoop]: Abstraction has 661 states and 1808 transitions. [2025-04-13 22:36:33,973 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:33,973 INFO L278 IsEmpty]: Start isEmpty. Operand 661 states and 1808 transitions. [2025-04-13 22:36:33,974 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:33,974 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:33,974 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:33,974 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable249 [2025-04-13 22:36:33,974 INFO L403 AbstractCegarLoop]: === Iteration 251 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:33,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:33,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1214075008, now seen corresponding path program 250 times [2025-04-13 22:36:33,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:33,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908075960] [2025-04-13 22:36:33,974 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:36:33,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:33,979 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:33,981 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:36:33,981 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:36:33,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:34,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:34,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:34,060 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908075960] [2025-04-13 22:36:34,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908075960] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:34,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:34,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:36:34,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393930252] [2025-04-13 22:36:34,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:34,061 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:34,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:34,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:34,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:36:34,061 INFO L87 Difference]: Start difference. First operand 661 states and 1808 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:34,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:34,523 INFO L93 Difference]: Finished difference Result 1005 states and 2811 transitions. [2025-04-13 22:36:34,523 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:36:34,523 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:34,523 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:34,530 INFO L225 Difference]: With dead ends: 1005 [2025-04-13 22:36:34,530 INFO L226 Difference]: Without dead ends: 908 [2025-04-13 22:36:34,531 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=1083, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:36:34,531 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 296 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:34,531 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 69 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:34,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2025-04-13 22:36:34,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 775. [2025-04-13 22:36:34,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 774 states have (on average 2.7868217054263567) internal successors, (2157), 774 states have internal predecessors, (2157), 0 states have call successors, (0), 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:36:34,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 2157 transitions. [2025-04-13 22:36:34,543 INFO L79 Accepts]: Start accepts. Automaton has 775 states and 2157 transitions. Word has length 56 [2025-04-13 22:36:34,543 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:34,543 INFO L485 AbstractCegarLoop]: Abstraction has 775 states and 2157 transitions. [2025-04-13 22:36:34,543 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:34,543 INFO L278 IsEmpty]: Start isEmpty. Operand 775 states and 2157 transitions. [2025-04-13 22:36:34,544 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:34,544 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:34,544 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:34,544 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable250 [2025-04-13 22:36:34,544 INFO L403 AbstractCegarLoop]: === Iteration 252 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:34,544 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:34,544 INFO L85 PathProgramCache]: Analyzing trace with hash -630368730, now seen corresponding path program 251 times [2025-04-13 22:36:34,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:34,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010715071] [2025-04-13 22:36:34,545 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:34,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:34,549 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:34,556 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:34,556 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:34,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:35,316 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:36:35,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:35,317 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010715071] [2025-04-13 22:36:35,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010715071] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:35,317 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788536381] [2025-04-13 22:36:35,317 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:35,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:35,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:35,318 INFO L229 MonitoredProcess]: Starting monitored process 84 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:36:35,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2025-04-13 22:36:35,430 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:35,448 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:35,448 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:35,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:35,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:36:35,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:35,641 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:36:35,641 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:36:35,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:36:35,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:35,792 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:36:35,792 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:36:35,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:35,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788536381] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:35,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:36:35,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18, 12] total 32 [2025-04-13 22:36:35,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650163046] [2025-04-13 22:36:35,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:35,815 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:35,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:35,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:35,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:36:35,815 INFO L87 Difference]: Start difference. First operand 775 states and 2157 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:36,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:36,439 INFO L93 Difference]: Finished difference Result 959 states and 2626 transitions. [2025-04-13 22:36:36,439 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:36:36,439 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:36,439 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:36,446 INFO L225 Difference]: With dead ends: 959 [2025-04-13 22:36:36,446 INFO L226 Difference]: Without dead ends: 725 [2025-04-13 22:36:36,447 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=221, Invalid=2431, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:36:36,447 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 221 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:36,447 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 97 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:36,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2025-04-13 22:36:36,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2025-04-13 22:36:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 2.787292817679558) internal successors, (2018), 724 states have internal predecessors, (2018), 0 states have call successors, (0), 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:36:36,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 2018 transitions. [2025-04-13 22:36:36,457 INFO L79 Accepts]: Start accepts. Automaton has 725 states and 2018 transitions. Word has length 56 [2025-04-13 22:36:36,457 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:36,457 INFO L485 AbstractCegarLoop]: Abstraction has 725 states and 2018 transitions. [2025-04-13 22:36:36,457 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:36,457 INFO L278 IsEmpty]: Start isEmpty. Operand 725 states and 2018 transitions. [2025-04-13 22:36:36,458 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:36,458 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:36,458 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:36,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Forceful destruction successful, exit code 0 [2025-04-13 22:36:36,658 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable251,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:36,658 INFO L403 AbstractCegarLoop]: === Iteration 253 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:36,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:36,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1589877054, now seen corresponding path program 252 times [2025-04-13 22:36:36,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:36,659 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434481040] [2025-04-13 22:36:36,659 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:36:36,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:36,664 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:36,667 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:36,667 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:36:36,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:36,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:36,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:36,760 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434481040] [2025-04-13 22:36:36,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434481040] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:36,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:36,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:36:36,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769469383] [2025-04-13 22:36:36,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:36,760 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:36,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:36,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:36,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:36:36,761 INFO L87 Difference]: Start difference. First operand 725 states and 2018 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:37,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:37,184 INFO L93 Difference]: Finished difference Result 944 states and 2637 transitions. [2025-04-13 22:36:37,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:36:37,184 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:37,184 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:37,191 INFO L225 Difference]: With dead ends: 944 [2025-04-13 22:36:37,191 INFO L226 Difference]: Without dead ends: 885 [2025-04-13 22:36:37,192 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=905, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:36:37,192 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 197 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:37,192 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 68 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:37,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-04-13 22:36:37,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 729. [2025-04-13 22:36:37,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 728 states have (on average 2.782967032967033) internal successors, (2026), 728 states have internal predecessors, (2026), 0 states have call successors, (0), 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:36:37,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 2026 transitions. [2025-04-13 22:36:37,202 INFO L79 Accepts]: Start accepts. Automaton has 729 states and 2026 transitions. Word has length 56 [2025-04-13 22:36:37,202 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:37,202 INFO L485 AbstractCegarLoop]: Abstraction has 729 states and 2026 transitions. [2025-04-13 22:36:37,202 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:37,202 INFO L278 IsEmpty]: Start isEmpty. Operand 729 states and 2026 transitions. [2025-04-13 22:36:37,203 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:37,203 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:37,203 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:37,203 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable252 [2025-04-13 22:36:37,203 INFO L403 AbstractCegarLoop]: === Iteration 254 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:37,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:37,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1711280578, now seen corresponding path program 253 times [2025-04-13 22:36:37,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:37,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313893867] [2025-04-13 22:36:37,203 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:37,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:37,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:36:37,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:37,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:37,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:38,032 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:36:38,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:38,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313893867] [2025-04-13 22:36:38,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313893867] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:38,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431990250] [2025-04-13 22:36:38,033 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:38,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:38,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:38,035 INFO L229 MonitoredProcess]: Starting monitored process 85 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:36:38,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2025-04-13 22:36:38,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:36:38,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:38,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:38,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:38,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:36:38,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:38,363 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:36:38,363 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:36:38,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:36:38,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:38,572 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:36:38,572 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:36:38,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:38,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431990250] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:38,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:36:38,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 33 [2025-04-13 22:36:38,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272630770] [2025-04-13 22:36:38,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:38,594 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:38,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:38,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:38,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:36:38,594 INFO L87 Difference]: Start difference. First operand 729 states and 2026 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:39,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:39,287 INFO L93 Difference]: Finished difference Result 1024 states and 2870 transitions. [2025-04-13 22:36:39,287 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:36:39,287 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:39,287 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:39,294 INFO L225 Difference]: With dead ends: 1024 [2025-04-13 22:36:39,294 INFO L226 Difference]: Without dead ends: 946 [2025-04-13 22:36:39,295 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=211, Invalid=2545, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:36:39,295 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 184 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:39,295 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 66 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:39,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-04-13 22:36:39,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 805. [2025-04-13 22:36:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 804 states have (on average 2.8134328358208953) internal successors, (2262), 804 states have internal predecessors, (2262), 0 states have call successors, (0), 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:36:39,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 2262 transitions. [2025-04-13 22:36:39,307 INFO L79 Accepts]: Start accepts. Automaton has 805 states and 2262 transitions. Word has length 56 [2025-04-13 22:36:39,307 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:39,307 INFO L485 AbstractCegarLoop]: Abstraction has 805 states and 2262 transitions. [2025-04-13 22:36:39,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:39,307 INFO L278 IsEmpty]: Start isEmpty. Operand 805 states and 2262 transitions. [2025-04-13 22:36:39,308 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:39,308 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:39,308 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:39,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Ended with exit code 0 [2025-04-13 22:36:39,508 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable253,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:39,508 INFO L403 AbstractCegarLoop]: === Iteration 255 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:39,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:39,508 INFO L85 PathProgramCache]: Analyzing trace with hash 167991968, now seen corresponding path program 254 times [2025-04-13 22:36:39,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:39,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085239367] [2025-04-13 22:36:39,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:36:39,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:39,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:39,517 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:39,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:36:39,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:39,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:39,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085239367] [2025-04-13 22:36:39,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085239367] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:39,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:39,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:36:39,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720557067] [2025-04-13 22:36:39,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:39,610 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:39,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:39,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:39,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:36:39,610 INFO L87 Difference]: Start difference. First operand 805 states and 2262 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:40,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:40,014 INFO L93 Difference]: Finished difference Result 986 states and 2775 transitions. [2025-04-13 22:36:40,014 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:36:40,014 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:40,014 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:40,023 INFO L225 Difference]: With dead ends: 986 [2025-04-13 22:36:40,023 INFO L226 Difference]: Without dead ends: 926 [2025-04-13 22:36:40,023 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:36:40,023 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 185 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:40,023 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 68 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:40,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-04-13 22:36:40,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 793. [2025-04-13 22:36:40,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 792 states have (on average 2.8156565656565657) internal successors, (2230), 792 states have internal predecessors, (2230), 0 states have call successors, (0), 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:36:40,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 2230 transitions. [2025-04-13 22:36:40,036 INFO L79 Accepts]: Start accepts. Automaton has 793 states and 2230 transitions. Word has length 56 [2025-04-13 22:36:40,036 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:40,037 INFO L485 AbstractCegarLoop]: Abstraction has 793 states and 2230 transitions. [2025-04-13 22:36:40,037 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:40,037 INFO L278 IsEmpty]: Start isEmpty. Operand 793 states and 2230 transitions. [2025-04-13 22:36:40,037 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:40,037 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:40,037 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:40,038 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable254 [2025-04-13 22:36:40,038 INFO L403 AbstractCegarLoop]: === Iteration 256 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:40,038 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:40,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1146046976, now seen corresponding path program 255 times [2025-04-13 22:36:40,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:40,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38162485] [2025-04-13 22:36:40,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:36:40,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:40,043 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:40,047 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:40,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:36:40,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:40,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:40,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:40,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38162485] [2025-04-13 22:36:40,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38162485] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:40,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:40,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:36:40,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530605925] [2025-04-13 22:36:40,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:40,143 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:40,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:40,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:40,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:36:40,144 INFO L87 Difference]: Start difference. First operand 793 states and 2230 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:40,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:40,600 INFO L93 Difference]: Finished difference Result 1105 states and 3131 transitions. [2025-04-13 22:36:40,600 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:36:40,600 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:40,600 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:40,608 INFO L225 Difference]: With dead ends: 1105 [2025-04-13 22:36:40,608 INFO L226 Difference]: Without dead ends: 1046 [2025-04-13 22:36:40,608 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=952, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:36:40,608 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 176 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:40,608 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 79 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:40,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-04-13 22:36:40,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 849. [2025-04-13 22:36:40,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 848 states have (on average 2.830188679245283) internal successors, (2400), 848 states have internal predecessors, (2400), 0 states have call successors, (0), 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:36:40,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2400 transitions. [2025-04-13 22:36:40,623 INFO L79 Accepts]: Start accepts. Automaton has 849 states and 2400 transitions. Word has length 56 [2025-04-13 22:36:40,623 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:40,623 INFO L485 AbstractCegarLoop]: Abstraction has 849 states and 2400 transitions. [2025-04-13 22:36:40,623 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:40,623 INFO L278 IsEmpty]: Start isEmpty. Operand 849 states and 2400 transitions. [2025-04-13 22:36:40,624 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:40,624 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:40,624 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:40,624 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable255 [2025-04-13 22:36:40,624 INFO L403 AbstractCegarLoop]: === Iteration 257 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:40,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:40,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1031576928, now seen corresponding path program 256 times [2025-04-13 22:36:40,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:40,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917577593] [2025-04-13 22:36:40,624 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:36:40,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:40,629 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:40,631 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:36:40,632 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:36:40,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:40,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:40,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917577593] [2025-04-13 22:36:40,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917577593] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:40,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:40,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:36:40,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701464332] [2025-04-13 22:36:40,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:40,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:40,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:40,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:40,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:36:40,707 INFO L87 Difference]: Start difference. First operand 849 states and 2400 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:41,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:41,142 INFO L93 Difference]: Finished difference Result 1095 states and 3094 transitions. [2025-04-13 22:36:41,142 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:36:41,143 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:41,143 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:41,151 INFO L225 Difference]: With dead ends: 1095 [2025-04-13 22:36:41,151 INFO L226 Difference]: Without dead ends: 1036 [2025-04-13 22:36:41,152 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:36:41,152 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 242 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:41,152 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 71 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:41,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2025-04-13 22:36:41,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 853. [2025-04-13 22:36:41,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 852 states have (on average 2.8309859154929575) internal successors, (2412), 852 states have internal predecessors, (2412), 0 states have call successors, (0), 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:36:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 2412 transitions. [2025-04-13 22:36:41,166 INFO L79 Accepts]: Start accepts. Automaton has 853 states and 2412 transitions. Word has length 56 [2025-04-13 22:36:41,167 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:41,167 INFO L485 AbstractCegarLoop]: Abstraction has 853 states and 2412 transitions. [2025-04-13 22:36:41,167 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:41,167 INFO L278 IsEmpty]: Start isEmpty. Operand 853 states and 2412 transitions. [2025-04-13 22:36:41,168 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:41,168 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:41,168 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:41,168 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable256 [2025-04-13 22:36:41,168 INFO L403 AbstractCegarLoop]: === Iteration 258 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:41,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:41,168 INFO L85 PathProgramCache]: Analyzing trace with hash 653258302, now seen corresponding path program 257 times [2025-04-13 22:36:41,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:41,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335230963] [2025-04-13 22:36:41,168 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:41,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:41,173 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:41,180 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:41,180 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:41,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:41,971 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:36:41,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:41,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335230963] [2025-04-13 22:36:41,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335230963] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:41,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128552595] [2025-04-13 22:36:41,971 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:41,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:41,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:41,974 INFO L229 MonitoredProcess]: Starting monitored process 86 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:36:41,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2025-04-13 22:36:42,082 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:42,099 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:42,099 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:42,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:42,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:36:42,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:42,273 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:36:42,273 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:36:42,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:36:42,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:42,489 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:36:42,490 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:36:42,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:42,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128552595] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:42,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:36:42,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 34 [2025-04-13 22:36:42,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752766438] [2025-04-13 22:36:42,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:42,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:42,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:42,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:42,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1101, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:36:42,512 INFO L87 Difference]: Start difference. First operand 853 states and 2412 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:43,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:43,110 INFO L93 Difference]: Finished difference Result 1031 states and 2899 transitions. [2025-04-13 22:36:43,110 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:36:43,111 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:43,111 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:43,118 INFO L225 Difference]: With dead ends: 1031 [2025-04-13 22:36:43,119 INFO L226 Difference]: Without dead ends: 975 [2025-04-13 22:36:43,119 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=208, Invalid=2444, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:36:43,119 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 147 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:43,119 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 67 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:43,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-04-13 22:36:43,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 849. [2025-04-13 22:36:43,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 848 states have (on average 2.830188679245283) internal successors, (2400), 848 states have internal predecessors, (2400), 0 states have call successors, (0), 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:36:43,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2400 transitions. [2025-04-13 22:36:43,130 INFO L79 Accepts]: Start accepts. Automaton has 849 states and 2400 transitions. Word has length 56 [2025-04-13 22:36:43,130 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:43,131 INFO L485 AbstractCegarLoop]: Abstraction has 849 states and 2400 transitions. [2025-04-13 22:36:43,131 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:43,131 INFO L278 IsEmpty]: Start isEmpty. Operand 849 states and 2400 transitions. [2025-04-13 22:36:43,131 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:43,131 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:43,131 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:43,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Forceful destruction successful, exit code 0 [2025-04-13 22:36:43,332 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable257 [2025-04-13 22:36:43,332 INFO L403 AbstractCegarLoop]: === Iteration 259 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:43,332 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:43,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1841505282, now seen corresponding path program 258 times [2025-04-13 22:36:43,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:43,332 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830317758] [2025-04-13 22:36:43,332 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:36:43,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:43,337 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:43,340 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:43,340 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:36:43,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:43,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:43,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:43,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830317758] [2025-04-13 22:36:43,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830317758] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:43,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:43,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:36:43,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987737986] [2025-04-13 22:36:43,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:43,432 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:43,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:43,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:43,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:36:43,433 INFO L87 Difference]: Start difference. First operand 849 states and 2400 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:43,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:43,863 INFO L93 Difference]: Finished difference Result 1080 states and 3047 transitions. [2025-04-13 22:36:43,863 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:36:43,863 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:43,863 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:43,870 INFO L225 Difference]: With dead ends: 1080 [2025-04-13 22:36:43,870 INFO L226 Difference]: Without dead ends: 1028 [2025-04-13 22:36:43,870 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=968, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:36:43,871 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 205 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:43,871 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 70 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:43,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2025-04-13 22:36:43,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 849. [2025-04-13 22:36:43,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 848 states have (on average 2.8254716981132075) internal successors, (2396), 848 states have internal predecessors, (2396), 0 states have call successors, (0), 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:36:43,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2396 transitions. [2025-04-13 22:36:43,883 INFO L79 Accepts]: Start accepts. Automaton has 849 states and 2396 transitions. Word has length 56 [2025-04-13 22:36:43,883 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:43,883 INFO L485 AbstractCegarLoop]: Abstraction has 849 states and 2396 transitions. [2025-04-13 22:36:43,883 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:43,883 INFO L278 IsEmpty]: Start isEmpty. Operand 849 states and 2396 transitions. [2025-04-13 22:36:43,884 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:43,884 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:43,884 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:43,884 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable258 [2025-04-13 22:36:43,884 INFO L403 AbstractCegarLoop]: === Iteration 260 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:43,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:43,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1831912542, now seen corresponding path program 259 times [2025-04-13 22:36:43,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:43,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224610274] [2025-04-13 22:36:43,885 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:43,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:43,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:36:43,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:43,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:43,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:44,973 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:36:44,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:44,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224610274] [2025-04-13 22:36:44,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224610274] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:44,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443624192] [2025-04-13 22:36:44,974 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:44,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:44,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:44,975 INFO L229 MonitoredProcess]: Starting monitored process 87 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:36:44,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2025-04-13 22:36:45,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:36:45,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:45,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:45,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:45,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:36:45,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:45,334 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:36:45,335 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:36:45,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:36:45,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:45,570 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:36:45,571 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:36:45,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:45,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443624192] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:45,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:36:45,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 34 [2025-04-13 22:36:45,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978725975] [2025-04-13 22:36:45,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:45,592 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:45,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:45,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:45,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1111, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:36:45,592 INFO L87 Difference]: Start difference. First operand 849 states and 2396 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:46,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:46,231 INFO L93 Difference]: Finished difference Result 1037 states and 2913 transitions. [2025-04-13 22:36:46,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:36:46,231 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:46,231 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:46,238 INFO L225 Difference]: With dead ends: 1037 [2025-04-13 22:36:46,238 INFO L226 Difference]: Without dead ends: 936 [2025-04-13 22:36:46,238 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=171, Invalid=2279, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:36:46,238 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 169 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:46,239 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 66 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:46,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-04-13 22:36:46,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 845. [2025-04-13 22:36:46,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 2.824644549763033) internal successors, (2384), 844 states have internal predecessors, (2384), 0 states have call successors, (0), 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:36:46,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 2384 transitions. [2025-04-13 22:36:46,252 INFO L79 Accepts]: Start accepts. Automaton has 845 states and 2384 transitions. Word has length 56 [2025-04-13 22:36:46,252 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:46,252 INFO L485 AbstractCegarLoop]: Abstraction has 845 states and 2384 transitions. [2025-04-13 22:36:46,252 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:46,252 INFO L278 IsEmpty]: Start isEmpty. Operand 845 states and 2384 transitions. [2025-04-13 22:36:46,253 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:46,253 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:46,253 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:46,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Ended with exit code 0 [2025-04-13 22:36:46,453 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable259,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:46,453 INFO L403 AbstractCegarLoop]: === Iteration 261 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:46,453 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:46,453 INFO L85 PathProgramCache]: Analyzing trace with hash -218552900, now seen corresponding path program 260 times [2025-04-13 22:36:46,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:46,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787727414] [2025-04-13 22:36:46,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:36:46,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:46,458 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:46,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:46,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:36:46,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:46,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:46,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:46,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787727414] [2025-04-13 22:36:46,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787727414] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:46,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:46,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:36:46,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172475204] [2025-04-13 22:36:46,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:46,555 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:46,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:46,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:46,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:36:46,555 INFO L87 Difference]: Start difference. First operand 845 states and 2384 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:46,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:46,986 INFO L93 Difference]: Finished difference Result 1053 states and 2968 transitions. [2025-04-13 22:36:46,986 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:36:46,986 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:46,986 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:46,994 INFO L225 Difference]: With dead ends: 1053 [2025-04-13 22:36:46,994 INFO L226 Difference]: Without dead ends: 985 [2025-04-13 22:36:46,994 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=160, Invalid=1030, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:36:46,994 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 207 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:46,994 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 70 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:46,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-04-13 22:36:47,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 833. [2025-04-13 22:36:47,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 832 states have (on average 2.826923076923077) internal successors, (2352), 832 states have internal predecessors, (2352), 0 states have call successors, (0), 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:36:47,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 2352 transitions. [2025-04-13 22:36:47,006 INFO L79 Accepts]: Start accepts. Automaton has 833 states and 2352 transitions. Word has length 56 [2025-04-13 22:36:47,006 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:47,006 INFO L485 AbstractCegarLoop]: Abstraction has 833 states and 2352 transitions. [2025-04-13 22:36:47,006 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:47,006 INFO L278 IsEmpty]: Start isEmpty. Operand 833 states and 2352 transitions. [2025-04-13 22:36:47,007 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:47,007 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:47,007 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:47,007 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable260 [2025-04-13 22:36:47,007 INFO L403 AbstractCegarLoop]: === Iteration 262 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:47,007 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:47,008 INFO L85 PathProgramCache]: Analyzing trace with hash -303603328, now seen corresponding path program 261 times [2025-04-13 22:36:47,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:47,008 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028405228] [2025-04-13 22:36:47,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:36:47,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:47,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:47,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:47,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:36:47,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:47,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:47,111 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028405228] [2025-04-13 22:36:47,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028405228] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:47,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:47,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:36:47,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60185244] [2025-04-13 22:36:47,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:47,112 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:47,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:47,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:47,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:36:47,112 INFO L87 Difference]: Start difference. First operand 833 states and 2352 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:47,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:47,575 INFO L93 Difference]: Finished difference Result 1073 states and 3031 transitions. [2025-04-13 22:36:47,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:36:47,575 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:47,575 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:47,582 INFO L225 Difference]: With dead ends: 1073 [2025-04-13 22:36:47,582 INFO L226 Difference]: Without dead ends: 995 [2025-04-13 22:36:47,582 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:36:47,583 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 312 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:47,583 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 81 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:47,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2025-04-13 22:36:47,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 833. [2025-04-13 22:36:47,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 832 states have (on average 2.8221153846153846) internal successors, (2348), 832 states have internal predecessors, (2348), 0 states have call successors, (0), 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:36:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 2348 transitions. [2025-04-13 22:36:47,594 INFO L79 Accepts]: Start accepts. Automaton has 833 states and 2348 transitions. Word has length 56 [2025-04-13 22:36:47,594 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:47,595 INFO L485 AbstractCegarLoop]: Abstraction has 833 states and 2348 transitions. [2025-04-13 22:36:47,595 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:47,595 INFO L278 IsEmpty]: Start isEmpty. Operand 833 states and 2348 transitions. [2025-04-13 22:36:47,595 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:47,595 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:47,595 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:47,595 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable261 [2025-04-13 22:36:47,596 INFO L403 AbstractCegarLoop]: === Iteration 263 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:47,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:47,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1115921634, now seen corresponding path program 262 times [2025-04-13 22:36:47,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:47,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810119218] [2025-04-13 22:36:47,596 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:36:47,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:47,600 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:47,603 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:36:47,603 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:36:47,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:47,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:47,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:47,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810119218] [2025-04-13 22:36:47,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810119218] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:47,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:47,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:36:47,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574423278] [2025-04-13 22:36:47,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:47,677 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:36:47,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:47,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:36:47,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:36:47,677 INFO L87 Difference]: Start difference. First operand 833 states and 2348 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:48,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:48,053 INFO L93 Difference]: Finished difference Result 1077 states and 3054 transitions. [2025-04-13 22:36:48,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:36:48,053 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:48,053 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:48,060 INFO L225 Difference]: With dead ends: 1077 [2025-04-13 22:36:48,060 INFO L226 Difference]: Without dead ends: 1018 [2025-04-13 22:36:48,061 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:36:48,061 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 199 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:48,061 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 78 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:48,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2025-04-13 22:36:48,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 881. [2025-04-13 22:36:48,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 2.838636363636364) internal successors, (2498), 880 states have internal predecessors, (2498), 0 states have call successors, (0), 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:36:48,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 2498 transitions. [2025-04-13 22:36:48,073 INFO L79 Accepts]: Start accepts. Automaton has 881 states and 2498 transitions. Word has length 56 [2025-04-13 22:36:48,073 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:48,073 INFO L485 AbstractCegarLoop]: Abstraction has 881 states and 2498 transitions. [2025-04-13 22:36:48,073 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:48,073 INFO L278 IsEmpty]: Start isEmpty. Operand 881 states and 2498 transitions. [2025-04-13 22:36:48,074 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:48,074 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:48,074 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:48,074 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable262 [2025-04-13 22:36:48,074 INFO L403 AbstractCegarLoop]: === Iteration 264 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:48,074 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:48,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2060935552, now seen corresponding path program 263 times [2025-04-13 22:36:48,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:48,074 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893461165] [2025-04-13 22:36:48,074 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:48,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:48,079 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:48,085 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:48,085 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:48,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:48,742 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:36:48,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:48,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893461165] [2025-04-13 22:36:48,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893461165] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:48,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005106953] [2025-04-13 22:36:48,742 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:48,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:48,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:48,744 INFO L229 MonitoredProcess]: Starting monitored process 88 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:36:48,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2025-04-13 22:36:48,854 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:48,871 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:48,871 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:48,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:48,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:36:48,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:49,044 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:36:49,044 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:36:49,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:36:49,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:49,270 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:36:49,270 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:36:49,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:49,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005106953] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:49,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:36:49,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 34 [2025-04-13 22:36:49,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114766535] [2025-04-13 22:36:49,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:49,299 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:49,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:49,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:49,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1102, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:36:49,299 INFO L87 Difference]: Start difference. First operand 881 states and 2498 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:49,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:49,936 INFO L93 Difference]: Finished difference Result 1059 states and 2985 transitions. [2025-04-13 22:36:49,936 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:36:49,937 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:49,937 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:49,944 INFO L225 Difference]: With dead ends: 1059 [2025-04-13 22:36:49,944 INFO L226 Difference]: Without dead ends: 1003 [2025-04-13 22:36:49,945 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=202, Invalid=2450, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:36:49,945 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 150 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:49,945 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 69 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:49,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2025-04-13 22:36:49,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 885. [2025-04-13 22:36:49,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 2.834841628959276) internal successors, (2506), 884 states have internal predecessors, (2506), 0 states have call successors, (0), 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:36:49,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 2506 transitions. [2025-04-13 22:36:49,958 INFO L79 Accepts]: Start accepts. Automaton has 885 states and 2506 transitions. Word has length 56 [2025-04-13 22:36:49,958 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:49,958 INFO L485 AbstractCegarLoop]: Abstraction has 885 states and 2506 transitions. [2025-04-13 22:36:49,958 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:49,959 INFO L278 IsEmpty]: Start isEmpty. Operand 885 states and 2506 transitions. [2025-04-13 22:36:49,959 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:49,959 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:49,959 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:49,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Ended with exit code 0 [2025-04-13 22:36:50,160 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable263,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:50,160 INFO L403 AbstractCegarLoop]: === Iteration 265 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:50,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:50,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1757160576, now seen corresponding path program 264 times [2025-04-13 22:36:50,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:50,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975741414] [2025-04-13 22:36:50,160 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:36:50,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:50,165 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:50,168 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:50,168 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:36:50,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:50,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:50,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:50,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975741414] [2025-04-13 22:36:50,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975741414] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:50,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:50,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:36:50,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423310659] [2025-04-13 22:36:50,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:50,270 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:36:50,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:50,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:36:50,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:36:50,270 INFO L87 Difference]: Start difference. First operand 885 states and 2506 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:50,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:50,664 INFO L93 Difference]: Finished difference Result 1070 states and 3027 transitions. [2025-04-13 22:36:50,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:36:50,664 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:50,665 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:50,673 INFO L225 Difference]: With dead ends: 1070 [2025-04-13 22:36:50,673 INFO L226 Difference]: Without dead ends: 1018 [2025-04-13 22:36:50,673 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:36:50,673 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 208 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:50,673 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 76 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:50,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2025-04-13 22:36:50,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 885. [2025-04-13 22:36:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 2.830316742081448) internal successors, (2502), 884 states have internal predecessors, (2502), 0 states have call successors, (0), 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:36:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 2502 transitions. [2025-04-13 22:36:50,687 INFO L79 Accepts]: Start accepts. Automaton has 885 states and 2502 transitions. Word has length 56 [2025-04-13 22:36:50,687 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:50,687 INFO L485 AbstractCegarLoop]: Abstraction has 885 states and 2502 transitions. [2025-04-13 22:36:50,687 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:50,688 INFO L278 IsEmpty]: Start isEmpty. Operand 885 states and 2502 transitions. [2025-04-13 22:36:50,688 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:50,688 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:50,688 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:50,688 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable264 [2025-04-13 22:36:50,689 INFO L403 AbstractCegarLoop]: === Iteration 266 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:50,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:50,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1432368034, now seen corresponding path program 265 times [2025-04-13 22:36:50,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:50,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995692992] [2025-04-13 22:36:50,689 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:50,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:50,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:36:50,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:50,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:50,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:51,503 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:36:51,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:51,503 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995692992] [2025-04-13 22:36:51,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995692992] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:51,503 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420467858] [2025-04-13 22:36:51,503 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:51,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:51,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:51,505 INFO L229 MonitoredProcess]: Starting monitored process 89 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:36:51,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2025-04-13 22:36:51,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:36:51,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:51,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:51,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:51,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:36:51,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:51,803 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:36:51,803 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:36:51,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:36:51,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:51,988 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:36:51,989 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:36:52,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:52,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420467858] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:52,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:36:52,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 31 [2025-04-13 22:36:52,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979172715] [2025-04-13 22:36:52,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:52,009 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:52,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:52,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:52,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=913, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:36:52,009 INFO L87 Difference]: Start difference. First operand 885 states and 2502 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:52,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:52,666 INFO L93 Difference]: Finished difference Result 1070 states and 3016 transitions. [2025-04-13 22:36:52,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:36:52,666 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:52,666 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:52,674 INFO L225 Difference]: With dead ends: 1070 [2025-04-13 22:36:52,674 INFO L226 Difference]: Without dead ends: 1011 [2025-04-13 22:36:52,675 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=2447, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:36:52,675 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 184 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:52,675 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 70 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:52,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-04-13 22:36:52,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 889. [2025-04-13 22:36:52,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 888 states have (on average 2.831081081081081) internal successors, (2514), 888 states have internal predecessors, (2514), 0 states have call successors, (0), 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:36:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 2514 transitions. [2025-04-13 22:36:52,690 INFO L79 Accepts]: Start accepts. Automaton has 889 states and 2514 transitions. Word has length 56 [2025-04-13 22:36:52,690 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:52,690 INFO L485 AbstractCegarLoop]: Abstraction has 889 states and 2514 transitions. [2025-04-13 22:36:52,690 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:52,690 INFO L278 IsEmpty]: Start isEmpty. Operand 889 states and 2514 transitions. [2025-04-13 22:36:52,691 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:52,691 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:52,691 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:52,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Ended with exit code 0 [2025-04-13 22:36:52,891 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable265 [2025-04-13 22:36:52,891 INFO L403 AbstractCegarLoop]: === Iteration 267 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:52,891 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:52,892 INFO L85 PathProgramCache]: Analyzing trace with hash -302897606, now seen corresponding path program 266 times [2025-04-13 22:36:52,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:52,892 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132023097] [2025-04-13 22:36:52,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:36:52,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:52,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:52,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:52,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:36:52,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:52,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:52,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:52,998 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132023097] [2025-04-13 22:36:52,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132023097] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:52,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:52,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:36:52,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280113040] [2025-04-13 22:36:52,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:52,999 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:36:52,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:52,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:36:52,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:36:52,999 INFO L87 Difference]: Start difference. First operand 889 states and 2514 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:53,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:53,380 INFO L93 Difference]: Finished difference Result 1078 states and 3047 transitions. [2025-04-13 22:36:53,380 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:36:53,380 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:53,380 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:53,388 INFO L225 Difference]: With dead ends: 1078 [2025-04-13 22:36:53,388 INFO L226 Difference]: Without dead ends: 1018 [2025-04-13 22:36:53,388 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:36:53,388 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 214 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:53,388 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 76 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:53,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2025-04-13 22:36:53,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 885. [2025-04-13 22:36:53,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 2.830316742081448) internal successors, (2502), 884 states have internal predecessors, (2502), 0 states have call successors, (0), 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:36:53,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 2502 transitions. [2025-04-13 22:36:53,400 INFO L79 Accepts]: Start accepts. Automaton has 885 states and 2502 transitions. Word has length 56 [2025-04-13 22:36:53,400 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:53,400 INFO L485 AbstractCegarLoop]: Abstraction has 885 states and 2502 transitions. [2025-04-13 22:36:53,400 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:53,400 INFO L278 IsEmpty]: Start isEmpty. Operand 885 states and 2502 transitions. [2025-04-13 22:36:53,401 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:53,401 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:53,401 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:53,401 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable266 [2025-04-13 22:36:53,401 INFO L403 AbstractCegarLoop]: === Iteration 268 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:53,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:53,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1925156708, now seen corresponding path program 267 times [2025-04-13 22:36:53,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:53,402 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071790020] [2025-04-13 22:36:53,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:36:53,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:53,406 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:53,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:53,410 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:36:53,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:53,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:53,504 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071790020] [2025-04-13 22:36:53,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071790020] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:53,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:53,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:36:53,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245698064] [2025-04-13 22:36:53,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:53,505 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:53,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:53,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:53,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:36:53,505 INFO L87 Difference]: Start difference. First operand 885 states and 2502 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:53,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:53,947 INFO L93 Difference]: Finished difference Result 1169 states and 3301 transitions. [2025-04-13 22:36:53,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:36:53,948 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:53,948 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:53,956 INFO L225 Difference]: With dead ends: 1169 [2025-04-13 22:36:53,956 INFO L226 Difference]: Without dead ends: 1117 [2025-04-13 22:36:53,956 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:36:53,956 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 202 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:53,956 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 82 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:53,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2025-04-13 22:36:53,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 893. [2025-04-13 22:36:53,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 892 states have (on average 2.8228699551569507) internal successors, (2518), 892 states have internal predecessors, (2518), 0 states have call successors, (0), 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:36:53,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 2518 transitions. [2025-04-13 22:36:53,970 INFO L79 Accepts]: Start accepts. Automaton has 893 states and 2518 transitions. Word has length 56 [2025-04-13 22:36:53,970 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:53,970 INFO L485 AbstractCegarLoop]: Abstraction has 893 states and 2518 transitions. [2025-04-13 22:36:53,970 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:53,970 INFO L278 IsEmpty]: Start isEmpty. Operand 893 states and 2518 transitions. [2025-04-13 22:36:53,971 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:53,971 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:53,971 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:53,971 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable267 [2025-04-13 22:36:53,971 INFO L403 AbstractCegarLoop]: === Iteration 269 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:53,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:53,971 INFO L85 PathProgramCache]: Analyzing trace with hash -162677534, now seen corresponding path program 268 times [2025-04-13 22:36:53,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:53,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311269019] [2025-04-13 22:36:53,971 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:36:53,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:53,976 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:53,978 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:36:53,978 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:36:53,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:54,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:54,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:54,052 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311269019] [2025-04-13 22:36:54,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311269019] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:54,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:54,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:36:54,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250944740] [2025-04-13 22:36:54,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:54,052 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:36:54,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:54,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:36:54,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:36:54,053 INFO L87 Difference]: Start difference. First operand 893 states and 2518 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:54,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:54,431 INFO L93 Difference]: Finished difference Result 1109 states and 3103 transitions. [2025-04-13 22:36:54,432 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:36:54,432 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:54,432 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:54,440 INFO L225 Difference]: With dead ends: 1109 [2025-04-13 22:36:54,440 INFO L226 Difference]: Without dead ends: 833 [2025-04-13 22:36:54,441 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:36:54,441 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 217 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:54,441 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 90 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:54,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-04-13 22:36:54,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 761. [2025-04-13 22:36:54,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 760 states have (on average 2.7710526315789474) internal successors, (2106), 760 states have internal predecessors, (2106), 0 states have call successors, (0), 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:36:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 2106 transitions. [2025-04-13 22:36:54,451 INFO L79 Accepts]: Start accepts. Automaton has 761 states and 2106 transitions. Word has length 56 [2025-04-13 22:36:54,451 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:54,451 INFO L485 AbstractCegarLoop]: Abstraction has 761 states and 2106 transitions. [2025-04-13 22:36:54,451 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:54,451 INFO L278 IsEmpty]: Start isEmpty. Operand 761 states and 2106 transitions. [2025-04-13 22:36:54,452 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:54,452 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:54,452 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:54,452 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable268 [2025-04-13 22:36:54,452 INFO L403 AbstractCegarLoop]: === Iteration 270 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:54,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:54,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2026262434, now seen corresponding path program 269 times [2025-04-13 22:36:54,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:54,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407202279] [2025-04-13 22:36:54,453 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:54,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:54,457 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:54,464 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:54,464 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:54,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:55,183 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:36:55,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:55,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407202279] [2025-04-13 22:36:55,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407202279] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:55,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680799750] [2025-04-13 22:36:55,183 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:55,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:55,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:55,185 INFO L229 MonitoredProcess]: Starting monitored process 90 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:36:55,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2025-04-13 22:36:55,299 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:55,317 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:55,317 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:55,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:55,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:36:55,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:55,510 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:36:55,511 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:36:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:55,519 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:36:55,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680799750] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:55,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:36:55,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 24 [2025-04-13 22:36:55,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653426731] [2025-04-13 22:36:55,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:55,519 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:55,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:55,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:55,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:36:55,519 INFO L87 Difference]: Start difference. First operand 761 states and 2106 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:56,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:56,471 INFO L93 Difference]: Finished difference Result 1027 states and 2828 transitions. [2025-04-13 22:36:56,471 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:36:56,471 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:56,471 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:56,479 INFO L225 Difference]: With dead ends: 1027 [2025-04-13 22:36:56,479 INFO L226 Difference]: Without dead ends: 959 [2025-04-13 22:36:56,480 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=1884, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:36:56,480 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 211 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:56,480 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 76 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:36:56,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-04-13 22:36:56,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 749. [2025-04-13 22:36:56,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 748 states have (on average 2.772727272727273) internal successors, (2074), 748 states have internal predecessors, (2074), 0 states have call successors, (0), 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:36:56,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 2074 transitions. [2025-04-13 22:36:56,493 INFO L79 Accepts]: Start accepts. Automaton has 749 states and 2074 transitions. Word has length 56 [2025-04-13 22:36:56,493 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:56,493 INFO L485 AbstractCegarLoop]: Abstraction has 749 states and 2074 transitions. [2025-04-13 22:36:56,493 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:56,494 INFO L278 IsEmpty]: Start isEmpty. Operand 749 states and 2074 transitions. [2025-04-13 22:36:56,494 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:56,494 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:56,494 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:56,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Forceful destruction successful, exit code 0 [2025-04-13 22:36:56,695 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable269 [2025-04-13 22:36:56,695 INFO L403 AbstractCegarLoop]: === Iteration 271 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:56,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:56,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1711206788, now seen corresponding path program 270 times [2025-04-13 22:36:56,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:56,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461934592] [2025-04-13 22:36:56,695 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:36:56,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:56,700 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:56,704 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:56,704 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:36:56,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:56,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:56,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:56,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461934592] [2025-04-13 22:36:56,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461934592] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:56,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:56,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:36:56,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470427134] [2025-04-13 22:36:56,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:56,792 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:36:56,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:56,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:36:56,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:36:56,793 INFO L87 Difference]: Start difference. First operand 749 states and 2074 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:57,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:57,153 INFO L93 Difference]: Finished difference Result 970 states and 2702 transitions. [2025-04-13 22:36:57,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:36:57,154 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:57,154 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:57,162 INFO L225 Difference]: With dead ends: 970 [2025-04-13 22:36:57,162 INFO L226 Difference]: Without dead ends: 892 [2025-04-13 22:36:57,162 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:36:57,162 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 148 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:57,162 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 66 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:57,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2025-04-13 22:36:57,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 811. [2025-04-13 22:36:57,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 810 states have (on average 2.7962962962962963) internal successors, (2265), 810 states have internal predecessors, (2265), 0 states have call successors, (0), 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:36:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 2265 transitions. [2025-04-13 22:36:57,175 INFO L79 Accepts]: Start accepts. Automaton has 811 states and 2265 transitions. Word has length 56 [2025-04-13 22:36:57,175 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:57,175 INFO L485 AbstractCegarLoop]: Abstraction has 811 states and 2265 transitions. [2025-04-13 22:36:57,175 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:57,175 INFO L278 IsEmpty]: Start isEmpty. Operand 811 states and 2265 transitions. [2025-04-13 22:36:57,176 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:57,176 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:57,176 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:57,176 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable270 [2025-04-13 22:36:57,176 INFO L403 AbstractCegarLoop]: === Iteration 272 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:57,176 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:57,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1757865572, now seen corresponding path program 271 times [2025-04-13 22:36:57,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:57,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659711727] [2025-04-13 22:36:57,176 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:57,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:57,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:36:57,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:57,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:57,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:58,216 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:36:58,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:58,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659711727] [2025-04-13 22:36:58,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659711727] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:58,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482335201] [2025-04-13 22:36:58,217 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:58,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:58,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:58,219 INFO L229 MonitoredProcess]: Starting monitored process 91 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:36:58,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2025-04-13 22:36:58,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:36:58,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:36:58,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:58,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:58,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:36:58,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:58,530 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:36:58,531 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:36:58,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:36:58,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:58,761 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:36:58,761 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:36:58,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:58,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482335201] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:58,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:36:58,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 34 [2025-04-13 22:36:58,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330608185] [2025-04-13 22:36:58,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:58,784 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:36:58,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:58,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:36:58,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1095, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:36:58,784 INFO L87 Difference]: Start difference. First operand 811 states and 2265 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:59,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:59,468 INFO L93 Difference]: Finished difference Result 1021 states and 2862 transitions. [2025-04-13 22:36:59,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:36:59,468 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:36:59,468 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:59,476 INFO L225 Difference]: With dead ends: 1021 [2025-04-13 22:36:59,476 INFO L226 Difference]: Without dead ends: 965 [2025-04-13 22:36:59,477 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=235, Invalid=2627, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:36:59,477 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 174 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:59,477 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 73 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:36:59,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2025-04-13 22:36:59,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 803. [2025-04-13 22:36:59,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 802 states have (on average 2.7992518703241895) internal successors, (2245), 802 states have internal predecessors, (2245), 0 states have call successors, (0), 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:36:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 2245 transitions. [2025-04-13 22:36:59,491 INFO L79 Accepts]: Start accepts. Automaton has 803 states and 2245 transitions. Word has length 56 [2025-04-13 22:36:59,491 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:59,491 INFO L485 AbstractCegarLoop]: Abstraction has 803 states and 2245 transitions. [2025-04-13 22:36:59,491 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:36:59,491 INFO L278 IsEmpty]: Start isEmpty. Operand 803 states and 2245 transitions. [2025-04-13 22:36:59,492 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:36:59,492 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:59,492 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:59,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Ended with exit code 0 [2025-04-13 22:36:59,692 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable271,91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:59,692 INFO L403 AbstractCegarLoop]: === Iteration 273 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:36:59,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:59,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1129399578, now seen corresponding path program 272 times [2025-04-13 22:36:59,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:59,693 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695230883] [2025-04-13 22:36:59,693 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:36:59,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:59,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:36:59,701 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:36:59,701 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:36:59,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:59,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:59,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:59,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695230883] [2025-04-13 22:36:59,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695230883] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:59,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:59,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:36:59,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754649336] [2025-04-13 22:36:59,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:59,789 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:36:59,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:59,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:36:59,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:36:59,789 INFO L87 Difference]: Start difference. First operand 803 states and 2245 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:00,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:00,135 INFO L93 Difference]: Finished difference Result 970 states and 2702 transitions. [2025-04-13 22:37:00,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:37:00,136 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:00,136 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:00,144 INFO L225 Difference]: With dead ends: 970 [2025-04-13 22:37:00,144 INFO L226 Difference]: Without dead ends: 911 [2025-04-13 22:37:00,144 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:37:00,144 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 146 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:00,144 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 64 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:00,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2025-04-13 22:37:00,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 807. [2025-04-13 22:37:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 806 states have (on average 2.795285359801489) internal successors, (2253), 806 states have internal predecessors, (2253), 0 states have call successors, (0), 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:37:00,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 2253 transitions. [2025-04-13 22:37:00,157 INFO L79 Accepts]: Start accepts. Automaton has 807 states and 2253 transitions. Word has length 56 [2025-04-13 22:37:00,157 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:00,157 INFO L485 AbstractCegarLoop]: Abstraction has 807 states and 2253 transitions. [2025-04-13 22:37:00,157 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:00,157 INFO L278 IsEmpty]: Start isEmpty. Operand 807 states and 2253 transitions. [2025-04-13 22:37:00,158 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:00,158 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:00,158 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:00,158 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable272 [2025-04-13 22:37:00,158 INFO L403 AbstractCegarLoop]: === Iteration 274 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:00,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:00,158 INFO L85 PathProgramCache]: Analyzing trace with hash -956201862, now seen corresponding path program 273 times [2025-04-13 22:37:00,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:00,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274507082] [2025-04-13 22:37:00,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:37:00,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:00,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:00,166 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:00,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:37:00,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:00,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:00,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:00,256 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274507082] [2025-04-13 22:37:00,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274507082] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:00,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:00,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:00,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858433342] [2025-04-13 22:37:00,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:00,256 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:00,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:00,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:00,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:00,257 INFO L87 Difference]: Start difference. First operand 807 states and 2253 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:00,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:00,624 INFO L93 Difference]: Finished difference Result 1028 states and 2881 transitions. [2025-04-13 22:37:00,624 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:37:00,624 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:00,624 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:00,632 INFO L225 Difference]: With dead ends: 1028 [2025-04-13 22:37:00,632 INFO L226 Difference]: Without dead ends: 957 [2025-04-13 22:37:00,633 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:37:00,633 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 192 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:00,633 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 74 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:00,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2025-04-13 22:37:00,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 795. [2025-04-13 22:37:00,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 794 states have (on average 2.802267002518892) internal successors, (2225), 794 states have internal predecessors, (2225), 0 states have call successors, (0), 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:37:00,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 2225 transitions. [2025-04-13 22:37:00,645 INFO L79 Accepts]: Start accepts. Automaton has 795 states and 2225 transitions. Word has length 56 [2025-04-13 22:37:00,645 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:00,645 INFO L485 AbstractCegarLoop]: Abstraction has 795 states and 2225 transitions. [2025-04-13 22:37:00,645 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:00,645 INFO L278 IsEmpty]: Start isEmpty. Operand 795 states and 2225 transitions. [2025-04-13 22:37:00,646 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:00,646 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:00,646 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:00,646 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable273 [2025-04-13 22:37:00,646 INFO L403 AbstractCegarLoop]: === Iteration 275 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:00,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:00,646 INFO L85 PathProgramCache]: Analyzing trace with hash -292485508, now seen corresponding path program 274 times [2025-04-13 22:37:00,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:00,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529388692] [2025-04-13 22:37:00,646 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:37:00,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:00,651 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:00,654 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:37:00,654 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:37:00,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:00,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:00,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:00,722 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529388692] [2025-04-13 22:37:00,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529388692] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:00,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:00,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:00,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294840973] [2025-04-13 22:37:00,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:00,722 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:00,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:00,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:00,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:00,723 INFO L87 Difference]: Start difference. First operand 795 states and 2225 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:01,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:01,053 INFO L93 Difference]: Finished difference Result 924 states and 2576 transitions. [2025-04-13 22:37:01,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:37:01,053 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:01,053 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:01,062 INFO L225 Difference]: With dead ends: 924 [2025-04-13 22:37:01,062 INFO L226 Difference]: Without dead ends: 868 [2025-04-13 22:37:01,063 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:37:01,063 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 110 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:01,063 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 63 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:01,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2025-04-13 22:37:01,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 787. [2025-04-13 22:37:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 2.8053435114503817) internal successors, (2205), 786 states have internal predecessors, (2205), 0 states have call successors, (0), 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:37:01,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 2205 transitions. [2025-04-13 22:37:01,075 INFO L79 Accepts]: Start accepts. Automaton has 787 states and 2205 transitions. Word has length 56 [2025-04-13 22:37:01,075 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:01,075 INFO L485 AbstractCegarLoop]: Abstraction has 787 states and 2205 transitions. [2025-04-13 22:37:01,075 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:01,075 INFO L278 IsEmpty]: Start isEmpty. Operand 787 states and 2205 transitions. [2025-04-13 22:37:01,076 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:01,076 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:01,076 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:01,076 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable274 [2025-04-13 22:37:01,076 INFO L403 AbstractCegarLoop]: === Iteration 276 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:01,077 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:01,077 INFO L85 PathProgramCache]: Analyzing trace with hash -393496064, now seen corresponding path program 275 times [2025-04-13 22:37:01,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:01,077 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906501184] [2025-04-13 22:37:01,077 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:37:01,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:01,081 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:01,089 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:01,089 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:37:01,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:01,772 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:37:01,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:01,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906501184] [2025-04-13 22:37:01,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906501184] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:01,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400828083] [2025-04-13 22:37:01,772 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:37:01,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:01,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:01,774 INFO L229 MonitoredProcess]: Starting monitored process 92 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:37:01,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2025-04-13 22:37:01,898 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:01,916 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:01,916 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:37:01,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:01,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:37:01,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:02,080 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:37:02,080 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:37:02,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:37:02,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:37:02,256 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:37:02,256 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:37:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:02,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400828083] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:02,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:37:02,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 31 [2025-04-13 22:37:02,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881502076] [2025-04-13 22:37:02,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:02,280 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:02,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:02,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:02,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:37:02,281 INFO L87 Difference]: Start difference. First operand 787 states and 2205 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:02,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:02,947 INFO L93 Difference]: Finished difference Result 1060 states and 2995 transitions. [2025-04-13 22:37:02,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:37:02,947 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:02,947 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:02,955 INFO L225 Difference]: With dead ends: 1060 [2025-04-13 22:37:02,955 INFO L226 Difference]: Without dead ends: 1001 [2025-04-13 22:37:02,956 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=203, Invalid=2247, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:37:02,956 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 209 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:02,956 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 80 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:37:02,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2025-04-13 22:37:02,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 839. [2025-04-13 22:37:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 838 states have (on average 2.8198090692124107) internal successors, (2363), 838 states have internal predecessors, (2363), 0 states have call successors, (0), 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:37:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 2363 transitions. [2025-04-13 22:37:02,969 INFO L79 Accepts]: Start accepts. Automaton has 839 states and 2363 transitions. Word has length 56 [2025-04-13 22:37:02,969 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:02,969 INFO L485 AbstractCegarLoop]: Abstraction has 839 states and 2363 transitions. [2025-04-13 22:37:02,969 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:02,969 INFO L278 IsEmpty]: Start isEmpty. Operand 839 states and 2363 transitions. [2025-04-13 22:37:02,970 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:02,970 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:02,970 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:02,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Ended with exit code 0 [2025-04-13 22:37:03,170 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable275,92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:03,170 INFO L403 AbstractCegarLoop]: === Iteration 277 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:03,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:03,171 INFO L85 PathProgramCache]: Analyzing trace with hash 2114591102, now seen corresponding path program 276 times [2025-04-13 22:37:03,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:03,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292359519] [2025-04-13 22:37:03,171 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:37:03,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:03,175 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:03,179 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:03,179 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:37:03,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:03,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:03,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:03,266 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292359519] [2025-04-13 22:37:03,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292359519] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:03,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:03,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:03,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552676911] [2025-04-13 22:37:03,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:03,266 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:03,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:03,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:03,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:03,266 INFO L87 Difference]: Start difference. First operand 839 states and 2363 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:03,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:03,626 INFO L93 Difference]: Finished difference Result 1014 states and 2844 transitions. [2025-04-13 22:37:03,626 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:37:03,626 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:03,626 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:03,634 INFO L225 Difference]: With dead ends: 1014 [2025-04-13 22:37:03,634 INFO L226 Difference]: Without dead ends: 955 [2025-04-13 22:37:03,634 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:37:03,634 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 163 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:03,634 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 65 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:03,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-04-13 22:37:03,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 839. [2025-04-13 22:37:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 838 states have (on average 2.8198090692124107) internal successors, (2363), 838 states have internal predecessors, (2363), 0 states have call successors, (0), 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:37:03,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 2363 transitions. [2025-04-13 22:37:03,646 INFO L79 Accepts]: Start accepts. Automaton has 839 states and 2363 transitions. Word has length 56 [2025-04-13 22:37:03,647 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:03,647 INFO L485 AbstractCegarLoop]: Abstraction has 839 states and 2363 transitions. [2025-04-13 22:37:03,647 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:03,647 INFO L278 IsEmpty]: Start isEmpty. Operand 839 states and 2363 transitions. [2025-04-13 22:37:03,647 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:03,647 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:03,648 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:03,648 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable276 [2025-04-13 22:37:03,648 INFO L403 AbstractCegarLoop]: === Iteration 278 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:03,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:03,648 INFO L85 PathProgramCache]: Analyzing trace with hash -886284738, now seen corresponding path program 277 times [2025-04-13 22:37:03,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:03,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413539322] [2025-04-13 22:37:03,648 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:37:03,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:03,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:37:03,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:03,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:03,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:04,445 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:37:04,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:04,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413539322] [2025-04-13 22:37:04,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413539322] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:04,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982154178] [2025-04-13 22:37:04,445 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:37:04,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:04,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:04,447 INFO L229 MonitoredProcess]: Starting monitored process 93 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:37:04,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2025-04-13 22:37:04,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:37:04,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:04,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:04,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:04,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:37:04,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:04,753 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:37:04,753 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:37:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:37:04,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:37:04,931 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:37:04,931 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:37:04,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:04,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982154178] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:04,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:37:04,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 31 [2025-04-13 22:37:04,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999605227] [2025-04-13 22:37:04,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:04,952 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:04,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:04,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:04,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=907, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:37:04,952 INFO L87 Difference]: Start difference. First operand 839 states and 2363 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:05,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:05,653 INFO L93 Difference]: Finished difference Result 1057 states and 2980 transitions. [2025-04-13 22:37:05,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:37:05,653 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:05,653 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:05,661 INFO L225 Difference]: With dead ends: 1057 [2025-04-13 22:37:05,661 INFO L226 Difference]: Without dead ends: 1005 [2025-04-13 22:37:05,662 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=2339, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:37:05,662 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 201 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:05,662 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 83 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:37:05,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2025-04-13 22:37:05,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 843. [2025-04-13 22:37:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 842 states have (on average 2.815914489311164) internal successors, (2371), 842 states have internal predecessors, (2371), 0 states have call successors, (0), 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:37:05,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 2371 transitions. [2025-04-13 22:37:05,674 INFO L79 Accepts]: Start accepts. Automaton has 843 states and 2371 transitions. Word has length 56 [2025-04-13 22:37:05,674 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:05,674 INFO L485 AbstractCegarLoop]: Abstraction has 843 states and 2371 transitions. [2025-04-13 22:37:05,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:05,674 INFO L278 IsEmpty]: Start isEmpty. Operand 843 states and 2371 transitions. [2025-04-13 22:37:05,675 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:05,675 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:05,675 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:05,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Forceful destruction successful, exit code 0 [2025-04-13 22:37:05,875 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable277,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:05,876 INFO L403 AbstractCegarLoop]: === Iteration 279 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:05,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:05,876 INFO L85 PathProgramCache]: Analyzing trace with hash 692706016, now seen corresponding path program 278 times [2025-04-13 22:37:05,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:05,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873040314] [2025-04-13 22:37:05,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:37:05,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:05,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:05,884 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:05,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:37:05,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:05,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:05,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873040314] [2025-04-13 22:37:05,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873040314] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:05,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:05,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:05,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394661709] [2025-04-13 22:37:05,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:05,970 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:05,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:05,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:05,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:05,971 INFO L87 Difference]: Start difference. First operand 843 states and 2371 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:06,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:06,317 INFO L93 Difference]: Finished difference Result 999 states and 2797 transitions. [2025-04-13 22:37:06,317 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:37:06,317 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:06,317 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:06,325 INFO L225 Difference]: With dead ends: 999 [2025-04-13 22:37:06,325 INFO L226 Difference]: Without dead ends: 947 [2025-04-13 22:37:06,326 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:37:06,326 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 127 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:06,326 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 64 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-04-13 22:37:06,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 835. [2025-04-13 22:37:06,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 834 states have (on average 2.8189448441247) internal successors, (2351), 834 states have internal predecessors, (2351), 0 states have call successors, (0), 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:37:06,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 2351 transitions. [2025-04-13 22:37:06,338 INFO L79 Accepts]: Start accepts. Automaton has 835 states and 2351 transitions. Word has length 56 [2025-04-13 22:37:06,338 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:06,338 INFO L485 AbstractCegarLoop]: Abstraction has 835 states and 2351 transitions. [2025-04-13 22:37:06,338 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:06,338 INFO L278 IsEmpty]: Start isEmpty. Operand 835 states and 2351 transitions. [2025-04-13 22:37:06,339 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:06,339 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:06,339 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:06,339 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable278 [2025-04-13 22:37:06,339 INFO L403 AbstractCegarLoop]: === Iteration 280 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:06,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:06,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1229832892, now seen corresponding path program 279 times [2025-04-13 22:37:06,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:06,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965571141] [2025-04-13 22:37:06,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:37:06,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:06,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:06,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:06,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:37:06,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:06,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:06,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:06,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965571141] [2025-04-13 22:37:06,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965571141] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:06,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:06,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:06,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727061691] [2025-04-13 22:37:06,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:06,441 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:06,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:06,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:06,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:06,441 INFO L87 Difference]: Start difference. First operand 835 states and 2351 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:06,842 INFO L93 Difference]: Finished difference Result 1057 states and 2976 transitions. [2025-04-13 22:37:06,842 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:37:06,842 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:06,842 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:06,850 INFO L225 Difference]: With dead ends: 1057 [2025-04-13 22:37:06,850 INFO L226 Difference]: Without dead ends: 997 [2025-04-13 22:37:06,851 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:37:06,851 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 192 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:06,851 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 80 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:06,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2025-04-13 22:37:06,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 835. [2025-04-13 22:37:06,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 834 states have (on average 2.8141486810551557) internal successors, (2347), 834 states have internal predecessors, (2347), 0 states have call successors, (0), 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:37:06,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 2347 transitions. [2025-04-13 22:37:06,863 INFO L79 Accepts]: Start accepts. Automaton has 835 states and 2347 transitions. Word has length 56 [2025-04-13 22:37:06,863 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:06,863 INFO L485 AbstractCegarLoop]: Abstraction has 835 states and 2347 transitions. [2025-04-13 22:37:06,863 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:06,863 INFO L278 IsEmpty]: Start isEmpty. Operand 835 states and 2347 transitions. [2025-04-13 22:37:06,864 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:06,864 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:06,864 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:06,864 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable279 [2025-04-13 22:37:06,864 INFO L403 AbstractCegarLoop]: === Iteration 281 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:06,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:06,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1367352166, now seen corresponding path program 280 times [2025-04-13 22:37:06,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:06,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147824673] [2025-04-13 22:37:06,864 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:37:06,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:06,869 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:06,872 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:37:06,872 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:37:06,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:06,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:06,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:06,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147824673] [2025-04-13 22:37:06,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147824673] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:06,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:06,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:06,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660720592] [2025-04-13 22:37:06,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:06,942 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:06,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:06,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:06,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:06,942 INFO L87 Difference]: Start difference. First operand 835 states and 2347 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:07,292 INFO L93 Difference]: Finished difference Result 972 states and 2718 transitions. [2025-04-13 22:37:07,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:37:07,293 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:07,293 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:07,300 INFO L225 Difference]: With dead ends: 972 [2025-04-13 22:37:07,300 INFO L226 Difference]: Without dead ends: 908 [2025-04-13 22:37:07,301 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:37:07,301 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 129 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:07,301 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 64 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:07,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2025-04-13 22:37:07,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 827. [2025-04-13 22:37:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 826 states have (on average 2.817191283292978) internal successors, (2327), 826 states have internal predecessors, (2327), 0 states have call successors, (0), 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:37:07,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 2327 transitions. [2025-04-13 22:37:07,314 INFO L79 Accepts]: Start accepts. Automaton has 827 states and 2327 transitions. Word has length 56 [2025-04-13 22:37:07,314 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:07,314 INFO L485 AbstractCegarLoop]: Abstraction has 827 states and 2327 transitions. [2025-04-13 22:37:07,314 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:07,314 INFO L278 IsEmpty]: Start isEmpty. Operand 827 states and 2327 transitions. [2025-04-13 22:37:07,315 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:07,315 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:07,315 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:07,315 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable280 [2025-04-13 22:37:07,315 INFO L403 AbstractCegarLoop]: === Iteration 282 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:07,315 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:07,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1363856996, now seen corresponding path program 281 times [2025-04-13 22:37:07,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:07,315 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873005764] [2025-04-13 22:37:07,315 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:37:07,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:07,320 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:07,326 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:07,326 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:37:07,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:08,005 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:37:08,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:08,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873005764] [2025-04-13 22:37:08,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873005764] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:08,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259126861] [2025-04-13 22:37:08,005 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:37:08,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:08,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:08,007 INFO L229 MonitoredProcess]: Starting monitored process 94 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:37:08,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2025-04-13 22:37:08,127 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:08,146 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:08,146 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:37:08,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:08,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:37:08,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:08,332 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:37:08,332 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:37:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:08,338 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:37:08,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259126861] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:08,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:37:08,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 24 [2025-04-13 22:37:08,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893263954] [2025-04-13 22:37:08,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:08,339 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:08,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:08,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:08,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:37:08,339 INFO L87 Difference]: Start difference. First operand 827 states and 2327 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:09,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:09,210 INFO L93 Difference]: Finished difference Result 1062 states and 2963 transitions. [2025-04-13 22:37:09,211 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:37:09,211 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:09,211 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:09,218 INFO L225 Difference]: With dead ends: 1062 [2025-04-13 22:37:09,219 INFO L226 Difference]: Without dead ends: 786 [2025-04-13 22:37:09,219 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=1563, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 22:37:09,219 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 209 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:09,219 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 93 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:37:09,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2025-04-13 22:37:09,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 695. [2025-04-13 22:37:09,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 694 states have (on average 2.7593659942363113) internal successors, (1915), 694 states have internal predecessors, (1915), 0 states have call successors, (0), 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:37:09,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1915 transitions. [2025-04-13 22:37:09,230 INFO L79 Accepts]: Start accepts. Automaton has 695 states and 1915 transitions. Word has length 56 [2025-04-13 22:37:09,230 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:09,230 INFO L485 AbstractCegarLoop]: Abstraction has 695 states and 1915 transitions. [2025-04-13 22:37:09,230 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:09,230 INFO L278 IsEmpty]: Start isEmpty. Operand 695 states and 1915 transitions. [2025-04-13 22:37:09,231 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:09,231 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:09,231 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:09,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Ended with exit code 0 [2025-04-13 22:37:09,431 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable281,94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:09,431 INFO L403 AbstractCegarLoop]: === Iteration 283 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:09,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:09,431 INFO L85 PathProgramCache]: Analyzing trace with hash 228630232, now seen corresponding path program 282 times [2025-04-13 22:37:09,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:09,432 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464966627] [2025-04-13 22:37:09,432 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:37:09,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:09,437 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:09,440 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:09,440 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:37:09,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:09,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:09,528 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464966627] [2025-04-13 22:37:09,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464966627] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:09,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:09,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:09,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151553933] [2025-04-13 22:37:09,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:09,528 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:09,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:09,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:09,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:09,528 INFO L87 Difference]: Start difference. First operand 695 states and 1915 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:09,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:09,897 INFO L93 Difference]: Finished difference Result 939 states and 2621 transitions. [2025-04-13 22:37:09,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:37:09,897 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:09,897 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:09,905 INFO L225 Difference]: With dead ends: 939 [2025-04-13 22:37:09,905 INFO L226 Difference]: Without dead ends: 880 [2025-04-13 22:37:09,905 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:37:09,905 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 150 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:09,905 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 73 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-04-13 22:37:09,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 747. [2025-04-13 22:37:09,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 746 states have (on average 2.778820375335121) internal successors, (2073), 746 states have internal predecessors, (2073), 0 states have call successors, (0), 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:37:09,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 2073 transitions. [2025-04-13 22:37:09,916 INFO L79 Accepts]: Start accepts. Automaton has 747 states and 2073 transitions. Word has length 56 [2025-04-13 22:37:09,916 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:09,916 INFO L485 AbstractCegarLoop]: Abstraction has 747 states and 2073 transitions. [2025-04-13 22:37:09,916 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:09,916 INFO L278 IsEmpty]: Start isEmpty. Operand 747 states and 2073 transitions. [2025-04-13 22:37:09,917 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:09,917 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:09,917 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:09,917 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable282 [2025-04-13 22:37:09,917 INFO L403 AbstractCegarLoop]: === Iteration 284 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:09,917 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:09,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2109753536, now seen corresponding path program 283 times [2025-04-13 22:37:09,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:09,917 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716890375] [2025-04-13 22:37:09,917 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:37:09,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:09,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:37:09,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:09,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:09,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:11,090 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:37:11,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:11,090 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716890375] [2025-04-13 22:37:11,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716890375] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:11,090 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387111465] [2025-04-13 22:37:11,090 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:37:11,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:11,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:11,092 INFO L229 MonitoredProcess]: Starting monitored process 95 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:37:11,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2025-04-13 22:37:11,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:37:11,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:11,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:11,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:11,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:37:11,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:11,453 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:37:11,453 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:37:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:37:11,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:37:11,686 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:37:11,686 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:37:11,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:11,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387111465] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:11,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:37:11,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 34 [2025-04-13 22:37:11,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691122936] [2025-04-13 22:37:11,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:11,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:11,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:11,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:11,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1107, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:37:11,709 INFO L87 Difference]: Start difference. First operand 747 states and 2073 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:12,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:12,474 INFO L93 Difference]: Finished difference Result 1059 states and 2980 transitions. [2025-04-13 22:37:12,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:37:12,475 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:12,475 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:12,483 INFO L225 Difference]: With dead ends: 1059 [2025-04-13 22:37:12,483 INFO L226 Difference]: Without dead ends: 981 [2025-04-13 22:37:12,483 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=229, Invalid=2963, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:37:12,483 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 263 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:12,483 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 69 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:12,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2025-04-13 22:37:12,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 809. [2025-04-13 22:37:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 808 states have (on average 2.801980198019802) internal successors, (2264), 808 states have internal predecessors, (2264), 0 states have call successors, (0), 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:37:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 2264 transitions. [2025-04-13 22:37:12,496 INFO L79 Accepts]: Start accepts. Automaton has 809 states and 2264 transitions. Word has length 56 [2025-04-13 22:37:12,496 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:12,496 INFO L485 AbstractCegarLoop]: Abstraction has 809 states and 2264 transitions. [2025-04-13 22:37:12,496 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:12,496 INFO L278 IsEmpty]: Start isEmpty. Operand 809 states and 2264 transitions. [2025-04-13 22:37:12,497 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:12,497 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:12,497 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:12,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Forceful destruction successful, exit code 0 [2025-04-13 22:37:12,697 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable283,95 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:12,697 INFO L403 AbstractCegarLoop]: === Iteration 285 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:12,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:12,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1193254854, now seen corresponding path program 284 times [2025-04-13 22:37:12,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:12,698 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211951412] [2025-04-13 22:37:12,698 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:37:12,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:12,702 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:12,706 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:12,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:37:12,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:12,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:12,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:12,793 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211951412] [2025-04-13 22:37:12,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211951412] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:12,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:12,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:12,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260959927] [2025-04-13 22:37:12,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:12,794 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:12,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:12,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:12,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:12,794 INFO L87 Difference]: Start difference. First operand 809 states and 2264 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:13,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:13,162 INFO L93 Difference]: Finished difference Result 990 states and 2777 transitions. [2025-04-13 22:37:13,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:37:13,162 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:13,162 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:13,170 INFO L225 Difference]: With dead ends: 990 [2025-04-13 22:37:13,170 INFO L226 Difference]: Without dead ends: 938 [2025-04-13 22:37:13,171 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:37:13,171 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 158 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:13,171 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 72 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:13,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-04-13 22:37:13,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 805. [2025-04-13 22:37:13,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 804 states have (on average 2.800995024875622) internal successors, (2252), 804 states have internal predecessors, (2252), 0 states have call successors, (0), 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:37:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 2252 transitions. [2025-04-13 22:37:13,182 INFO L79 Accepts]: Start accepts. Automaton has 805 states and 2252 transitions. Word has length 56 [2025-04-13 22:37:13,182 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:13,182 INFO L485 AbstractCegarLoop]: Abstraction has 805 states and 2252 transitions. [2025-04-13 22:37:13,182 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:13,182 INFO L278 IsEmpty]: Start isEmpty. Operand 805 states and 2252 transitions. [2025-04-13 22:37:13,183 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:13,183 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:13,183 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:13,183 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable284 [2025-04-13 22:37:13,183 INFO L403 AbstractCegarLoop]: === Iteration 286 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:13,183 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:13,184 INFO L85 PathProgramCache]: Analyzing trace with hash 747574018, now seen corresponding path program 285 times [2025-04-13 22:37:13,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:13,184 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843900427] [2025-04-13 22:37:13,184 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:37:13,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:13,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:13,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:13,192 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:37:13,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:13,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:13,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843900427] [2025-04-13 22:37:13,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843900427] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:13,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:13,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:13,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774544105] [2025-04-13 22:37:13,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:13,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:13,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:13,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:13,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:13,284 INFO L87 Difference]: Start difference. First operand 805 states and 2252 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:13,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:13,682 INFO L93 Difference]: Finished difference Result 1063 states and 2988 transitions. [2025-04-13 22:37:13,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:37:13,683 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:13,683 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:13,691 INFO L225 Difference]: With dead ends: 1063 [2025-04-13 22:37:13,691 INFO L226 Difference]: Without dead ends: 1004 [2025-04-13 22:37:13,692 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=838, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:37:13,692 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 200 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:13,692 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 73 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:13,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2025-04-13 22:37:13,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 809. [2025-04-13 22:37:13,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 808 states have (on average 2.797029702970297) internal successors, (2260), 808 states have internal predecessors, (2260), 0 states have call successors, (0), 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:37:13,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 2260 transitions. [2025-04-13 22:37:13,705 INFO L79 Accepts]: Start accepts. Automaton has 809 states and 2260 transitions. Word has length 56 [2025-04-13 22:37:13,705 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:13,705 INFO L485 AbstractCegarLoop]: Abstraction has 809 states and 2260 transitions. [2025-04-13 22:37:13,705 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:13,705 INFO L278 IsEmpty]: Start isEmpty. Operand 809 states and 2260 transitions. [2025-04-13 22:37:13,706 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:13,706 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:13,706 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:13,706 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable285 [2025-04-13 22:37:13,706 INFO L403 AbstractCegarLoop]: === Iteration 287 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:13,706 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:13,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1041654260, now seen corresponding path program 286 times [2025-04-13 22:37:13,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:13,706 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147717761] [2025-04-13 22:37:13,706 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:37:13,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:13,711 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:13,714 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:37:13,714 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:37:13,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:13,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:13,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:13,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147717761] [2025-04-13 22:37:13,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147717761] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:13,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:13,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:13,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459811610] [2025-04-13 22:37:13,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:13,794 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:13,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:13,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:13,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:13,794 INFO L87 Difference]: Start difference. First operand 809 states and 2260 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:14,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:14,169 INFO L93 Difference]: Finished difference Result 998 states and 2793 transitions. [2025-04-13 22:37:14,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:37:14,170 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:14,170 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:14,178 INFO L225 Difference]: With dead ends: 998 [2025-04-13 22:37:14,178 INFO L226 Difference]: Without dead ends: 938 [2025-04-13 22:37:14,178 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:37:14,178 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 164 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:14,178 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 76 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:14,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-04-13 22:37:14,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 805. [2025-04-13 22:37:14,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 804 states have (on average 2.7960199004975124) internal successors, (2248), 804 states have internal predecessors, (2248), 0 states have call successors, (0), 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:37:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 2248 transitions. [2025-04-13 22:37:14,191 INFO L79 Accepts]: Start accepts. Automaton has 805 states and 2248 transitions. Word has length 56 [2025-04-13 22:37:14,191 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:14,191 INFO L485 AbstractCegarLoop]: Abstraction has 805 states and 2248 transitions. [2025-04-13 22:37:14,191 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:14,191 INFO L278 IsEmpty]: Start isEmpty. Operand 805 states and 2248 transitions. [2025-04-13 22:37:14,192 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:14,192 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:14,192 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:14,192 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable286 [2025-04-13 22:37:14,192 INFO L403 AbstractCegarLoop]: === Iteration 288 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:14,192 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:14,192 INFO L85 PathProgramCache]: Analyzing trace with hash 254785344, now seen corresponding path program 287 times [2025-04-13 22:37:14,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:14,192 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574253508] [2025-04-13 22:37:14,192 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:37:14,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:14,197 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:14,204 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:14,204 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:37:14,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:14,942 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:37:14,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:14,943 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574253508] [2025-04-13 22:37:14,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574253508] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:14,943 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342152620] [2025-04-13 22:37:14,943 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:37:14,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:14,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:14,945 INFO L229 MonitoredProcess]: Starting monitored process 96 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:37:14,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2025-04-13 22:37:15,068 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:15,085 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:15,085 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:37:15,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:15,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:37:15,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:15,266 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:37:15,266 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:37:15,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:37:15,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:37:15,479 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:37:15,479 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:37:15,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:15,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342152620] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:15,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:37:15,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 34 [2025-04-13 22:37:15,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597035909] [2025-04-13 22:37:15,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:15,502 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:15,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:15,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:15,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1097, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:37:15,503 INFO L87 Difference]: Start difference. First operand 805 states and 2248 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:16,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:16,181 INFO L93 Difference]: Finished difference Result 1025 states and 2878 transitions. [2025-04-13 22:37:16,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:37:16,181 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:16,181 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:16,189 INFO L225 Difference]: With dead ends: 1025 [2025-04-13 22:37:16,189 INFO L226 Difference]: Without dead ends: 969 [2025-04-13 22:37:16,190 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=238, Invalid=2732, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 22:37:16,190 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 185 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:16,190 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 72 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:16,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2025-04-13 22:37:16,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 797. [2025-04-13 22:37:16,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 796 states have (on average 2.798994974874372) internal successors, (2228), 796 states have internal predecessors, (2228), 0 states have call successors, (0), 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:37:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 2228 transitions. [2025-04-13 22:37:16,202 INFO L79 Accepts]: Start accepts. Automaton has 797 states and 2228 transitions. Word has length 56 [2025-04-13 22:37:16,202 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:16,202 INFO L485 AbstractCegarLoop]: Abstraction has 797 states and 2228 transitions. [2025-04-13 22:37:16,202 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:16,203 INFO L278 IsEmpty]: Start isEmpty. Operand 797 states and 2228 transitions. [2025-04-13 22:37:16,203 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:16,203 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:16,203 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:16,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2025-04-13 22:37:16,404 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable287 [2025-04-13 22:37:16,404 INFO L403 AbstractCegarLoop]: === Iteration 289 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:16,404 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:16,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1181874332, now seen corresponding path program 288 times [2025-04-13 22:37:16,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:16,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125976424] [2025-04-13 22:37:16,404 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:37:16,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:16,410 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:16,413 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:16,413 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:37:16,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:16,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:16,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:16,503 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125976424] [2025-04-13 22:37:16,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125976424] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:16,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:16,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:16,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988108705] [2025-04-13 22:37:16,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:16,503 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:16,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:16,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:16,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:16,503 INFO L87 Difference]: Start difference. First operand 797 states and 2228 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:16,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:16,878 INFO L93 Difference]: Finished difference Result 1003 states and 2780 transitions. [2025-04-13 22:37:16,878 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:37:16,878 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:16,878 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:16,885 INFO L225 Difference]: With dead ends: 1003 [2025-04-13 22:37:16,885 INFO L226 Difference]: Without dead ends: 771 [2025-04-13 22:37:16,886 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:37:16,886 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 190 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:16,886 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 82 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:16,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-04-13 22:37:16,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 709. [2025-04-13 22:37:16,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 708 states have (on average 2.7542372881355934) internal successors, (1950), 708 states have internal predecessors, (1950), 0 states have call successors, (0), 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:37:16,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1950 transitions. [2025-04-13 22:37:16,898 INFO L79 Accepts]: Start accepts. Automaton has 709 states and 1950 transitions. Word has length 56 [2025-04-13 22:37:16,898 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:16,898 INFO L485 AbstractCegarLoop]: Abstraction has 709 states and 1950 transitions. [2025-04-13 22:37:16,898 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:16,898 INFO L278 IsEmpty]: Start isEmpty. Operand 709 states and 1950 transitions. [2025-04-13 22:37:16,899 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:16,899 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:16,899 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:16,899 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable288 [2025-04-13 22:37:16,899 INFO L403 AbstractCegarLoop]: === Iteration 290 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:16,899 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:16,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1056449054, now seen corresponding path program 289 times [2025-04-13 22:37:16,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:16,899 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144170685] [2025-04-13 22:37:16,899 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:37:16,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:16,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:37:16,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:16,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:16,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:17,741 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:37:17,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:17,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144170685] [2025-04-13 22:37:17,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144170685] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:17,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094569139] [2025-04-13 22:37:17,741 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:37:17,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:17,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:17,743 INFO L229 MonitoredProcess]: Starting monitored process 97 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:37:17,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2025-04-13 22:37:17,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:37:17,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:17,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:17,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:17,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:37:17,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:18,043 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:37:18,043 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:37:18,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:37:18,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:37:18,219 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:37:18,219 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:37:18,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:18,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094569139] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:18,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:37:18,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 31 [2025-04-13 22:37:18,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565007692] [2025-04-13 22:37:18,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:18,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:18,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:18,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:18,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:37:18,240 INFO L87 Difference]: Start difference. First operand 709 states and 1950 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:18,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:18,946 INFO L93 Difference]: Finished difference Result 975 states and 2710 transitions. [2025-04-13 22:37:18,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:37:18,946 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:18,946 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:18,954 INFO L225 Difference]: With dead ends: 975 [2025-04-13 22:37:18,954 INFO L226 Difference]: Without dead ends: 916 [2025-04-13 22:37:18,954 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=2627, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:37:18,954 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 233 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:18,954 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 73 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:37:18,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2025-04-13 22:37:18,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 717. [2025-04-13 22:37:18,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 716 states have (on average 2.7513966480446927) internal successors, (1970), 716 states have internal predecessors, (1970), 0 states have call successors, (0), 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:37:18,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1970 transitions. [2025-04-13 22:37:18,966 INFO L79 Accepts]: Start accepts. Automaton has 717 states and 1970 transitions. Word has length 56 [2025-04-13 22:37:18,966 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:18,966 INFO L485 AbstractCegarLoop]: Abstraction has 717 states and 1970 transitions. [2025-04-13 22:37:18,966 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:18,966 INFO L278 IsEmpty]: Start isEmpty. Operand 717 states and 1970 transitions. [2025-04-13 22:37:18,967 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:18,967 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:18,967 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:18,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Forceful destruction successful, exit code 0 [2025-04-13 22:37:19,167 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 97 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable289 [2025-04-13 22:37:19,167 INFO L403 AbstractCegarLoop]: === Iteration 291 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:19,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:19,168 INFO L85 PathProgramCache]: Analyzing trace with hash 279538208, now seen corresponding path program 290 times [2025-04-13 22:37:19,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:19,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350285502] [2025-04-13 22:37:19,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:37:19,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:19,173 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:19,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:19,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:37:19,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:19,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:19,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:19,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350285502] [2025-04-13 22:37:19,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350285502] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:19,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:19,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:37:19,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188193130] [2025-04-13 22:37:19,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:19,271 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:19,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:19,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:19,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:37:19,271 INFO L87 Difference]: Start difference. First operand 717 states and 1970 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:19,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:19,669 INFO L93 Difference]: Finished difference Result 919 states and 2547 transitions. [2025-04-13 22:37:19,669 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:37:19,669 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:19,669 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:19,677 INFO L225 Difference]: With dead ends: 919 [2025-04-13 22:37:19,677 INFO L226 Difference]: Without dead ends: 860 [2025-04-13 22:37:19,677 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:37:19,677 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 159 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:19,678 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 83 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:19,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2025-04-13 22:37:19,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 771. [2025-04-13 22:37:19,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 770 states have (on average 2.7805194805194806) internal successors, (2141), 770 states have internal predecessors, (2141), 0 states have call successors, (0), 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:37:19,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 2141 transitions. [2025-04-13 22:37:19,691 INFO L79 Accepts]: Start accepts. Automaton has 771 states and 2141 transitions. Word has length 56 [2025-04-13 22:37:19,691 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:19,691 INFO L485 AbstractCegarLoop]: Abstraction has 771 states and 2141 transitions. [2025-04-13 22:37:19,691 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:19,691 INFO L278 IsEmpty]: Start isEmpty. Operand 771 states and 2141 transitions. [2025-04-13 22:37:19,692 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:19,692 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:19,692 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:19,692 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable290 [2025-04-13 22:37:19,692 INFO L403 AbstractCegarLoop]: === Iteration 292 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:19,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:19,692 INFO L85 PathProgramCache]: Analyzing trace with hash 563660380, now seen corresponding path program 291 times [2025-04-13 22:37:19,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:19,692 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827122459] [2025-04-13 22:37:19,692 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:37:19,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:19,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:19,700 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:19,700 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:37:19,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:19,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:19,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:19,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827122459] [2025-04-13 22:37:19,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827122459] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:19,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:19,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:19,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393790831] [2025-04-13 22:37:19,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:19,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:19,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:19,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:19,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:19,801 INFO L87 Difference]: Start difference. First operand 771 states and 2141 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:20,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:20,233 INFO L93 Difference]: Finished difference Result 1026 states and 2866 transitions. [2025-04-13 22:37:20,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:37:20,233 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:20,234 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:20,241 INFO L225 Difference]: With dead ends: 1026 [2025-04-13 22:37:20,241 INFO L226 Difference]: Without dead ends: 974 [2025-04-13 22:37:20,241 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:37:20,241 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 174 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:20,242 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 72 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:20,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-04-13 22:37:20,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 775. [2025-04-13 22:37:20,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 774 states have (on average 2.7764857881136953) internal successors, (2149), 774 states have internal predecessors, (2149), 0 states have call successors, (0), 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:37:20,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 2149 transitions. [2025-04-13 22:37:20,253 INFO L79 Accepts]: Start accepts. Automaton has 775 states and 2149 transitions. Word has length 56 [2025-04-13 22:37:20,253 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:20,253 INFO L485 AbstractCegarLoop]: Abstraction has 775 states and 2149 transitions. [2025-04-13 22:37:20,253 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:20,253 INFO L278 IsEmpty]: Start isEmpty. Operand 775 states and 2149 transitions. [2025-04-13 22:37:20,254 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:20,254 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:20,254 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:20,254 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable291 [2025-04-13 22:37:20,254 INFO L403 AbstractCegarLoop]: === Iteration 293 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:20,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:20,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1142346878, now seen corresponding path program 292 times [2025-04-13 22:37:20,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:20,254 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510535760] [2025-04-13 22:37:20,254 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:37:20,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:20,259 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:20,261 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:37:20,261 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:37:20,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:20,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:20,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510535760] [2025-04-13 22:37:20,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510535760] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:20,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:20,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:37:20,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956555325] [2025-04-13 22:37:20,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:20,335 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:20,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:20,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:20,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:37:20,335 INFO L87 Difference]: Start difference. First operand 775 states and 2149 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:20,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:20,738 INFO L93 Difference]: Finished difference Result 904 states and 2500 transitions. [2025-04-13 22:37:20,739 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:37:20,739 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:20,739 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:20,746 INFO L225 Difference]: With dead ends: 904 [2025-04-13 22:37:20,746 INFO L226 Difference]: Without dead ends: 852 [2025-04-13 22:37:20,747 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:37:20,747 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 166 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:20,747 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 82 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:20,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2025-04-13 22:37:20,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 767. [2025-04-13 22:37:20,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 2.779373368146214) internal successors, (2129), 766 states have internal predecessors, (2129), 0 states have call successors, (0), 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:37:20,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 2129 transitions. [2025-04-13 22:37:20,758 INFO L79 Accepts]: Start accepts. Automaton has 767 states and 2129 transitions. Word has length 56 [2025-04-13 22:37:20,758 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:20,758 INFO L485 AbstractCegarLoop]: Abstraction has 767 states and 2129 transitions. [2025-04-13 22:37:20,758 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:20,759 INFO L278 IsEmpty]: Start isEmpty. Operand 767 states and 2129 transitions. [2025-04-13 22:37:20,759 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:20,759 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:20,759 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:20,759 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable292 [2025-04-13 22:37:20,759 INFO L403 AbstractCegarLoop]: === Iteration 294 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:20,760 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:20,760 INFO L85 PathProgramCache]: Analyzing trace with hash 220112226, now seen corresponding path program 293 times [2025-04-13 22:37:20,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:20,760 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060370406] [2025-04-13 22:37:20,760 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:37:20,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:20,764 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:20,771 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:20,771 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:37:20,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:21,442 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:37:21,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:21,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060370406] [2025-04-13 22:37:21,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060370406] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:21,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324391760] [2025-04-13 22:37:21,442 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:37:21,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:21,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:21,444 INFO L229 MonitoredProcess]: Starting monitored process 98 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:37:21,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2025-04-13 22:37:21,564 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:21,584 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:21,584 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:37:21,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:21,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:37:21,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:21,755 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:37:21,755 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:37:21,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:21,761 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:37:21,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324391760] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:21,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:37:21,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [15] total 23 [2025-04-13 22:37:21,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880268206] [2025-04-13 22:37:21,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:21,761 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:21,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:21,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:21,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:37:21,761 INFO L87 Difference]: Start difference. First operand 767 states and 2129 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:22,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:22,626 INFO L93 Difference]: Finished difference Result 999 states and 2787 transitions. [2025-04-13 22:37:22,627 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:37:22,627 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:22,627 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:22,635 INFO L225 Difference]: With dead ends: 999 [2025-04-13 22:37:22,635 INFO L226 Difference]: Without dead ends: 935 [2025-04-13 22:37:22,636 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=1705, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:37:22,636 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 207 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:22,636 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 77 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:37:22,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-04-13 22:37:22,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 763. [2025-04-13 22:37:22,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 762 states have (on average 2.7782152230971127) internal successors, (2117), 762 states have internal predecessors, (2117), 0 states have call successors, (0), 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:37:22,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 2117 transitions. [2025-04-13 22:37:22,648 INFO L79 Accepts]: Start accepts. Automaton has 763 states and 2117 transitions. Word has length 56 [2025-04-13 22:37:22,648 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:22,648 INFO L485 AbstractCegarLoop]: Abstraction has 763 states and 2117 transitions. [2025-04-13 22:37:22,648 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:22,648 INFO L278 IsEmpty]: Start isEmpty. Operand 763 states and 2117 transitions. [2025-04-13 22:37:22,649 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:22,649 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:22,649 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:22,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Forceful destruction successful, exit code 0 [2025-04-13 22:37:22,849 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable293,98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:22,849 INFO L403 AbstractCegarLoop]: === Iteration 295 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:22,849 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:22,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1092562236, now seen corresponding path program 294 times [2025-04-13 22:37:22,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:22,850 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454073452] [2025-04-13 22:37:22,850 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:37:22,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:22,854 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:22,858 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:22,858 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:37:22,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:22,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:22,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:22,956 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454073452] [2025-04-13 22:37:22,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454073452] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:22,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:22,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:37:22,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381919177] [2025-04-13 22:37:22,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:22,957 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:22,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:22,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:22,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:37:22,957 INFO L87 Difference]: Start difference. First operand 763 states and 2117 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:23,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:23,359 INFO L93 Difference]: Finished difference Result 900 states and 2488 transitions. [2025-04-13 22:37:23,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:37:23,359 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:23,359 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:23,368 INFO L225 Difference]: With dead ends: 900 [2025-04-13 22:37:23,368 INFO L226 Difference]: Without dead ends: 840 [2025-04-13 22:37:23,368 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:37:23,368 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 173 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:23,368 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 82 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:23,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2025-04-13 22:37:23,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 759. [2025-04-13 22:37:23,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 758 states have (on average 2.7770448548812663) internal successors, (2105), 758 states have internal predecessors, (2105), 0 states have call successors, (0), 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:37:23,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 2105 transitions. [2025-04-13 22:37:23,379 INFO L79 Accepts]: Start accepts. Automaton has 759 states and 2105 transitions. Word has length 56 [2025-04-13 22:37:23,379 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:23,379 INFO L485 AbstractCegarLoop]: Abstraction has 759 states and 2105 transitions. [2025-04-13 22:37:23,379 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:23,379 INFO L278 IsEmpty]: Start isEmpty. Operand 759 states and 2105 transitions. [2025-04-13 22:37:23,380 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:23,380 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:23,380 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:23,380 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable294 [2025-04-13 22:37:23,380 INFO L403 AbstractCegarLoop]: === Iteration 296 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:23,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:23,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1619154852, now seen corresponding path program 295 times [2025-04-13 22:37:23,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:23,380 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711263287] [2025-04-13 22:37:23,381 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:37:23,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:23,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:37:23,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:23,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:23,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:24,291 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:37:24,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:24,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711263287] [2025-04-13 22:37:24,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711263287] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:24,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67447287] [2025-04-13 22:37:24,291 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:37:24,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:24,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:24,293 INFO L229 MonitoredProcess]: Starting monitored process 99 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:37:24,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2025-04-13 22:37:24,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:37:24,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:24,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:24,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:24,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:37:24,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:24,621 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:37:24,621 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:37:24,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:37:24,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:37:24,830 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:37:24,831 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:37:24,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:24,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67447287] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:24,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:37:24,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 33 [2025-04-13 22:37:24,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029414645] [2025-04-13 22:37:24,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:24,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:24,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:24,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:24,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1040, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:37:24,853 INFO L87 Difference]: Start difference. First operand 759 states and 2105 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:25,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:25,540 INFO L93 Difference]: Finished difference Result 1094 states and 3090 transitions. [2025-04-13 22:37:25,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:37:25,540 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:25,540 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:25,549 INFO L225 Difference]: With dead ends: 1094 [2025-04-13 22:37:25,549 INFO L226 Difference]: Without dead ends: 1035 [2025-04-13 22:37:25,549 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=225, Invalid=2637, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:37:25,549 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 237 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:25,549 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 78 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:37:25,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2025-04-13 22:37:25,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 811. [2025-04-13 22:37:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 810 states have (on average 2.793827160493827) internal successors, (2263), 810 states have internal predecessors, (2263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:25,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 2263 transitions. [2025-04-13 22:37:25,566 INFO L79 Accepts]: Start accepts. Automaton has 811 states and 2263 transitions. Word has length 56 [2025-04-13 22:37:25,566 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:25,566 INFO L485 AbstractCegarLoop]: Abstraction has 811 states and 2263 transitions. [2025-04-13 22:37:25,566 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:25,566 INFO L278 IsEmpty]: Start isEmpty. Operand 811 states and 2263 transitions. [2025-04-13 22:37:25,567 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:25,567 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:25,567 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:25,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Ended with exit code 0 [2025-04-13 22:37:25,767 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable295,99 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:25,767 INFO L403 AbstractCegarLoop]: === Iteration 297 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:25,768 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:25,768 INFO L85 PathProgramCache]: Analyzing trace with hash 2133259716, now seen corresponding path program 296 times [2025-04-13 22:37:25,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:25,768 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412878583] [2025-04-13 22:37:25,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:37:25,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:25,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:25,776 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:25,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:37:25,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:25,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:25,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:25,875 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412878583] [2025-04-13 22:37:25,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412878583] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:25,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:25,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:37:25,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167543512] [2025-04-13 22:37:25,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:25,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:25,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:25,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:25,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:37:25,876 INFO L87 Difference]: Start difference. First operand 811 states and 2263 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:26,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:26,272 INFO L93 Difference]: Finished difference Result 1017 states and 2815 transitions. [2025-04-13 22:37:26,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:37:26,272 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:26,272 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:26,280 INFO L225 Difference]: With dead ends: 1017 [2025-04-13 22:37:26,280 INFO L226 Difference]: Without dead ends: 829 [2025-04-13 22:37:26,281 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:37:26,281 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 208 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:26,281 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 87 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:26,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2025-04-13 22:37:26,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 767. [2025-04-13 22:37:26,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 2.766318537859008) internal successors, (2119), 766 states have internal predecessors, (2119), 0 states have call successors, (0), 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:37:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 2119 transitions. [2025-04-13 22:37:26,292 INFO L79 Accepts]: Start accepts. Automaton has 767 states and 2119 transitions. Word has length 56 [2025-04-13 22:37:26,292 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:26,292 INFO L485 AbstractCegarLoop]: Abstraction has 767 states and 2119 transitions. [2025-04-13 22:37:26,292 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:26,292 INFO L278 IsEmpty]: Start isEmpty. Operand 767 states and 2119 transitions. [2025-04-13 22:37:26,293 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:26,293 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:26,293 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:26,293 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable296 [2025-04-13 22:37:26,293 INFO L403 AbstractCegarLoop]: === Iteration 298 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:26,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:26,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1126366178, now seen corresponding path program 297 times [2025-04-13 22:37:26,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:26,293 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851099542] [2025-04-13 22:37:26,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:37:26,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:26,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:26,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:26,302 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:37:26,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:26,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:26,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851099542] [2025-04-13 22:37:26,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851099542] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:26,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:26,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:26,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527774829] [2025-04-13 22:37:26,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:26,392 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:26,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:26,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:26,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:26,393 INFO L87 Difference]: Start difference. First operand 767 states and 2119 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:26,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:26,819 INFO L93 Difference]: Finished difference Result 1039 states and 2911 transitions. [2025-04-13 22:37:26,820 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:37:26,820 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:26,820 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:26,828 INFO L225 Difference]: With dead ends: 1039 [2025-04-13 22:37:26,828 INFO L226 Difference]: Without dead ends: 987 [2025-04-13 22:37:26,828 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:37:26,828 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 198 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:26,828 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 78 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:26,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2025-04-13 22:37:26,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 763. [2025-04-13 22:37:26,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 762 states have (on average 2.7650918635170605) internal successors, (2107), 762 states have internal predecessors, (2107), 0 states have call successors, (0), 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:37:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 2107 transitions. [2025-04-13 22:37:26,840 INFO L79 Accepts]: Start accepts. Automaton has 763 states and 2107 transitions. Word has length 56 [2025-04-13 22:37:26,840 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:26,840 INFO L485 AbstractCegarLoop]: Abstraction has 763 states and 2107 transitions. [2025-04-13 22:37:26,840 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:26,840 INFO L278 IsEmpty]: Start isEmpty. Operand 763 states and 2107 transitions. [2025-04-13 22:37:26,841 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:26,841 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:26,841 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:26,841 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable297 [2025-04-13 22:37:26,841 INFO L403 AbstractCegarLoop]: === Iteration 299 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:26,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:26,841 INFO L85 PathProgramCache]: Analyzing trace with hash 599948570, now seen corresponding path program 298 times [2025-04-13 22:37:26,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:26,841 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783868945] [2025-04-13 22:37:26,841 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:37:26,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:26,846 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:26,848 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:37:26,849 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:37:26,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:26,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:26,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:26,920 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783868945] [2025-04-13 22:37:26,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783868945] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:26,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:26,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:37:26,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319971268] [2025-04-13 22:37:26,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:26,920 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:26,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:26,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:26,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:37:26,920 INFO L87 Difference]: Start difference. First operand 763 states and 2107 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:27,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:27,274 INFO L93 Difference]: Finished difference Result 927 states and 2520 transitions. [2025-04-13 22:37:27,274 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:37:27,274 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:27,274 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:27,282 INFO L225 Difference]: With dead ends: 927 [2025-04-13 22:37:27,282 INFO L226 Difference]: Without dead ends: 713 [2025-04-13 22:37:27,282 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:37:27,282 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 144 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:27,283 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 87 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:27,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-04-13 22:37:27,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2025-04-13 22:37:27,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 712 states have (on average 2.776685393258427) internal successors, (1977), 712 states have internal predecessors, (1977), 0 states have call successors, (0), 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:37:27,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1977 transitions. [2025-04-13 22:37:27,295 INFO L79 Accepts]: Start accepts. Automaton has 713 states and 1977 transitions. Word has length 56 [2025-04-13 22:37:27,295 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:27,295 INFO L485 AbstractCegarLoop]: Abstraction has 713 states and 1977 transitions. [2025-04-13 22:37:27,295 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:27,295 INFO L278 IsEmpty]: Start isEmpty. Operand 713 states and 1977 transitions. [2025-04-13 22:37:27,296 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:27,296 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:27,296 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:27,296 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable298 [2025-04-13 22:37:27,296 INFO L403 AbstractCegarLoop]: === Iteration 300 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:27,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:27,296 INFO L85 PathProgramCache]: Analyzing trace with hash 782818024, now seen corresponding path program 299 times [2025-04-13 22:37:27,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:27,296 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719351490] [2025-04-13 22:37:27,296 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:37:27,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:27,301 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:27,308 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:27,308 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:37:27,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:28,058 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:37:28,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:28,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719351490] [2025-04-13 22:37:28,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719351490] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:28,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364010852] [2025-04-13 22:37:28,058 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:37:28,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:28,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:28,060 INFO L229 MonitoredProcess]: Starting monitored process 100 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:37:28,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2025-04-13 22:37:28,181 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:28,198 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:28,198 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:37:28,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:28,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:37:28,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:28,394 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:37:28,394 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:37:28,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:37:28,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:37:28,552 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:37:28,552 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:37:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:28,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364010852] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:28,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:37:28,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 31 [2025-04-13 22:37:28,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079019245] [2025-04-13 22:37:28,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:28,574 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:28,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:28,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:28,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=914, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:37:28,574 INFO L87 Difference]: Start difference. First operand 713 states and 1977 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:29,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:29,260 INFO L93 Difference]: Finished difference Result 993 states and 2789 transitions. [2025-04-13 22:37:29,260 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:37:29,260 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:29,260 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:29,268 INFO L225 Difference]: With dead ends: 993 [2025-04-13 22:37:29,268 INFO L226 Difference]: Without dead ends: 933 [2025-04-13 22:37:29,269 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=2534, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:37:29,269 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 239 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:29,269 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 77 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:37:29,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-04-13 22:37:29,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 709. [2025-04-13 22:37:29,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 708 states have (on average 2.7754237288135593) internal successors, (1965), 708 states have internal predecessors, (1965), 0 states have call successors, (0), 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:37:29,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1965 transitions. [2025-04-13 22:37:29,281 INFO L79 Accepts]: Start accepts. Automaton has 709 states and 1965 transitions. Word has length 56 [2025-04-13 22:37:29,281 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:29,281 INFO L485 AbstractCegarLoop]: Abstraction has 709 states and 1965 transitions. [2025-04-13 22:37:29,281 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:29,281 INFO L278 IsEmpty]: Start isEmpty. Operand 709 states and 1965 transitions. [2025-04-13 22:37:29,281 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:29,281 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:29,281 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:29,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Ended with exit code 0 [2025-04-13 22:37:29,482 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable299,100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:29,482 INFO L403 AbstractCegarLoop]: === Iteration 301 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:29,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:29,482 INFO L85 PathProgramCache]: Analyzing trace with hash 185238478, now seen corresponding path program 300 times [2025-04-13 22:37:29,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:29,482 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716034719] [2025-04-13 22:37:29,482 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:37:29,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:29,487 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:29,491 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:29,491 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:37:29,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:29,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:29,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:29,587 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716034719] [2025-04-13 22:37:29,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716034719] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:29,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:29,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:37:29,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462574137] [2025-04-13 22:37:29,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:29,587 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:29,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:29,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:29,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:37:29,587 INFO L87 Difference]: Start difference. First operand 709 states and 1965 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:30,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:30,062 INFO L93 Difference]: Finished difference Result 982 states and 2755 transitions. [2025-04-13 22:37:30,062 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:37:30,062 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:30,062 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:30,070 INFO L225 Difference]: With dead ends: 982 [2025-04-13 22:37:30,070 INFO L226 Difference]: Without dead ends: 885 [2025-04-13 22:37:30,070 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=201, Invalid=1059, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:37:30,071 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 300 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:30,071 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 64 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-04-13 22:37:30,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 742. [2025-04-13 22:37:30,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 2.7908232118758436) internal successors, (2068), 741 states have internal predecessors, (2068), 0 states have call successors, (0), 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:37:30,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 2068 transitions. [2025-04-13 22:37:30,082 INFO L79 Accepts]: Start accepts. Automaton has 742 states and 2068 transitions. Word has length 56 [2025-04-13 22:37:30,082 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:30,082 INFO L485 AbstractCegarLoop]: Abstraction has 742 states and 2068 transitions. [2025-04-13 22:37:30,082 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:30,082 INFO L278 IsEmpty]: Start isEmpty. Operand 742 states and 2068 transitions. [2025-04-13 22:37:30,083 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:30,083 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:30,083 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:30,083 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable300 [2025-04-13 22:37:30,083 INFO L403 AbstractCegarLoop]: === Iteration 302 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:30,083 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:30,083 INFO L85 PathProgramCache]: Analyzing trace with hash 648793920, now seen corresponding path program 301 times [2025-04-13 22:37:30,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:30,083 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812557953] [2025-04-13 22:37:30,083 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:37:30,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:30,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:37:30,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:30,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:30,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:30,899 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:37:30,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:30,899 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812557953] [2025-04-13 22:37:30,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812557953] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:30,899 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690447857] [2025-04-13 22:37:30,899 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:37:30,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:30,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:30,901 INFO L229 MonitoredProcess]: Starting monitored process 101 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:37:30,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2025-04-13 22:37:31,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:37:31,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:31,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:31,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:31,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:37:31,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:31,234 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:37:31,234 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:37:31,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:37:31,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:37:31,433 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:37:31,433 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:37:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:31,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690447857] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:31,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:37:31,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 33 [2025-04-13 22:37:31,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969304541] [2025-04-13 22:37:31,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:31,455 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:31,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:31,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:31,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1031, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:37:31,455 INFO L87 Difference]: Start difference. First operand 742 states and 2068 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:32,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:32,122 INFO L93 Difference]: Finished difference Result 1039 states and 2899 transitions. [2025-04-13 22:37:32,123 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:37:32,123 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:32,123 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:32,131 INFO L225 Difference]: With dead ends: 1039 [2025-04-13 22:37:32,131 INFO L226 Difference]: Without dead ends: 807 [2025-04-13 22:37:32,132 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=2541, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:37:32,132 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 241 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:32,132 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 82 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:32,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2025-04-13 22:37:32,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 654. [2025-04-13 22:37:32,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 653 states have (on average 2.741194486983155) internal successors, (1790), 653 states have internal predecessors, (1790), 0 states have call successors, (0), 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:37:32,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1790 transitions. [2025-04-13 22:37:32,143 INFO L79 Accepts]: Start accepts. Automaton has 654 states and 1790 transitions. Word has length 56 [2025-04-13 22:37:32,143 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:32,143 INFO L485 AbstractCegarLoop]: Abstraction has 654 states and 1790 transitions. [2025-04-13 22:37:32,143 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:32,143 INFO L278 IsEmpty]: Start isEmpty. Operand 654 states and 1790 transitions. [2025-04-13 22:37:32,144 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:32,144 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:32,144 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:32,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Ended with exit code 0 [2025-04-13 22:37:32,344 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable301 [2025-04-13 22:37:32,344 INFO L403 AbstractCegarLoop]: === Iteration 303 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:32,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:32,344 INFO L85 PathProgramCache]: Analyzing trace with hash 561040524, now seen corresponding path program 302 times [2025-04-13 22:37:32,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:32,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637261999] [2025-04-13 22:37:32,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:37:32,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:32,350 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:32,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:32,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:37:32,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:32,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:32,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637261999] [2025-04-13 22:37:32,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637261999] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:32,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:32,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:37:32,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382554562] [2025-04-13 22:37:32,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:32,448 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:32,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:32,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:32,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:37:32,448 INFO L87 Difference]: Start difference. First operand 654 states and 1790 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:32,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:32,918 INFO L93 Difference]: Finished difference Result 883 states and 2442 transitions. [2025-04-13 22:37:32,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:37:32,919 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:32,919 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:32,927 INFO L225 Difference]: With dead ends: 883 [2025-04-13 22:37:32,927 INFO L226 Difference]: Without dead ends: 824 [2025-04-13 22:37:32,928 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=1001, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:37:32,928 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 199 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:32,928 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 65 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:32,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2025-04-13 22:37:32,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 658. [2025-04-13 22:37:32,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 657 states have (on average 2.736681887366819) internal successors, (1798), 657 states have internal predecessors, (1798), 0 states have call successors, (0), 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:37:32,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1798 transitions. [2025-04-13 22:37:32,939 INFO L79 Accepts]: Start accepts. Automaton has 658 states and 1798 transitions. Word has length 56 [2025-04-13 22:37:32,939 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:32,939 INFO L485 AbstractCegarLoop]: Abstraction has 658 states and 1798 transitions. [2025-04-13 22:37:32,939 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:32,939 INFO L278 IsEmpty]: Start isEmpty. Operand 658 states and 1798 transitions. [2025-04-13 22:37:32,939 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:32,939 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:32,939 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:32,939 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable302 [2025-04-13 22:37:32,939 INFO L403 AbstractCegarLoop]: === Iteration 304 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:32,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:32,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1675291268, now seen corresponding path program 303 times [2025-04-13 22:37:32,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:32,940 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278176389] [2025-04-13 22:37:32,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:37:32,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:32,959 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:32,963 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:32,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:37:32,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:33,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:33,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:33,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278176389] [2025-04-13 22:37:33,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278176389] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:33,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:33,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:37:33,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129720367] [2025-04-13 22:37:33,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:33,064 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:33,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:33,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:33,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:37:33,065 INFO L87 Difference]: Start difference. First operand 658 states and 1798 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:33,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:33,498 INFO L93 Difference]: Finished difference Result 951 states and 2654 transitions. [2025-04-13 22:37:33,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:37:33,498 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:33,498 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:33,506 INFO L225 Difference]: With dead ends: 951 [2025-04-13 22:37:33,506 INFO L226 Difference]: Without dead ends: 892 [2025-04-13 22:37:33,506 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:37:33,506 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 181 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:33,506 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 88 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:33,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2025-04-13 22:37:33,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 716. [2025-04-13 22:37:33,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 2.7706293706293708) internal successors, (1981), 715 states have internal predecessors, (1981), 0 states have call successors, (0), 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:37:33,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1981 transitions. [2025-04-13 22:37:33,517 INFO L79 Accepts]: Start accepts. Automaton has 716 states and 1981 transitions. Word has length 56 [2025-04-13 22:37:33,518 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:33,518 INFO L485 AbstractCegarLoop]: Abstraction has 716 states and 1981 transitions. [2025-04-13 22:37:33,518 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:33,518 INFO L278 IsEmpty]: Start isEmpty. Operand 716 states and 1981 transitions. [2025-04-13 22:37:33,518 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:33,518 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:33,518 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:33,518 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable303 [2025-04-13 22:37:33,518 INFO L403 AbstractCegarLoop]: === Iteration 305 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:33,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:33,519 INFO L85 PathProgramCache]: Analyzing trace with hash -860844562, now seen corresponding path program 304 times [2025-04-13 22:37:33,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:33,519 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265410905] [2025-04-13 22:37:33,519 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:37:33,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:33,523 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:33,526 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:37:33,526 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:37:33,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:33,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:33,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265410905] [2025-04-13 22:37:33,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265410905] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:33,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:33,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:37:33,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087463324] [2025-04-13 22:37:33,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:33,603 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:33,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:33,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:33,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:37:33,603 INFO L87 Difference]: Start difference. First operand 716 states and 1981 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:34,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:34,016 INFO L93 Difference]: Finished difference Result 911 states and 2535 transitions. [2025-04-13 22:37:34,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:37:34,016 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:34,017 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:34,024 INFO L225 Difference]: With dead ends: 911 [2025-04-13 22:37:34,024 INFO L226 Difference]: Without dead ends: 851 [2025-04-13 22:37:34,025 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=939, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:37:34,025 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 187 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:34,025 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 65 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:34,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-04-13 22:37:34,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 708. [2025-04-13 22:37:34,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 707 states have (on average 2.768033946251768) internal successors, (1957), 707 states have internal predecessors, (1957), 0 states have call successors, (0), 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:37:34,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1957 transitions. [2025-04-13 22:37:34,036 INFO L79 Accepts]: Start accepts. Automaton has 708 states and 1957 transitions. Word has length 56 [2025-04-13 22:37:34,036 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:34,036 INFO L485 AbstractCegarLoop]: Abstraction has 708 states and 1957 transitions. [2025-04-13 22:37:34,036 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:34,036 INFO L278 IsEmpty]: Start isEmpty. Operand 708 states and 1957 transitions. [2025-04-13 22:37:34,036 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:34,036 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:34,037 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:34,037 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable304 [2025-04-13 22:37:34,037 INFO L403 AbstractCegarLoop]: === Iteration 306 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:34,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:34,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2126887354, now seen corresponding path program 305 times [2025-04-13 22:37:34,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:34,037 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346952092] [2025-04-13 22:37:34,037 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:37:34,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:34,042 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:34,048 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:34,048 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:37:34,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:34,569 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:37:34,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:34,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346952092] [2025-04-13 22:37:34,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346952092] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:34,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237693334] [2025-04-13 22:37:34,569 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:37:34,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:34,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:34,571 INFO L229 MonitoredProcess]: Starting monitored process 102 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:37:34,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2025-04-13 22:37:34,694 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:34,711 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:34,711 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:37:34,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:34,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:37:34,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:34,882 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:37:34,882 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:37:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:37:34,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:37:35,080 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:37:35,081 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:37:35,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:35,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237693334] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:35,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:37:35,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 31 [2025-04-13 22:37:35,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451251485] [2025-04-13 22:37:35,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:35,101 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:35,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:35,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:35,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=912, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:37:35,101 INFO L87 Difference]: Start difference. First operand 708 states and 1957 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:35,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:35,727 INFO L93 Difference]: Finished difference Result 928 states and 2587 transitions. [2025-04-13 22:37:35,727 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:37:35,727 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:35,727 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:35,735 INFO L225 Difference]: With dead ends: 928 [2025-04-13 22:37:35,735 INFO L226 Difference]: Without dead ends: 876 [2025-04-13 22:37:35,735 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=2170, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:37:35,735 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 164 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:35,735 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 83 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:35,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2025-04-13 22:37:35,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 704. [2025-04-13 22:37:35,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 703 states have (on average 2.7667140825035563) internal successors, (1945), 703 states have internal predecessors, (1945), 0 states have call successors, (0), 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:37:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1945 transitions. [2025-04-13 22:37:35,746 INFO L79 Accepts]: Start accepts. Automaton has 704 states and 1945 transitions. Word has length 56 [2025-04-13 22:37:35,746 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:35,746 INFO L485 AbstractCegarLoop]: Abstraction has 704 states and 1945 transitions. [2025-04-13 22:37:35,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:35,746 INFO L278 IsEmpty]: Start isEmpty. Operand 704 states and 1945 transitions. [2025-04-13 22:37:35,747 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:35,747 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:35,747 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:35,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Forceful destruction successful, exit code 0 [2025-04-13 22:37:35,947 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable305 [2025-04-13 22:37:35,948 INFO L403 AbstractCegarLoop]: === Iteration 307 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:35,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:35,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2060413458, now seen corresponding path program 306 times [2025-04-13 22:37:35,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:35,948 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404417875] [2025-04-13 22:37:35,948 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:37:35,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:35,953 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:35,956 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:35,956 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:37:35,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:36,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:36,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:36,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404417875] [2025-04-13 22:37:36,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404417875] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:36,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:36,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:37:36,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318808471] [2025-04-13 22:37:36,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:36,051 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:36,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:36,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:36,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:37:36,051 INFO L87 Difference]: Start difference. First operand 704 states and 1945 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:36,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:36,489 INFO L93 Difference]: Finished difference Result 960 states and 2672 transitions. [2025-04-13 22:37:36,489 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:37:36,489 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:36,489 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:36,497 INFO L225 Difference]: With dead ends: 960 [2025-04-13 22:37:36,497 INFO L226 Difference]: Without dead ends: 901 [2025-04-13 22:37:36,498 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=1208, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:37:36,498 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 241 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:36,498 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 64 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:36,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2025-04-13 22:37:36,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 712. [2025-04-13 22:37:36,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 711 states have (on average 2.7637130801687766) internal successors, (1965), 711 states have internal predecessors, (1965), 0 states have call successors, (0), 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:37:36,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1965 transitions. [2025-04-13 22:37:36,509 INFO L79 Accepts]: Start accepts. Automaton has 712 states and 1965 transitions. Word has length 56 [2025-04-13 22:37:36,510 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:36,510 INFO L485 AbstractCegarLoop]: Abstraction has 712 states and 1965 transitions. [2025-04-13 22:37:36,510 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:36,510 INFO L278 IsEmpty]: Start isEmpty. Operand 712 states and 1965 transitions. [2025-04-13 22:37:36,510 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:36,510 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:36,510 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:36,510 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable306 [2025-04-13 22:37:36,510 INFO L403 AbstractCegarLoop]: === Iteration 308 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:36,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:36,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1783339200, now seen corresponding path program 307 times [2025-04-13 22:37:36,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:36,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017925687] [2025-04-13 22:37:36,511 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:37:36,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:36,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:37:36,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:36,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:36,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:37,505 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:37:37,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:37,506 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017925687] [2025-04-13 22:37:37,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017925687] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:37,506 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438538026] [2025-04-13 22:37:37,506 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:37:37,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:37,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:37,508 INFO L229 MonitoredProcess]: Starting monitored process 103 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:37:37,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2025-04-13 22:37:37,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:37:37,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:37,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:37,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:37,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:37:37,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:37,887 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:37:37,887 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:37:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:37:37,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:37:38,141 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:37:38,141 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:37:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:38,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438538026] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:38,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:37:38,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 35 [2025-04-13 22:37:38,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898717025] [2025-04-13 22:37:38,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:38,166 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:38,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:38,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:38,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1178, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:37:38,166 INFO L87 Difference]: Start difference. First operand 712 states and 1965 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:38,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:38,858 INFO L93 Difference]: Finished difference Result 940 states and 2615 transitions. [2025-04-13 22:37:38,859 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:37:38,859 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:38,859 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:38,869 INFO L225 Difference]: With dead ends: 940 [2025-04-13 22:37:38,869 INFO L226 Difference]: Without dead ends: 880 [2025-04-13 22:37:38,870 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=193, Invalid=2669, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:37:38,870 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 175 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:38,870 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 83 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:38,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-04-13 22:37:38,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 708. [2025-04-13 22:37:38,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 707 states have (on average 2.762376237623762) internal successors, (1953), 707 states have internal predecessors, (1953), 0 states have call successors, (0), 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:37:38,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1953 transitions. [2025-04-13 22:37:38,885 INFO L79 Accepts]: Start accepts. Automaton has 708 states and 1953 transitions. Word has length 56 [2025-04-13 22:37:38,885 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:38,885 INFO L485 AbstractCegarLoop]: Abstraction has 708 states and 1953 transitions. [2025-04-13 22:37:38,885 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:38,885 INFO L278 IsEmpty]: Start isEmpty. Operand 708 states and 1953 transitions. [2025-04-13 22:37:38,886 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:38,886 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:38,886 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:38,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Ended with exit code 0 [2025-04-13 22:37:39,086 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable307 [2025-04-13 22:37:39,086 INFO L403 AbstractCegarLoop]: === Iteration 309 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:39,087 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:39,087 INFO L85 PathProgramCache]: Analyzing trace with hash 812668752, now seen corresponding path program 308 times [2025-04-13 22:37:39,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:39,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369776068] [2025-04-13 22:37:39,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:37:39,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:39,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:39,095 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:39,095 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:37:39,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:39,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:39,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369776068] [2025-04-13 22:37:39,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369776068] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:39,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:39,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:37:39,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199075270] [2025-04-13 22:37:39,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:39,189 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:39,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:39,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:39,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:37:39,189 INFO L87 Difference]: Start difference. First operand 708 states and 1953 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:39,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:39,615 INFO L93 Difference]: Finished difference Result 945 states and 2625 transitions. [2025-04-13 22:37:39,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:37:39,615 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:39,615 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:39,624 INFO L225 Difference]: With dead ends: 945 [2025-04-13 22:37:39,624 INFO L226 Difference]: Without dead ends: 893 [2025-04-13 22:37:39,625 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=1079, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:37:39,625 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 204 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:39,625 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 64 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:39,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2025-04-13 22:37:39,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 704. [2025-04-13 22:37:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 703 states have (on average 2.7610241820768135) internal successors, (1941), 703 states have internal predecessors, (1941), 0 states have call successors, (0), 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:37:39,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1941 transitions. [2025-04-13 22:37:39,638 INFO L79 Accepts]: Start accepts. Automaton has 704 states and 1941 transitions. Word has length 56 [2025-04-13 22:37:39,638 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:39,638 INFO L485 AbstractCegarLoop]: Abstraction has 704 states and 1941 transitions. [2025-04-13 22:37:39,638 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:39,638 INFO L278 IsEmpty]: Start isEmpty. Operand 704 states and 1941 transitions. [2025-04-13 22:37:39,639 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:39,639 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:39,639 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:39,639 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable308 [2025-04-13 22:37:39,639 INFO L403 AbstractCegarLoop]: === Iteration 310 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:39,639 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:39,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1649315096, now seen corresponding path program 309 times [2025-04-13 22:37:39,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:39,639 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251553034] [2025-04-13 22:37:39,639 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:37:39,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:39,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:39,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:39,648 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:37:39,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:39,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:39,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:39,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251553034] [2025-04-13 22:37:39,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251553034] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:39,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:39,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:37:39,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182745615] [2025-04-13 22:37:39,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:39,748 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:39,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:39,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:39,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:37:39,749 INFO L87 Difference]: Start difference. First operand 704 states and 1941 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:40,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:40,224 INFO L93 Difference]: Finished difference Result 1079 states and 3007 transitions. [2025-04-13 22:37:40,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:37:40,224 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:40,224 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:40,232 INFO L225 Difference]: With dead ends: 1079 [2025-04-13 22:37:40,232 INFO L226 Difference]: Without dead ends: 891 [2025-04-13 22:37:40,233 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:37:40,233 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 241 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:40,233 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 104 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:40,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2025-04-13 22:37:40,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 778. [2025-04-13 22:37:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 2.7387387387387387) internal successors, (2128), 777 states have internal predecessors, (2128), 0 states have call successors, (0), 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:37:40,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 2128 transitions. [2025-04-13 22:37:40,245 INFO L79 Accepts]: Start accepts. Automaton has 778 states and 2128 transitions. Word has length 56 [2025-04-13 22:37:40,245 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:40,245 INFO L485 AbstractCegarLoop]: Abstraction has 778 states and 2128 transitions. [2025-04-13 22:37:40,245 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:40,245 INFO L278 IsEmpty]: Start isEmpty. Operand 778 states and 2128 transitions. [2025-04-13 22:37:40,246 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:40,246 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:40,246 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:40,246 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable309 [2025-04-13 22:37:40,246 INFO L403 AbstractCegarLoop]: === Iteration 311 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:40,246 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:40,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1247389430, now seen corresponding path program 310 times [2025-04-13 22:37:40,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:40,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427637501] [2025-04-13 22:37:40,246 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:37:40,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:40,251 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:40,254 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:37:40,254 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:37:40,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:40,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:40,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:40,329 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427637501] [2025-04-13 22:37:40,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427637501] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:40,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:40,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:37:40,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15315320] [2025-04-13 22:37:40,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:40,329 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:40,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:40,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:40,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:37:40,330 INFO L87 Difference]: Start difference. First operand 778 states and 2128 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:40,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:40,756 INFO L93 Difference]: Finished difference Result 932 states and 2541 transitions. [2025-04-13 22:37:40,757 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:37:40,757 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:40,757 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:40,765 INFO L225 Difference]: With dead ends: 932 [2025-04-13 22:37:40,765 INFO L226 Difference]: Without dead ends: 864 [2025-04-13 22:37:40,765 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=1145, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:37:40,765 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 206 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:40,765 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 64 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:40,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-04-13 22:37:40,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 766. [2025-04-13 22:37:40,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 765 states have (on average 2.7398692810457517) internal successors, (2096), 765 states have internal predecessors, (2096), 0 states have call successors, (0), 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:37:40,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 2096 transitions. [2025-04-13 22:37:40,777 INFO L79 Accepts]: Start accepts. Automaton has 766 states and 2096 transitions. Word has length 56 [2025-04-13 22:37:40,777 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:40,777 INFO L485 AbstractCegarLoop]: Abstraction has 766 states and 2096 transitions. [2025-04-13 22:37:40,778 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:40,778 INFO L278 IsEmpty]: Start isEmpty. Operand 766 states and 2096 transitions. [2025-04-13 22:37:40,778 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:40,778 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:40,778 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:40,778 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable310 [2025-04-13 22:37:40,778 INFO L403 AbstractCegarLoop]: === Iteration 312 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:40,779 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:40,779 INFO L85 PathProgramCache]: Analyzing trace with hash -2081887006, now seen corresponding path program 311 times [2025-04-13 22:37:40,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:40,779 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557326758] [2025-04-13 22:37:40,779 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:37:40,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:40,783 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:40,790 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:40,790 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:37:40,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:41,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:37:41,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:41,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557326758] [2025-04-13 22:37:41,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557326758] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:41,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733720827] [2025-04-13 22:37:41,367 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:37:41,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:41,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:41,369 INFO L229 MonitoredProcess]: Starting monitored process 104 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:37:41,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2025-04-13 22:37:41,494 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:41,511 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:41,512 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:37:41,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:41,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:37:41,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:41,711 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:37:41,711 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:37:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:41,717 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:37:41,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733720827] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:41,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:37:41,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 24 [2025-04-13 22:37:41,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911570415] [2025-04-13 22:37:41,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:41,717 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:41,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:41,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:41,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=550, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:37:41,718 INFO L87 Difference]: Start difference. First operand 766 states and 2096 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:42,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:42,511 INFO L93 Difference]: Finished difference Result 957 states and 2584 transitions. [2025-04-13 22:37:42,511 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:37:42,512 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:42,512 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:42,521 INFO L225 Difference]: With dead ends: 957 [2025-04-13 22:37:42,521 INFO L226 Difference]: Without dead ends: 763 [2025-04-13 22:37:42,522 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=1425, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:37:42,522 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 154 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:42,522 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 92 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:37:42,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2025-04-13 22:37:42,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 736. [2025-04-13 22:37:42,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 735 states have (on average 2.74421768707483) internal successors, (2017), 735 states have internal predecessors, (2017), 0 states have call successors, (0), 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:37:42,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 2017 transitions. [2025-04-13 22:37:42,534 INFO L79 Accepts]: Start accepts. Automaton has 736 states and 2017 transitions. Word has length 56 [2025-04-13 22:37:42,534 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:42,535 INFO L485 AbstractCegarLoop]: Abstraction has 736 states and 2017 transitions. [2025-04-13 22:37:42,535 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:42,535 INFO L278 IsEmpty]: Start isEmpty. Operand 736 states and 2017 transitions. [2025-04-13 22:37:42,535 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:42,535 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:42,535 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:42,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Ended with exit code 0 [2025-04-13 22:37:42,736 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 104 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable311 [2025-04-13 22:37:42,736 INFO L403 AbstractCegarLoop]: === Iteration 313 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:42,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:42,736 INFO L85 PathProgramCache]: Analyzing trace with hash -2144758164, now seen corresponding path program 312 times [2025-04-13 22:37:42,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:42,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910198569] [2025-04-13 22:37:42,736 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:37:42,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:42,741 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:42,745 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:42,745 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:37:42,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:42,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:42,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910198569] [2025-04-13 22:37:42,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910198569] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:42,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:42,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:42,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629863323] [2025-04-13 22:37:42,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:42,835 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:42,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:42,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:42,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:42,835 INFO L87 Difference]: Start difference. First operand 736 states and 2017 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:43,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:43,212 INFO L93 Difference]: Finished difference Result 945 states and 2603 transitions. [2025-04-13 22:37:43,212 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:37:43,213 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:43,213 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:43,222 INFO L225 Difference]: With dead ends: 945 [2025-04-13 22:37:43,222 INFO L226 Difference]: Without dead ends: 886 [2025-04-13 22:37:43,222 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:37:43,222 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 194 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:43,223 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 66 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:43,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-04-13 22:37:43,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 788. [2025-04-13 22:37:43,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 2.763659466327827) internal successors, (2175), 787 states have internal predecessors, (2175), 0 states have call successors, (0), 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:37:43,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 2175 transitions. [2025-04-13 22:37:43,236 INFO L79 Accepts]: Start accepts. Automaton has 788 states and 2175 transitions. Word has length 56 [2025-04-13 22:37:43,237 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:43,237 INFO L485 AbstractCegarLoop]: Abstraction has 788 states and 2175 transitions. [2025-04-13 22:37:43,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:43,237 INFO L278 IsEmpty]: Start isEmpty. Operand 788 states and 2175 transitions. [2025-04-13 22:37:43,237 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:43,237 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:43,238 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:43,238 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable312 [2025-04-13 22:37:43,238 INFO L403 AbstractCegarLoop]: === Iteration 314 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:43,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:43,238 INFO L85 PathProgramCache]: Analyzing trace with hash -207015338, now seen corresponding path program 313 times [2025-04-13 22:37:43,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:43,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414292796] [2025-04-13 22:37:43,238 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:37:43,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:43,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:37:43,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:43,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:43,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:44,163 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:37:44,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:44,163 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414292796] [2025-04-13 22:37:44,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414292796] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:44,163 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146195794] [2025-04-13 22:37:44,163 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:37:44,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:44,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:44,165 INFO L229 MonitoredProcess]: Starting monitored process 105 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:37:44,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2025-04-13 22:37:44,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:37:44,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:44,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:44,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:44,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:37:44,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:44,495 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:37:44,496 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:37:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:37:44,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:37:44,712 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:37:44,713 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:37:44,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:44,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146195794] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:44,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:37:44,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 33 [2025-04-13 22:37:44,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947360889] [2025-04-13 22:37:44,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:44,734 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:44,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:44,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:44,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:37:44,734 INFO L87 Difference]: Start difference. First operand 788 states and 2175 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:45,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:45,453 INFO L93 Difference]: Finished difference Result 965 states and 2665 transitions. [2025-04-13 22:37:45,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:37:45,453 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:45,453 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:45,462 INFO L225 Difference]: With dead ends: 965 [2025-04-13 22:37:45,462 INFO L226 Difference]: Without dead ends: 887 [2025-04-13 22:37:45,462 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=232, Invalid=2738, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 22:37:45,462 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 272 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:45,462 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 66 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:45,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2025-04-13 22:37:45,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 796. [2025-04-13 22:37:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 795 states have (on average 2.761006289308176) internal successors, (2195), 795 states have internal predecessors, (2195), 0 states have call successors, (0), 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:37:45,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 2195 transitions. [2025-04-13 22:37:45,475 INFO L79 Accepts]: Start accepts. Automaton has 796 states and 2195 transitions. Word has length 56 [2025-04-13 22:37:45,476 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:45,476 INFO L485 AbstractCegarLoop]: Abstraction has 796 states and 2195 transitions. [2025-04-13 22:37:45,476 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:45,476 INFO L278 IsEmpty]: Start isEmpty. Operand 796 states and 2195 transitions. [2025-04-13 22:37:45,476 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:45,476 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:45,476 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:45,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Ended with exit code 0 [2025-04-13 22:37:45,677 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable313,105 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:45,677 INFO L403 AbstractCegarLoop]: === Iteration 315 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:45,677 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:45,677 INFO L85 PathProgramCache]: Analyzing trace with hash 728324046, now seen corresponding path program 314 times [2025-04-13 22:37:45,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:45,677 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328936060] [2025-04-13 22:37:45,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:37:45,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:45,682 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:45,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:45,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:37:45,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:45,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:45,776 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328936060] [2025-04-13 22:37:45,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328936060] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:45,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:45,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:45,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349574266] [2025-04-13 22:37:45,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:45,777 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:45,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:45,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:45,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:45,777 INFO L87 Difference]: Start difference. First operand 796 states and 2195 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:46,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:46,154 INFO L93 Difference]: Finished difference Result 915 states and 2513 transitions. [2025-04-13 22:37:46,154 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:37:46,154 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:46,154 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:46,164 INFO L225 Difference]: With dead ends: 915 [2025-04-13 22:37:46,164 INFO L226 Difference]: Without dead ends: 863 [2025-04-13 22:37:46,164 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=150, Invalid=780, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:37:46,164 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 203 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:46,164 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 66 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:46,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-04-13 22:37:46,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 792. [2025-04-13 22:37:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 791 states have (on average 2.7597977243994944) internal successors, (2183), 791 states have internal predecessors, (2183), 0 states have call successors, (0), 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:37:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 2183 transitions. [2025-04-13 22:37:46,177 INFO L79 Accepts]: Start accepts. Automaton has 792 states and 2183 transitions. Word has length 56 [2025-04-13 22:37:46,177 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:46,177 INFO L485 AbstractCegarLoop]: Abstraction has 792 states and 2183 transitions. [2025-04-13 22:37:46,177 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:46,177 INFO L278 IsEmpty]: Start isEmpty. Operand 792 states and 2183 transitions. [2025-04-13 22:37:46,178 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:46,178 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:46,178 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:46,178 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable314 [2025-04-13 22:37:46,178 INFO L403 AbstractCegarLoop]: === Iteration 316 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:46,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:46,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1644655080, now seen corresponding path program 315 times [2025-04-13 22:37:46,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:46,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029967867] [2025-04-13 22:37:46,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:37:46,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:46,184 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:46,187 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:46,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:37:46,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:46,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:46,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:46,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029967867] [2025-04-13 22:37:46,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029967867] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:46,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:46,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:46,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693948029] [2025-04-13 22:37:46,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:46,278 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:46,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:46,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:46,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:46,279 INFO L87 Difference]: Start difference. First operand 792 states and 2183 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:46,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:46,671 INFO L93 Difference]: Finished difference Result 969 states and 2673 transitions. [2025-04-13 22:37:46,671 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:37:46,671 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:46,671 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:46,680 INFO L225 Difference]: With dead ends: 969 [2025-04-13 22:37:46,680 INFO L226 Difference]: Without dead ends: 910 [2025-04-13 22:37:46,681 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=879, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:37:46,681 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 196 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:46,681 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 66 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:46,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2025-04-13 22:37:46,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 796. [2025-04-13 22:37:46,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 795 states have (on average 2.7559748427672957) internal successors, (2191), 795 states have internal predecessors, (2191), 0 states have call successors, (0), 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:37:46,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 2191 transitions. [2025-04-13 22:37:46,695 INFO L79 Accepts]: Start accepts. Automaton has 796 states and 2191 transitions. Word has length 56 [2025-04-13 22:37:46,695 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:46,695 INFO L485 AbstractCegarLoop]: Abstraction has 796 states and 2191 transitions. [2025-04-13 22:37:46,695 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:46,695 INFO L278 IsEmpty]: Start isEmpty. Operand 796 states and 2191 transitions. [2025-04-13 22:37:46,696 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:46,696 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:46,696 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:46,696 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable315 [2025-04-13 22:37:46,696 INFO L403 AbstractCegarLoop]: === Iteration 317 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:46,696 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:46,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1331734136, now seen corresponding path program 316 times [2025-04-13 22:37:46,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:46,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206069746] [2025-04-13 22:37:46,696 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:37:46,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:46,701 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:46,704 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:37:46,704 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:37:46,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:46,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:46,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206069746] [2025-04-13 22:37:46,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206069746] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:46,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:46,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:46,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954537842] [2025-04-13 22:37:46,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:46,786 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:46,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:46,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:46,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:46,787 INFO L87 Difference]: Start difference. First operand 796 states and 2191 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:47,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:47,165 INFO L93 Difference]: Finished difference Result 923 states and 2529 transitions. [2025-04-13 22:37:47,165 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:37:47,165 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:47,165 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:47,174 INFO L225 Difference]: With dead ends: 923 [2025-04-13 22:37:47,174 INFO L226 Difference]: Without dead ends: 863 [2025-04-13 22:37:47,174 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=784, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:37:47,175 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 209 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:47,175 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 66 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:47,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-04-13 22:37:47,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 792. [2025-04-13 22:37:47,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 791 states have (on average 2.754740834386852) internal successors, (2179), 791 states have internal predecessors, (2179), 0 states have call successors, (0), 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:37:47,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 2179 transitions. [2025-04-13 22:37:47,188 INFO L79 Accepts]: Start accepts. Automaton has 792 states and 2179 transitions. Word has length 56 [2025-04-13 22:37:47,188 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:47,188 INFO L485 AbstractCegarLoop]: Abstraction has 792 states and 2179 transitions. [2025-04-13 22:37:47,188 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:47,188 INFO L278 IsEmpty]: Start isEmpty. Operand 792 states and 2179 transitions. [2025-04-13 22:37:47,189 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:47,189 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:47,189 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:47,189 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable316 [2025-04-13 22:37:47,189 INFO L403 AbstractCegarLoop]: === Iteration 318 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:47,189 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:47,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2137443754, now seen corresponding path program 317 times [2025-04-13 22:37:47,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:47,189 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063055988] [2025-04-13 22:37:47,189 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:37:47,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:47,194 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:47,201 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:47,201 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:37:47,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:47,915 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:37:47,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:47,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063055988] [2025-04-13 22:37:47,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063055988] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:47,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934987812] [2025-04-13 22:37:47,915 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:37:47,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:47,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:47,917 INFO L229 MonitoredProcess]: Starting monitored process 106 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:37:47,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2025-04-13 22:37:48,045 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:48,063 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:48,063 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:37:48,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:48,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:37:48,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:48,208 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:37:48,208 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:37:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:48,241 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:37:48,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934987812] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:48,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:37:48,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 26 [2025-04-13 22:37:48,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884851100] [2025-04-13 22:37:48,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:48,241 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:48,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:48,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:48,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:37:48,241 INFO L87 Difference]: Start difference. First operand 792 states and 2179 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:48,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:48,926 INFO L93 Difference]: Finished difference Result 931 states and 2563 transitions. [2025-04-13 22:37:48,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:37:48,926 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:48,926 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:48,934 INFO L225 Difference]: With dead ends: 931 [2025-04-13 22:37:48,934 INFO L226 Difference]: Without dead ends: 875 [2025-04-13 22:37:48,935 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=224, Invalid=1846, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:37:48,935 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 171 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:48,935 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 73 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:37:48,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-04-13 22:37:48,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 784. [2025-04-13 22:37:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 783 states have (on average 2.7573435504469987) internal successors, (2159), 783 states have internal predecessors, (2159), 0 states have call successors, (0), 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:37:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 2159 transitions. [2025-04-13 22:37:48,947 INFO L79 Accepts]: Start accepts. Automaton has 784 states and 2159 transitions. Word has length 56 [2025-04-13 22:37:48,947 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:48,947 INFO L485 AbstractCegarLoop]: Abstraction has 784 states and 2159 transitions. [2025-04-13 22:37:48,947 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:48,947 INFO L278 IsEmpty]: Start isEmpty. Operand 784 states and 2159 transitions. [2025-04-13 22:37:48,948 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:48,948 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:48,948 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:48,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Forceful destruction successful, exit code 0 [2025-04-13 22:37:49,148 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable317 [2025-04-13 22:37:49,148 INFO L403 AbstractCegarLoop]: === Iteration 319 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:49,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:49,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1191514064, now seen corresponding path program 318 times [2025-04-13 22:37:49,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:49,148 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588145828] [2025-04-13 22:37:49,148 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:37:49,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:49,153 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:49,157 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:49,157 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:37:49,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:49,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:49,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:49,248 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588145828] [2025-04-13 22:37:49,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588145828] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:49,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:49,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:49,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980404986] [2025-04-13 22:37:49,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:49,248 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:49,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:49,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:49,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:49,248 INFO L87 Difference]: Start difference. First operand 784 states and 2159 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:49,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:49,636 INFO L93 Difference]: Finished difference Result 948 states and 2582 transitions. [2025-04-13 22:37:49,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:37:49,636 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:49,636 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:49,645 INFO L225 Difference]: With dead ends: 948 [2025-04-13 22:37:49,645 INFO L226 Difference]: Without dead ends: 672 [2025-04-13 22:37:49,645 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:37:49,645 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 245 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:49,646 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 86 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:49,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-04-13 22:37:49,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 652. [2025-04-13 22:37:49,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 651 states have (on average 2.683563748079877) internal successors, (1747), 651 states have internal predecessors, (1747), 0 states have call successors, (0), 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:37:49,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 1747 transitions. [2025-04-13 22:37:49,656 INFO L79 Accepts]: Start accepts. Automaton has 652 states and 1747 transitions. Word has length 56 [2025-04-13 22:37:49,656 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:49,656 INFO L485 AbstractCegarLoop]: Abstraction has 652 states and 1747 transitions. [2025-04-13 22:37:49,656 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:49,656 INFO L278 IsEmpty]: Start isEmpty. Operand 652 states and 1747 transitions. [2025-04-13 22:37:49,657 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:49,657 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:49,657 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:49,657 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable318 [2025-04-13 22:37:49,657 INFO L403 AbstractCegarLoop]: === Iteration 320 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:49,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:49,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1335780044, now seen corresponding path program 319 times [2025-04-13 22:37:49,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:49,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721480436] [2025-04-13 22:37:49,657 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:37:49,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:49,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:37:49,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:49,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:49,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:50,553 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:37:50,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:50,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721480436] [2025-04-13 22:37:50,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721480436] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:50,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728653086] [2025-04-13 22:37:50,554 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:37:50,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:50,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:50,556 INFO L229 MonitoredProcess]: Starting monitored process 107 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:37:50,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2025-04-13 22:37:50,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:37:50,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:50,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:50,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:50,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:37:50,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:50,857 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:37:50,857 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:37:50,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:37:50,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:37:51,033 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:37:51,034 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:37:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:51,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728653086] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:51,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:37:51,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 31 [2025-04-13 22:37:51,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828065311] [2025-04-13 22:37:51,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:51,057 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:51,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:51,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:51,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:37:51,057 INFO L87 Difference]: Start difference. First operand 652 states and 1747 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:51,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:51,739 INFO L93 Difference]: Finished difference Result 837 states and 2261 transitions. [2025-04-13 22:37:51,739 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:37:51,739 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:51,739 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:51,747 INFO L225 Difference]: With dead ends: 837 [2025-04-13 22:37:51,747 INFO L226 Difference]: Without dead ends: 778 [2025-04-13 22:37:51,747 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=241, Invalid=2621, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:37:51,748 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 240 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:51,748 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 68 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:51,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2025-04-13 22:37:51,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 660. [2025-04-13 22:37:51,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 659 states have (on average 2.6813353566009104) internal successors, (1767), 659 states have internal predecessors, (1767), 0 states have call successors, (0), 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:37:51,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1767 transitions. [2025-04-13 22:37:51,758 INFO L79 Accepts]: Start accepts. Automaton has 660 states and 1767 transitions. Word has length 56 [2025-04-13 22:37:51,758 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:51,758 INFO L485 AbstractCegarLoop]: Abstraction has 660 states and 1767 transitions. [2025-04-13 22:37:51,758 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:51,758 INFO L278 IsEmpty]: Start isEmpty. Operand 660 states and 1767 transitions. [2025-04-13 22:37:51,759 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:51,759 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:51,759 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:51,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Ended with exit code 0 [2025-04-13 22:37:51,959 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable319,107 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:51,959 INFO L403 AbstractCegarLoop]: === Iteration 321 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:51,960 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:51,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1554923978, now seen corresponding path program 320 times [2025-04-13 22:37:51,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:51,960 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814042906] [2025-04-13 22:37:51,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:37:51,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:51,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:51,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:51,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:37:51,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:52,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:52,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:52,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814042906] [2025-04-13 22:37:52,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814042906] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:52,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:52,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:52,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583299013] [2025-04-13 22:37:52,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:52,061 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:52,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:52,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:52,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:52,061 INFO L87 Difference]: Start difference. First operand 660 states and 1767 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:52,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:52,421 INFO L93 Difference]: Finished difference Result 881 states and 2395 transitions. [2025-04-13 22:37:52,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:37:52,422 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:52,422 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:52,430 INFO L225 Difference]: With dead ends: 881 [2025-04-13 22:37:52,430 INFO L226 Difference]: Without dead ends: 803 [2025-04-13 22:37:52,431 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:37:52,431 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 184 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:52,431 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 58 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:37:52,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-04-13 22:37:52,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 722. [2025-04-13 22:37:52,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 721 states have (on average 2.7156726768377255) internal successors, (1958), 721 states have internal predecessors, (1958), 0 states have call successors, (0), 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:37:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1958 transitions. [2025-04-13 22:37:52,441 INFO L79 Accepts]: Start accepts. Automaton has 722 states and 1958 transitions. Word has length 56 [2025-04-13 22:37:52,442 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:52,442 INFO L485 AbstractCegarLoop]: Abstraction has 722 states and 1958 transitions. [2025-04-13 22:37:52,442 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:52,442 INFO L278 IsEmpty]: Start isEmpty. Operand 722 states and 1958 transitions. [2025-04-13 22:37:52,442 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:52,442 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:52,442 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:52,442 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable320 [2025-04-13 22:37:52,442 INFO L403 AbstractCegarLoop]: === Iteration 322 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:52,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:52,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1828568718, now seen corresponding path program 321 times [2025-04-13 22:37:52,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:52,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017436614] [2025-04-13 22:37:52,443 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:37:52,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:52,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:52,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:52,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:37:52,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:52,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:52,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:52,541 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017436614] [2025-04-13 22:37:52,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017436614] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:52,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:52,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:52,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970365328] [2025-04-13 22:37:52,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:52,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:52,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:52,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:52,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:52,542 INFO L87 Difference]: Start difference. First operand 722 states and 1958 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:52,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:52,925 INFO L93 Difference]: Finished difference Result 888 states and 2417 transitions. [2025-04-13 22:37:52,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:37:52,925 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:52,925 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:52,942 INFO L225 Difference]: With dead ends: 888 [2025-04-13 22:37:52,942 INFO L226 Difference]: Without dead ends: 836 [2025-04-13 22:37:52,942 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:37:52,942 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 161 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:52,942 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 68 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:52,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2025-04-13 22:37:52,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 718. [2025-04-13 22:37:52,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 2.7140864714086472) internal successors, (1946), 717 states have internal predecessors, (1946), 0 states have call successors, (0), 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:37:52,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1946 transitions. [2025-04-13 22:37:52,957 INFO L79 Accepts]: Start accepts. Automaton has 718 states and 1946 transitions. Word has length 56 [2025-04-13 22:37:52,957 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:52,957 INFO L485 AbstractCegarLoop]: Abstraction has 718 states and 1946 transitions. [2025-04-13 22:37:52,957 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:52,958 INFO L278 IsEmpty]: Start isEmpty. Operand 718 states and 1946 transitions. [2025-04-13 22:37:52,958 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:52,958 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:52,958 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:52,958 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable321 [2025-04-13 22:37:52,958 INFO L403 AbstractCegarLoop]: === Iteration 323 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:52,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:52,959 INFO L85 PathProgramCache]: Analyzing trace with hash 100563048, now seen corresponding path program 322 times [2025-04-13 22:37:52,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:52,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166350080] [2025-04-13 22:37:52,959 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:37:52,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:52,964 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:52,966 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:37:52,966 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:37:52,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:53,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:53,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:53,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166350080] [2025-04-13 22:37:53,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166350080] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:53,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:53,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:53,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198782383] [2025-04-13 22:37:53,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:53,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:53,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:53,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:53,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:53,036 INFO L87 Difference]: Start difference. First operand 718 states and 1946 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:53,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:53,386 INFO L93 Difference]: Finished difference Result 885 states and 2403 transitions. [2025-04-13 22:37:53,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:37:53,387 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:53,387 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:53,395 INFO L225 Difference]: With dead ends: 885 [2025-04-13 22:37:53,395 INFO L226 Difference]: Without dead ends: 826 [2025-04-13 22:37:53,396 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:37:53,396 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 160 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:53,396 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 58 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:37:53,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2025-04-13 22:37:53,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 722. [2025-04-13 22:37:53,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 721 states have (on average 2.710124826629681) internal successors, (1954), 721 states have internal predecessors, (1954), 0 states have call successors, (0), 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:37:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1954 transitions. [2025-04-13 22:37:53,407 INFO L79 Accepts]: Start accepts. Automaton has 722 states and 1954 transitions. Word has length 56 [2025-04-13 22:37:53,407 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:53,407 INFO L485 AbstractCegarLoop]: Abstraction has 722 states and 1954 transitions. [2025-04-13 22:37:53,407 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:53,407 INFO L278 IsEmpty]: Start isEmpty. Operand 722 states and 1954 transitions. [2025-04-13 22:37:53,408 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:53,408 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:53,408 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:53,408 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable322 [2025-04-13 22:37:53,408 INFO L403 AbstractCegarLoop]: === Iteration 324 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:53,408 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:53,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2122850424, now seen corresponding path program 323 times [2025-04-13 22:37:53,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:53,408 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673513023] [2025-04-13 22:37:53,408 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:37:53,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:53,413 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:53,419 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:53,419 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:37:53,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:54,152 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:37:54,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:54,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673513023] [2025-04-13 22:37:54,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673513023] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:54,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057249558] [2025-04-13 22:37:54,152 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:37:54,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:54,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:54,154 INFO L229 MonitoredProcess]: Starting monitored process 108 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:37:54,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2025-04-13 22:37:54,286 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:54,303 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:54,303 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:37:54,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:54,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:37:54,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:54,485 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:37:54,486 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:37:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:37:54,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:37:54,687 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:37:54,687 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:37:54,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:54,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057249558] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:54,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:37:54,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 33 [2025-04-13 22:37:54,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024665911] [2025-04-13 22:37:54,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:54,709 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:54,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:54,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:54,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1039, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:37:54,709 INFO L87 Difference]: Start difference. First operand 722 states and 1954 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:55,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:55,384 INFO L93 Difference]: Finished difference Result 869 states and 2358 transitions. [2025-04-13 22:37:55,384 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:37:55,384 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:55,384 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:55,393 INFO L225 Difference]: With dead ends: 869 [2025-04-13 22:37:55,393 INFO L226 Difference]: Without dead ends: 805 [2025-04-13 22:37:55,394 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=227, Invalid=2743, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 22:37:55,394 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 186 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:55,394 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 70 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:55,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-04-13 22:37:55,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 714. [2025-04-13 22:37:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 713 states have (on average 2.7124824684431976) internal successors, (1934), 713 states have internal predecessors, (1934), 0 states have call successors, (0), 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:37:55,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1934 transitions. [2025-04-13 22:37:55,405 INFO L79 Accepts]: Start accepts. Automaton has 714 states and 1934 transitions. Word has length 56 [2025-04-13 22:37:55,405 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:55,405 INFO L485 AbstractCegarLoop]: Abstraction has 714 states and 1934 transitions. [2025-04-13 22:37:55,405 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:55,405 INFO L278 IsEmpty]: Start isEmpty. Operand 714 states and 1934 transitions. [2025-04-13 22:37:55,406 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:55,406 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:55,406 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:55,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Ended with exit code 0 [2025-04-13 22:37:55,606 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 108 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable323 [2025-04-13 22:37:55,606 INFO L403 AbstractCegarLoop]: === Iteration 325 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:55,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:55,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1321322038, now seen corresponding path program 324 times [2025-04-13 22:37:55,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:55,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086170848] [2025-04-13 22:37:55,607 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:37:55,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:55,612 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:55,615 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:55,615 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:37:55,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:55,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:55,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:55,702 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086170848] [2025-04-13 22:37:55,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086170848] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:55,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:55,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:55,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131866972] [2025-04-13 22:37:55,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:55,702 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:55,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:55,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:55,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:55,702 INFO L87 Difference]: Start difference. First operand 714 states and 1934 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:56,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:56,040 INFO L93 Difference]: Finished difference Result 843 states and 2285 transitions. [2025-04-13 22:37:56,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:37:56,040 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:56,040 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:56,049 INFO L225 Difference]: With dead ends: 843 [2025-04-13 22:37:56,049 INFO L226 Difference]: Without dead ends: 787 [2025-04-13 22:37:56,050 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=733, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:37:56,050 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 124 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:56,050 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 58 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:37:56,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2025-04-13 22:37:56,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 706. [2025-04-13 22:37:56,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 705 states have (on average 2.7148936170212767) internal successors, (1914), 705 states have internal predecessors, (1914), 0 states have call successors, (0), 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:37:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1914 transitions. [2025-04-13 22:37:56,061 INFO L79 Accepts]: Start accepts. Automaton has 706 states and 1914 transitions. Word has length 56 [2025-04-13 22:37:56,061 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:56,061 INFO L485 AbstractCegarLoop]: Abstraction has 706 states and 1914 transitions. [2025-04-13 22:37:56,061 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:56,061 INFO L278 IsEmpty]: Start isEmpty. Operand 706 states and 1914 transitions. [2025-04-13 22:37:56,062 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:56,062 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:56,062 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:56,062 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable324 [2025-04-13 22:37:56,062 INFO L403 AbstractCegarLoop]: === Iteration 326 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:56,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:56,062 INFO L85 PathProgramCache]: Analyzing trace with hash -773074246, now seen corresponding path program 325 times [2025-04-13 22:37:56,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:56,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653076096] [2025-04-13 22:37:56,062 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:37:56,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:56,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:37:56,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:56,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:56,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:56,907 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:37:56,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:56,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653076096] [2025-04-13 22:37:56,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653076096] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:56,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582617067] [2025-04-13 22:37:56,908 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:37:56,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:56,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:56,910 INFO L229 MonitoredProcess]: Starting monitored process 109 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:37:56,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2025-04-13 22:37:57,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:37:57,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:57,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:57,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:57,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:37:57,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:57,214 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:37:57,215 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:37:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:37:57,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:37:57,392 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:37:57,393 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:37:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:57,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582617067] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:57,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:37:57,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 31 [2025-04-13 22:37:57,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134942793] [2025-04-13 22:37:57,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:57,415 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:37:57,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:57,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:37:57,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:37:57,415 INFO L87 Difference]: Start difference. First operand 706 states and 1914 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:58,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:58,095 INFO L93 Difference]: Finished difference Result 935 states and 2522 transitions. [2025-04-13 22:37:58,095 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:37:58,095 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:58,095 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:58,104 INFO L225 Difference]: With dead ends: 935 [2025-04-13 22:37:58,104 INFO L226 Difference]: Without dead ends: 876 [2025-04-13 22:37:58,104 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=231, Invalid=2525, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:37:58,104 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 262 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:58,104 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 75 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:58,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2025-04-13 22:37:58,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 758. [2025-04-13 22:37:58,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 757 states have (on average 2.678996036988111) internal successors, (2028), 757 states have internal predecessors, (2028), 0 states have call successors, (0), 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:37:58,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 2028 transitions. [2025-04-13 22:37:58,117 INFO L79 Accepts]: Start accepts. Automaton has 758 states and 2028 transitions. Word has length 56 [2025-04-13 22:37:58,117 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:58,117 INFO L485 AbstractCegarLoop]: Abstraction has 758 states and 2028 transitions. [2025-04-13 22:37:58,117 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:58,117 INFO L278 IsEmpty]: Start isEmpty. Operand 758 states and 2028 transitions. [2025-04-13 22:37:58,118 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:58,118 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:58,118 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:58,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Forceful destruction successful, exit code 0 [2025-04-13 22:37:58,318 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable325,109 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:58,318 INFO L403 AbstractCegarLoop]: === Iteration 327 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:58,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:58,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1085754572, now seen corresponding path program 326 times [2025-04-13 22:37:58,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:58,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735064970] [2025-04-13 22:37:58,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:37:58,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:58,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:58,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:58,327 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:37:58,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:58,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:58,414 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735064970] [2025-04-13 22:37:58,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735064970] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:58,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:58,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:58,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650743089] [2025-04-13 22:37:58,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:58,414 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:58,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:58,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:58,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:58,415 INFO L87 Difference]: Start difference. First operand 758 states and 2028 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:58,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:58,771 INFO L93 Difference]: Finished difference Result 933 states and 2509 transitions. [2025-04-13 22:37:58,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:37:58,771 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:58,771 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:58,779 INFO L225 Difference]: With dead ends: 933 [2025-04-13 22:37:58,779 INFO L226 Difference]: Without dead ends: 874 [2025-04-13 22:37:58,780 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:37:58,780 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 171 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:58,780 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 58 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:37:58,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-04-13 22:37:58,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 758. [2025-04-13 22:37:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 757 states have (on average 2.678996036988111) internal successors, (2028), 757 states have internal predecessors, (2028), 0 states have call successors, (0), 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:37:58,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 2028 transitions. [2025-04-13 22:37:58,791 INFO L79 Accepts]: Start accepts. Automaton has 758 states and 2028 transitions. Word has length 56 [2025-04-13 22:37:58,791 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:58,791 INFO L485 AbstractCegarLoop]: Abstraction has 758 states and 2028 transitions. [2025-04-13 22:37:58,791 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:58,791 INFO L278 IsEmpty]: Start isEmpty. Operand 758 states and 2028 transitions. [2025-04-13 22:37:58,792 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:58,792 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:58,792 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:58,792 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable326 [2025-04-13 22:37:58,792 INFO L403 AbstractCegarLoop]: === Iteration 328 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:58,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:58,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1265862920, now seen corresponding path program 327 times [2025-04-13 22:37:58,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:58,792 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297311411] [2025-04-13 22:37:58,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:37:58,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:58,797 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:58,801 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:37:58,801 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:37:58,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:58,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:58,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:58,892 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297311411] [2025-04-13 22:37:58,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297311411] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:58,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:58,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:58,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163608768] [2025-04-13 22:37:58,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:58,892 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:58,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:58,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:58,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:58,893 INFO L87 Difference]: Start difference. First operand 758 states and 2028 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:59,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:59,282 INFO L93 Difference]: Finished difference Result 932 states and 2507 transitions. [2025-04-13 22:37:59,282 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:37:59,282 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:59,282 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:59,290 INFO L225 Difference]: With dead ends: 932 [2025-04-13 22:37:59,290 INFO L226 Difference]: Without dead ends: 880 [2025-04-13 22:37:59,290 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=776, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:37:59,291 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 180 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:59,291 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 74 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:59,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-04-13 22:37:59,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 762. [2025-04-13 22:37:59,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 761 states have (on average 2.675427069645204) internal successors, (2036), 761 states have internal predecessors, (2036), 0 states have call successors, (0), 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:37:59,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 2036 transitions. [2025-04-13 22:37:59,302 INFO L79 Accepts]: Start accepts. Automaton has 762 states and 2036 transitions. Word has length 56 [2025-04-13 22:37:59,302 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:59,302 INFO L485 AbstractCegarLoop]: Abstraction has 762 states and 2036 transitions. [2025-04-13 22:37:59,302 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:59,303 INFO L278 IsEmpty]: Start isEmpty. Operand 762 states and 2036 transitions. [2025-04-13 22:37:59,310 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:59,310 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:59,310 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:59,310 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable327 [2025-04-13 22:37:59,310 INFO L403 AbstractCegarLoop]: === Iteration 329 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:59,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:59,311 INFO L85 PathProgramCache]: Analyzing trace with hash -336130514, now seen corresponding path program 328 times [2025-04-13 22:37:59,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:59,311 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255142460] [2025-04-13 22:37:59,311 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:37:59,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:59,316 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:59,318 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:37:59,318 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:37:59,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:59,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:37:59,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:59,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255142460] [2025-04-13 22:37:59,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255142460] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:59,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:59,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:37:59,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744517088] [2025-04-13 22:37:59,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:59,390 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:37:59,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:59,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:37:59,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:59,390 INFO L87 Difference]: Start difference. First operand 762 states and 2036 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:59,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:59,739 INFO L93 Difference]: Finished difference Result 918 states and 2462 transitions. [2025-04-13 22:37:59,739 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:37:59,739 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:37:59,739 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:59,747 INFO L225 Difference]: With dead ends: 918 [2025-04-13 22:37:59,747 INFO L226 Difference]: Without dead ends: 866 [2025-04-13 22:37:59,748 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:37:59,748 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 135 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:59,748 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 58 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:37:59,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2025-04-13 22:37:59,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 754. [2025-04-13 22:37:59,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 2.6772908366533863) internal successors, (2016), 753 states have internal predecessors, (2016), 0 states have call successors, (0), 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:37:59,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 2016 transitions. [2025-04-13 22:37:59,759 INFO L79 Accepts]: Start accepts. Automaton has 754 states and 2016 transitions. Word has length 56 [2025-04-13 22:37:59,759 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:59,759 INFO L485 AbstractCegarLoop]: Abstraction has 754 states and 2016 transitions. [2025-04-13 22:37:59,759 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:37:59,759 INFO L278 IsEmpty]: Start isEmpty. Operand 754 states and 2016 transitions. [2025-04-13 22:37:59,760 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:37:59,760 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:59,760 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:59,760 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable328 [2025-04-13 22:37:59,760 INFO L403 AbstractCegarLoop]: === Iteration 330 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:37:59,760 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:59,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1609411074, now seen corresponding path program 329 times [2025-04-13 22:37:59,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:59,760 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084345860] [2025-04-13 22:37:59,760 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:37:59,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:59,765 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:37:59,772 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:37:59,772 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:37:59,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:00,522 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:38:00,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:00,523 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084345860] [2025-04-13 22:38:00,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084345860] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:00,523 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124014677] [2025-04-13 22:38:00,523 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:38:00,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:38:00,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:38:00,525 INFO L229 MonitoredProcess]: Starting monitored process 110 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:38:00,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2025-04-13 22:38:00,654 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:00,671 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:00,671 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:38:00,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:00,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:38:00,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:38:00,856 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:38:00,856 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:38:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:38:00,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:38:01,054 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:38:01,054 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:38:01,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:01,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124014677] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:01,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:38:01,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 33 [2025-04-13 22:38:01,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499472384] [2025-04-13 22:38:01,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:01,076 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:01,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:01,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:01,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1038, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:38:01,076 INFO L87 Difference]: Start difference. First operand 754 states and 2016 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:01,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:01,725 INFO L93 Difference]: Finished difference Result 905 states and 2428 transitions. [2025-04-13 22:38:01,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:38:01,726 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:01,726 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:01,734 INFO L225 Difference]: With dead ends: 905 [2025-04-13 22:38:01,734 INFO L226 Difference]: Without dead ends: 757 [2025-04-13 22:38:01,735 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=216, Invalid=2540, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:38:01,735 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 218 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:01,735 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 74 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:01,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2025-04-13 22:38:01,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 666. [2025-04-13 22:38:01,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 665 states have (on average 2.6736842105263157) internal successors, (1778), 665 states have internal predecessors, (1778), 0 states have call successors, (0), 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:38:01,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1778 transitions. [2025-04-13 22:38:01,745 INFO L79 Accepts]: Start accepts. Automaton has 666 states and 1778 transitions. Word has length 56 [2025-04-13 22:38:01,745 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:01,745 INFO L485 AbstractCegarLoop]: Abstraction has 666 states and 1778 transitions. [2025-04-13 22:38:01,745 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:01,745 INFO L278 IsEmpty]: Start isEmpty. Operand 666 states and 1778 transitions. [2025-04-13 22:38:01,746 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:01,746 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:01,746 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:01,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Ended with exit code 0 [2025-04-13 22:38:01,946 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable329 [2025-04-13 22:38:01,946 INFO L403 AbstractCegarLoop]: === Iteration 331 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:01,947 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:01,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1898778600, now seen corresponding path program 330 times [2025-04-13 22:38:01,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:01,947 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056952673] [2025-04-13 22:38:01,947 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:38:01,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:01,952 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:01,955 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:38:01,955 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:38:01,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:02,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:02,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:02,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056952673] [2025-04-13 22:38:02,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056952673] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:02,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:02,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:38:02,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365395118] [2025-04-13 22:38:02,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:02,043 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:38:02,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:02,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:38:02,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:38:02,043 INFO L87 Difference]: Start difference. First operand 666 states and 1778 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:02,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:02,394 INFO L93 Difference]: Finished difference Result 803 states and 2149 transitions. [2025-04-13 22:38:02,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:38:02,394 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:02,394 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:02,403 INFO L225 Difference]: With dead ends: 803 [2025-04-13 22:38:02,403 INFO L226 Difference]: Without dead ends: 739 [2025-04-13 22:38:02,403 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:38:02,404 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 137 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:02,404 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 58 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:38:02,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-04-13 22:38:02,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 658. [2025-04-13 22:38:02,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 657 states have (on average 2.675799086757991) internal successors, (1758), 657 states have internal predecessors, (1758), 0 states have call successors, (0), 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:38:02,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1758 transitions. [2025-04-13 22:38:02,414 INFO L79 Accepts]: Start accepts. Automaton has 658 states and 1758 transitions. Word has length 56 [2025-04-13 22:38:02,414 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:02,414 INFO L485 AbstractCegarLoop]: Abstraction has 658 states and 1758 transitions. [2025-04-13 22:38:02,414 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:02,415 INFO L278 IsEmpty]: Start isEmpty. Operand 658 states and 1758 transitions. [2025-04-13 22:38:02,415 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:02,415 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:02,415 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:02,415 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable330 [2025-04-13 22:38:02,415 INFO L403 AbstractCegarLoop]: === Iteration 332 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:02,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:02,415 INFO L85 PathProgramCache]: Analyzing trace with hash 227446930, now seen corresponding path program 331 times [2025-04-13 22:38:02,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:02,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713285099] [2025-04-13 22:38:02,416 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:38:02,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:02,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:38:02,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:02,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:38:02,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:03,420 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:38:03,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:03,420 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713285099] [2025-04-13 22:38:03,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713285099] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:03,420 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852545266] [2025-04-13 22:38:03,420 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:38:03,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:38:03,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:38:03,422 INFO L229 MonitoredProcess]: Starting monitored process 111 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:38:03,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2025-04-13 22:38:03,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:38:03,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:03,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:38:03,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:03,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:38:03,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:38:03,765 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:38:03,765 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:38:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:38:03,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:38:03,989 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:38:03,990 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:38:04,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:04,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852545266] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:04,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:38:04,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 33 [2025-04-13 22:38:04,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632591460] [2025-04-13 22:38:04,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:04,014 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:04,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:04,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:04,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1046, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:38:04,014 INFO L87 Difference]: Start difference. First operand 658 states and 1758 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:04,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:04,707 INFO L93 Difference]: Finished difference Result 897 states and 2443 transitions. [2025-04-13 22:38:04,707 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:38:04,707 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:04,708 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:04,716 INFO L225 Difference]: With dead ends: 897 [2025-04-13 22:38:04,716 INFO L226 Difference]: Without dead ends: 838 [2025-04-13 22:38:04,717 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=194, Invalid=2562, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:38:04,717 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 213 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:04,717 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 87 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:04,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-04-13 22:38:04,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 666. [2025-04-13 22:38:04,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 665 states have (on average 2.6736842105263157) internal successors, (1778), 665 states have internal predecessors, (1778), 0 states have call successors, (0), 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:38:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1778 transitions. [2025-04-13 22:38:04,728 INFO L79 Accepts]: Start accepts. Automaton has 666 states and 1778 transitions. Word has length 56 [2025-04-13 22:38:04,728 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:04,728 INFO L485 AbstractCegarLoop]: Abstraction has 666 states and 1778 transitions. [2025-04-13 22:38:04,728 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:04,728 INFO L278 IsEmpty]: Start isEmpty. Operand 666 states and 1778 transitions. [2025-04-13 22:38:04,729 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:04,729 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:04,729 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:04,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Ended with exit code 0 [2025-04-13 22:38:04,929 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 111 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable331 [2025-04-13 22:38:04,929 INFO L403 AbstractCegarLoop]: === Iteration 333 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:04,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:04,929 INFO L85 PathProgramCache]: Analyzing trace with hash -800206298, now seen corresponding path program 332 times [2025-04-13 22:38:04,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:04,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260051855] [2025-04-13 22:38:04,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:38:04,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:04,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:04,938 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:38:04,938 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:38:04,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:05,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:05,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:05,027 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260051855] [2025-04-13 22:38:05,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260051855] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:05,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:05,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:38:05,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487535869] [2025-04-13 22:38:05,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:05,027 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:38:05,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:05,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:38:05,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:38:05,027 INFO L87 Difference]: Start difference. First operand 666 states and 1778 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:05,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:05,389 INFO L93 Difference]: Finished difference Result 910 states and 2484 transitions. [2025-04-13 22:38:05,389 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:38:05,389 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:05,389 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:05,398 INFO L225 Difference]: With dead ends: 910 [2025-04-13 22:38:05,398 INFO L226 Difference]: Without dead ends: 851 [2025-04-13 22:38:05,398 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:38:05,398 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 153 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:05,399 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 65 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:05,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-04-13 22:38:05,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 710. [2025-04-13 22:38:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 709 states have (on average 2.702397743300423) internal successors, (1916), 709 states have internal predecessors, (1916), 0 states have call successors, (0), 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:38:05,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1916 transitions. [2025-04-13 22:38:05,411 INFO L79 Accepts]: Start accepts. Automaton has 710 states and 1916 transitions. Word has length 56 [2025-04-13 22:38:05,411 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:05,411 INFO L485 AbstractCegarLoop]: Abstraction has 710 states and 1916 transitions. [2025-04-13 22:38:05,411 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:05,411 INFO L278 IsEmpty]: Start isEmpty. Operand 710 states and 1916 transitions. [2025-04-13 22:38:05,412 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:05,412 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:05,412 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:05,412 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable332 [2025-04-13 22:38:05,412 INFO L403 AbstractCegarLoop]: === Iteration 334 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:05,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:05,412 INFO L85 PathProgramCache]: Analyzing trace with hash -265341744, now seen corresponding path program 333 times [2025-04-13 22:38:05,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:05,412 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002197681] [2025-04-13 22:38:05,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:38:05,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:05,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:05,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:38:05,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:38:05,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:05,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:05,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002197681] [2025-04-13 22:38:05,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002197681] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:05,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:05,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:38:05,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566341006] [2025-04-13 22:38:05,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:05,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:05,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:05,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:05,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:38:05,541 INFO L87 Difference]: Start difference. First operand 710 states and 1916 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:05,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:05,981 INFO L93 Difference]: Finished difference Result 938 states and 2566 transitions. [2025-04-13 22:38:05,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:38:05,982 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:05,982 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:05,990 INFO L225 Difference]: With dead ends: 938 [2025-04-13 22:38:05,990 INFO L226 Difference]: Without dead ends: 886 [2025-04-13 22:38:05,990 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:38:05,991 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 192 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:05,991 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 89 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:05,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-04-13 22:38:05,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 714. [2025-04-13 22:38:05,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 713 states have (on average 2.6984572230014026) internal successors, (1924), 713 states have internal predecessors, (1924), 0 states have call successors, (0), 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:38:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1924 transitions. [2025-04-13 22:38:06,002 INFO L79 Accepts]: Start accepts. Automaton has 714 states and 1924 transitions. Word has length 56 [2025-04-13 22:38:06,002 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:06,002 INFO L485 AbstractCegarLoop]: Abstraction has 714 states and 1924 transitions. [2025-04-13 22:38:06,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:06,002 INFO L278 IsEmpty]: Start isEmpty. Operand 714 states and 1924 transitions. [2025-04-13 22:38:06,003 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:06,003 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:06,003 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:06,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable333 [2025-04-13 22:38:06,003 INFO L403 AbstractCegarLoop]: === Iteration 335 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:06,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:06,003 INFO L85 PathProgramCache]: Analyzing trace with hash 2072875912, now seen corresponding path program 334 times [2025-04-13 22:38:06,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:06,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584780634] [2025-04-13 22:38:06,003 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:38:06,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:06,008 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:06,011 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:38:06,011 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:38:06,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:06,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:06,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:06,081 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584780634] [2025-04-13 22:38:06,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584780634] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:06,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:06,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:38:06,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010670789] [2025-04-13 22:38:06,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:06,082 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:38:06,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:06,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:38:06,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:38:06,082 INFO L87 Difference]: Start difference. First operand 714 states and 1924 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:06,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:06,439 INFO L93 Difference]: Finished difference Result 895 states and 2437 transitions. [2025-04-13 22:38:06,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:38:06,440 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:06,440 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:06,448 INFO L225 Difference]: With dead ends: 895 [2025-04-13 22:38:06,448 INFO L226 Difference]: Without dead ends: 843 [2025-04-13 22:38:06,448 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:38:06,448 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 161 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:06,449 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 65 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:06,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2025-04-13 22:38:06,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 706. [2025-04-13 22:38:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 705 states have (on average 2.700709219858156) internal successors, (1904), 705 states have internal predecessors, (1904), 0 states have call successors, (0), 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:38:06,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1904 transitions. [2025-04-13 22:38:06,460 INFO L79 Accepts]: Start accepts. Automaton has 706 states and 1904 transitions. Word has length 56 [2025-04-13 22:38:06,460 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:06,460 INFO L485 AbstractCegarLoop]: Abstraction has 706 states and 1904 transitions. [2025-04-13 22:38:06,460 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:06,460 INFO L278 IsEmpty]: Start isEmpty. Operand 706 states and 1904 transitions. [2025-04-13 22:38:06,460 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:06,460 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:06,460 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:06,460 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable334 [2025-04-13 22:38:06,460 INFO L403 AbstractCegarLoop]: === Iteration 336 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:06,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:06,461 INFO L85 PathProgramCache]: Analyzing trace with hash -608889898, now seen corresponding path program 335 times [2025-04-13 22:38:06,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:06,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074958666] [2025-04-13 22:38:06,461 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:38:06,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:06,466 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:06,472 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:06,472 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:38:06,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:07,041 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:38:07,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:07,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074958666] [2025-04-13 22:38:07,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074958666] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:07,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128383573] [2025-04-13 22:38:07,042 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:38:07,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:38:07,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:38:07,043 INFO L229 MonitoredProcess]: Starting monitored process 112 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:38:07,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2025-04-13 22:38:07,175 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:07,192 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:07,192 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:38:07,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:07,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:38:07,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:38:07,388 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:38:07,389 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:38:07,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:38:07,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:38:07,589 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:38:07,589 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:38:07,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:07,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128383573] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:07,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:38:07,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 33 [2025-04-13 22:38:07,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474450567] [2025-04-13 22:38:07,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:07,611 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:07,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:07,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:07,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:38:07,611 INFO L87 Difference]: Start difference. First operand 706 states and 1904 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:08,276 INFO L93 Difference]: Finished difference Result 938 states and 2562 transitions. [2025-04-13 22:38:08,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:38:08,276 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:08,276 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:08,285 INFO L225 Difference]: With dead ends: 938 [2025-04-13 22:38:08,285 INFO L226 Difference]: Without dead ends: 834 [2025-04-13 22:38:08,285 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=193, Invalid=2459, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:38:08,285 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 185 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:08,285 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 86 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:08,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2025-04-13 22:38:08,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 662. [2025-04-13 22:38:08,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 2.723146747352496) internal successors, (1800), 661 states have internal predecessors, (1800), 0 states have call successors, (0), 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:38:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1800 transitions. [2025-04-13 22:38:08,296 INFO L79 Accepts]: Start accepts. Automaton has 662 states and 1800 transitions. Word has length 56 [2025-04-13 22:38:08,296 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:08,296 INFO L485 AbstractCegarLoop]: Abstraction has 662 states and 1800 transitions. [2025-04-13 22:38:08,297 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:08,297 INFO L278 IsEmpty]: Start isEmpty. Operand 662 states and 1800 transitions. [2025-04-13 22:38:08,297 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:08,297 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:08,297 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:08,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Ended with exit code 0 [2025-04-13 22:38:08,497 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable335 [2025-04-13 22:38:08,498 INFO L403 AbstractCegarLoop]: === Iteration 337 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:08,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:08,498 INFO L85 PathProgramCache]: Analyzing trace with hash 12817730, now seen corresponding path program 336 times [2025-04-13 22:38:08,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:08,498 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99713890] [2025-04-13 22:38:08,498 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:38:08,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:08,503 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:08,506 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:38:08,507 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:38:08,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:08,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:08,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:08,596 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99713890] [2025-04-13 22:38:08,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99713890] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:08,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:08,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:38:08,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084148384] [2025-04-13 22:38:08,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:08,596 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:38:08,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:08,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:38:08,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:38:08,596 INFO L87 Difference]: Start difference. First operand 662 states and 1800 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:08,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:08,957 INFO L93 Difference]: Finished difference Result 851 states and 2333 transitions. [2025-04-13 22:38:08,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:38:08,957 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:08,957 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:08,965 INFO L225 Difference]: With dead ends: 851 [2025-04-13 22:38:08,965 INFO L226 Difference]: Without dead ends: 791 [2025-04-13 22:38:08,966 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:38:08,966 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 167 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:08,966 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 69 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:08,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2025-04-13 22:38:08,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 658. [2025-04-13 22:38:08,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 657 states have (on average 2.721461187214612) internal successors, (1788), 657 states have internal predecessors, (1788), 0 states have call successors, (0), 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:38:08,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1788 transitions. [2025-04-13 22:38:08,977 INFO L79 Accepts]: Start accepts. Automaton has 658 states and 1788 transitions. Word has length 56 [2025-04-13 22:38:08,977 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:08,977 INFO L485 AbstractCegarLoop]: Abstraction has 658 states and 1788 transitions. [2025-04-13 22:38:08,977 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:08,977 INFO L278 IsEmpty]: Start isEmpty. Operand 658 states and 1788 transitions. [2025-04-13 22:38:08,978 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:08,978 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:08,978 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:08,978 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable336 [2025-04-13 22:38:08,978 INFO L403 AbstractCegarLoop]: === Iteration 338 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:08,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:08,978 INFO L85 PathProgramCache]: Analyzing trace with hash -179148808, now seen corresponding path program 337 times [2025-04-13 22:38:08,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:08,978 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809616687] [2025-04-13 22:38:08,978 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:38:08,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:08,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:38:08,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:08,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:38:08,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:09,731 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:38:09,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:09,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809616687] [2025-04-13 22:38:09,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809616687] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:09,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291756857] [2025-04-13 22:38:09,731 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:38:09,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:38:09,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:38:09,733 INFO L229 MonitoredProcess]: Starting monitored process 113 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:38:09,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2025-04-13 22:38:09,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:38:09,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:09,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:38:09,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:09,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:38:09,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:38:10,101 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:38:10,102 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:38:10,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:38:10,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:38:10,311 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:38:10,312 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:38:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:10,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291756857] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:10,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:38:10,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 33 [2025-04-13 22:38:10,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662957262] [2025-04-13 22:38:10,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:10,334 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:10,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:10,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:10,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1039, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:38:10,334 INFO L87 Difference]: Start difference. First operand 658 states and 1788 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:10,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:10,907 INFO L93 Difference]: Finished difference Result 913 states and 2480 transitions. [2025-04-13 22:38:10,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:38:10,907 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:10,907 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:10,915 INFO L225 Difference]: With dead ends: 913 [2025-04-13 22:38:10,915 INFO L226 Difference]: Without dead ends: 729 [2025-04-13 22:38:10,915 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=2011, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 22:38:10,915 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 144 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:10,915 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 94 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:10,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-04-13 22:38:10,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 638. [2025-04-13 22:38:10,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 637 states have (on average 2.718995290423862) internal successors, (1732), 637 states have internal predecessors, (1732), 0 states have call successors, (0), 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:38:10,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1732 transitions. [2025-04-13 22:38:10,926 INFO L79 Accepts]: Start accepts. Automaton has 638 states and 1732 transitions. Word has length 56 [2025-04-13 22:38:10,926 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:10,926 INFO L485 AbstractCegarLoop]: Abstraction has 638 states and 1732 transitions. [2025-04-13 22:38:10,926 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:10,926 INFO L278 IsEmpty]: Start isEmpty. Operand 638 states and 1732 transitions. [2025-04-13 22:38:10,927 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:10,927 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:10,927 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:10,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Ended with exit code 0 [2025-04-13 22:38:11,127 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable337 [2025-04-13 22:38:11,127 INFO L403 AbstractCegarLoop]: === Iteration 339 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:11,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:11,127 INFO L85 PathProgramCache]: Analyzing trace with hash 153037802, now seen corresponding path program 338 times [2025-04-13 22:38:11,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:11,128 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578716950] [2025-04-13 22:38:11,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:38:11,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:11,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:11,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:38:11,136 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:38:11,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:11,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:11,227 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578716950] [2025-04-13 22:38:11,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578716950] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:11,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:11,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:38:11,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356462075] [2025-04-13 22:38:11,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:11,227 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:38:11,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:11,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:38:11,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:38:11,227 INFO L87 Difference]: Start difference. First operand 638 states and 1732 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:11,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:11,606 INFO L93 Difference]: Finished difference Result 864 states and 2350 transitions. [2025-04-13 22:38:11,606 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:38:11,606 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:11,607 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:11,616 INFO L225 Difference]: With dead ends: 864 [2025-04-13 22:38:11,616 INFO L226 Difference]: Without dead ends: 632 [2025-04-13 22:38:11,616 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:38:11,616 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 210 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:11,616 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 83 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:11,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-04-13 22:38:11,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 550. [2025-04-13 22:38:11,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 2.6484517304189437) internal successors, (1454), 549 states have internal predecessors, (1454), 0 states have call successors, (0), 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:38:11,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1454 transitions. [2025-04-13 22:38:11,626 INFO L79 Accepts]: Start accepts. Automaton has 550 states and 1454 transitions. Word has length 56 [2025-04-13 22:38:11,626 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:11,626 INFO L485 AbstractCegarLoop]: Abstraction has 550 states and 1454 transitions. [2025-04-13 22:38:11,626 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:11,626 INFO L278 IsEmpty]: Start isEmpty. Operand 550 states and 1454 transitions. [2025-04-13 22:38:11,627 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:11,627 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:11,627 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:11,627 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable338 [2025-04-13 22:38:11,627 INFO L403 AbstractCegarLoop]: === Iteration 340 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:11,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:11,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1295650304, now seen corresponding path program 339 times [2025-04-13 22:38:11,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:11,627 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122711350] [2025-04-13 22:38:11,627 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:38:11,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:11,632 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:11,637 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:38:11,637 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:38:11,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:11,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:11,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122711350] [2025-04-13 22:38:11,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122711350] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:11,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:11,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:38:11,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393525228] [2025-04-13 22:38:11,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:11,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:11,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:11,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:11,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:38:11,741 INFO L87 Difference]: Start difference. First operand 550 states and 1454 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:12,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:12,189 INFO L93 Difference]: Finished difference Result 772 states and 2097 transitions. [2025-04-13 22:38:12,190 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:38:12,190 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:12,190 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:12,198 INFO L225 Difference]: With dead ends: 772 [2025-04-13 22:38:12,198 INFO L226 Difference]: Without dead ends: 713 [2025-04-13 22:38:12,198 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:38:12,198 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 232 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:12,198 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 85 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:12,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-04-13 22:38:12,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 622. [2025-04-13 22:38:12,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 621 states have (on average 2.7020933977455717) internal successors, (1678), 621 states have internal predecessors, (1678), 0 states have call successors, (0), 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:38:12,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1678 transitions. [2025-04-13 22:38:12,209 INFO L79 Accepts]: Start accepts. Automaton has 622 states and 1678 transitions. Word has length 56 [2025-04-13 22:38:12,209 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:12,209 INFO L485 AbstractCegarLoop]: Abstraction has 622 states and 1678 transitions. [2025-04-13 22:38:12,209 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:12,209 INFO L278 IsEmpty]: Start isEmpty. Operand 622 states and 1678 transitions. [2025-04-13 22:38:12,209 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:12,210 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:12,210 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:12,210 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable339 [2025-04-13 22:38:12,210 INFO L403 AbstractCegarLoop]: === Iteration 341 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:12,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:12,210 INFO L85 PathProgramCache]: Analyzing trace with hash -749298322, now seen corresponding path program 340 times [2025-04-13 22:38:12,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:12,210 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449248857] [2025-04-13 22:38:12,210 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:38:12,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:12,215 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:12,217 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:38:12,217 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:38:12,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:12,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:12,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449248857] [2025-04-13 22:38:12,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449248857] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:12,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:12,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:38:12,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516581794] [2025-04-13 22:38:12,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:12,289 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:12,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:12,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:12,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:38:12,289 INFO L87 Difference]: Start difference. First operand 622 states and 1678 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:12,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:12,675 INFO L93 Difference]: Finished difference Result 824 states and 2255 transitions. [2025-04-13 22:38:12,676 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:38:12,676 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:12,676 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:12,685 INFO L225 Difference]: With dead ends: 824 [2025-04-13 22:38:12,685 INFO L226 Difference]: Without dead ends: 765 [2025-04-13 22:38:12,685 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:38:12,685 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 157 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:12,685 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 75 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:12,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2025-04-13 22:38:12,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 622. [2025-04-13 22:38:12,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 621 states have (on average 2.7020933977455717) internal successors, (1678), 621 states have internal predecessors, (1678), 0 states have call successors, (0), 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:38:12,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1678 transitions. [2025-04-13 22:38:12,696 INFO L79 Accepts]: Start accepts. Automaton has 622 states and 1678 transitions. Word has length 56 [2025-04-13 22:38:12,696 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:12,696 INFO L485 AbstractCegarLoop]: Abstraction has 622 states and 1678 transitions. [2025-04-13 22:38:12,696 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:12,696 INFO L278 IsEmpty]: Start isEmpty. Operand 622 states and 1678 transitions. [2025-04-13 22:38:12,696 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:12,696 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:12,697 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:12,697 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable340 [2025-04-13 22:38:12,697 INFO L403 AbstractCegarLoop]: === Iteration 342 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:12,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:12,697 INFO L85 PathProgramCache]: Analyzing trace with hash 802861630, now seen corresponding path program 341 times [2025-04-13 22:38:12,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:12,697 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477561797] [2025-04-13 22:38:12,697 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:38:12,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:12,702 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:12,710 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:12,710 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:38:12,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:13,398 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:38:13,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:13,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477561797] [2025-04-13 22:38:13,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477561797] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:13,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936799813] [2025-04-13 22:38:13,398 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:38:13,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:38:13,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:38:13,400 INFO L229 MonitoredProcess]: Starting monitored process 114 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:38:13,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2025-04-13 22:38:13,534 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:13,552 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:13,552 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:38:13,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:13,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:38:13,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:38:13,736 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:38:13,737 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:38:13,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:38:13,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:38:13,906 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:38:13,906 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:38:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:13,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936799813] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:13,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:38:13,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18, 12] total 32 [2025-04-13 22:38:13,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151128881] [2025-04-13 22:38:13,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:13,934 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:13,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:13,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:13,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=978, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:38:13,935 INFO L87 Difference]: Start difference. First operand 622 states and 1678 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:14,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:14,599 INFO L93 Difference]: Finished difference Result 823 states and 2253 transitions. [2025-04-13 22:38:14,599 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:38:14,599 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:14,599 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:14,608 INFO L225 Difference]: With dead ends: 823 [2025-04-13 22:38:14,608 INFO L226 Difference]: Without dead ends: 771 [2025-04-13 22:38:14,609 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=224, Invalid=2532, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:38:14,609 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 189 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:14,609 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 84 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:14,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-04-13 22:38:14,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 680. [2025-04-13 22:38:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 679 states have (on average 2.7349042709867453) internal successors, (1857), 679 states have internal predecessors, (1857), 0 states have call successors, (0), 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:38:14,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1857 transitions. [2025-04-13 22:38:14,620 INFO L79 Accepts]: Start accepts. Automaton has 680 states and 1857 transitions. Word has length 56 [2025-04-13 22:38:14,620 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:14,621 INFO L485 AbstractCegarLoop]: Abstraction has 680 states and 1857 transitions. [2025-04-13 22:38:14,621 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:14,621 INFO L278 IsEmpty]: Start isEmpty. Operand 680 states and 1857 transitions. [2025-04-13 22:38:14,621 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:14,621 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:14,621 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:14,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Forceful destruction successful, exit code 0 [2025-04-13 22:38:14,822 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable341,114 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:38:14,822 INFO L403 AbstractCegarLoop]: === Iteration 343 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:14,822 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:14,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2123783888, now seen corresponding path program 342 times [2025-04-13 22:38:14,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:14,822 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911745086] [2025-04-13 22:38:14,822 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:38:14,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:14,827 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:14,831 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:38:14,831 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:38:14,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:14,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:14,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:14,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911745086] [2025-04-13 22:38:14,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911745086] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:14,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:14,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:38:14,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555173253] [2025-04-13 22:38:14,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:14,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:14,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:14,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:14,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:38:14,928 INFO L87 Difference]: Start difference. First operand 680 states and 1857 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:15,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:15,319 INFO L93 Difference]: Finished difference Result 809 states and 2208 transitions. [2025-04-13 22:38:15,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:38:15,320 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:15,320 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:15,329 INFO L225 Difference]: With dead ends: 809 [2025-04-13 22:38:15,329 INFO L226 Difference]: Without dead ends: 757 [2025-04-13 22:38:15,329 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:38:15,329 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 164 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:15,330 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 75 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:15,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2025-04-13 22:38:15,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 618. [2025-04-13 22:38:15,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 617 states have (on average 2.700162074554295) internal successors, (1666), 617 states have internal predecessors, (1666), 0 states have call successors, (0), 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:38:15,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 1666 transitions. [2025-04-13 22:38:15,340 INFO L79 Accepts]: Start accepts. Automaton has 618 states and 1666 transitions. Word has length 56 [2025-04-13 22:38:15,340 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:15,340 INFO L485 AbstractCegarLoop]: Abstraction has 618 states and 1666 transitions. [2025-04-13 22:38:15,340 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:15,341 INFO L278 IsEmpty]: Start isEmpty. Operand 618 states and 1666 transitions. [2025-04-13 22:38:15,341 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:15,341 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:15,341 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:15,341 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable342 [2025-04-13 22:38:15,341 INFO L403 AbstractCegarLoop]: === Iteration 344 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:15,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:15,341 INFO L85 PathProgramCache]: Analyzing trace with hash 459313476, now seen corresponding path program 343 times [2025-04-13 22:38:15,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:15,342 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451535114] [2025-04-13 22:38:15,342 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:38:15,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:15,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:38:15,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:15,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:38:15,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:16,329 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:38:16,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:16,329 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451535114] [2025-04-13 22:38:16,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451535114] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:16,329 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293348518] [2025-04-13 22:38:16,329 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:38:16,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:38:16,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:38:16,331 INFO L229 MonitoredProcess]: Starting monitored process 115 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:38:16,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2025-04-13 22:38:16,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:38:16,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:16,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:38:16,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:16,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:38:16,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:38:16,678 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:38:16,678 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:38:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:38:16,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:38:16,871 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:38:16,871 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:38:16,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:16,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293348518] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:16,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:38:16,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 32 [2025-04-13 22:38:16,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888971102] [2025-04-13 22:38:16,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:16,891 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:16,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:16,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:16,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:38:16,892 INFO L87 Difference]: Start difference. First operand 618 states and 1666 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:17,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:17,577 INFO L93 Difference]: Finished difference Result 823 states and 2249 transitions. [2025-04-13 22:38:17,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:38:17,577 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:17,577 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:17,586 INFO L225 Difference]: With dead ends: 823 [2025-04-13 22:38:17,586 INFO L226 Difference]: Without dead ends: 763 [2025-04-13 22:38:17,586 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=219, Invalid=2537, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:38:17,586 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 193 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:17,586 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 84 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:17,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2025-04-13 22:38:17,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 672. [2025-04-13 22:38:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 2.7317436661698955) internal successors, (1833), 671 states have internal predecessors, (1833), 0 states have call successors, (0), 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:38:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1833 transitions. [2025-04-13 22:38:17,597 INFO L79 Accepts]: Start accepts. Automaton has 672 states and 1833 transitions. Word has length 56 [2025-04-13 22:38:17,597 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:17,597 INFO L485 AbstractCegarLoop]: Abstraction has 672 states and 1833 transitions. [2025-04-13 22:38:17,597 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:17,597 INFO L278 IsEmpty]: Start isEmpty. Operand 672 states and 1833 transitions. [2025-04-13 22:38:17,598 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:17,598 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:17,598 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:17,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Ended with exit code 0 [2025-04-13 22:38:17,798 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 115 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable343 [2025-04-13 22:38:17,798 INFO L403 AbstractCegarLoop]: === Iteration 345 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:17,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:17,799 INFO L85 PathProgramCache]: Analyzing trace with hash 63725706, now seen corresponding path program 344 times [2025-04-13 22:38:17,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:17,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686265391] [2025-04-13 22:38:17,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:38:17,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:17,804 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:17,807 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:38:17,807 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:38:17,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:17,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:17,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:17,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686265391] [2025-04-13 22:38:17,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686265391] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:17,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:17,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:38:17,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576055338] [2025-04-13 22:38:17,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:17,905 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:17,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:17,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:17,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:38:17,905 INFO L87 Difference]: Start difference. First operand 672 states and 1833 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:18,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:18,292 INFO L93 Difference]: Finished difference Result 809 states and 2204 transitions. [2025-04-13 22:38:18,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:38:18,292 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:18,292 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:18,301 INFO L225 Difference]: With dead ends: 809 [2025-04-13 22:38:18,301 INFO L226 Difference]: Without dead ends: 749 [2025-04-13 22:38:18,301 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:38:18,301 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 171 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:18,301 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 75 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:18,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2025-04-13 22:38:18,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 614. [2025-04-13 22:38:18,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 613 states have (on average 2.698205546492659) internal successors, (1654), 613 states have internal predecessors, (1654), 0 states have call successors, (0), 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:38:18,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1654 transitions. [2025-04-13 22:38:18,312 INFO L79 Accepts]: Start accepts. Automaton has 614 states and 1654 transitions. Word has length 56 [2025-04-13 22:38:18,312 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:18,312 INFO L485 AbstractCegarLoop]: Abstraction has 614 states and 1654 transitions. [2025-04-13 22:38:18,312 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:18,312 INFO L278 IsEmpty]: Start isEmpty. Operand 614 states and 1654 transitions. [2025-04-13 22:38:18,312 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:18,312 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:18,312 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:18,313 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable344 [2025-04-13 22:38:18,313 INFO L403 AbstractCegarLoop]: === Iteration 346 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:18,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:18,313 INFO L85 PathProgramCache]: Analyzing trace with hash 325289372, now seen corresponding path program 345 times [2025-04-13 22:38:18,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:18,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155457052] [2025-04-13 22:38:18,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:38:18,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:18,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:18,322 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:38:18,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:38:18,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:18,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:18,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:18,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155457052] [2025-04-13 22:38:18,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155457052] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:18,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:18,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:38:18,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678109798] [2025-04-13 22:38:18,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:18,426 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:18,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:18,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:18,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:38:18,426 INFO L87 Difference]: Start difference. First operand 614 states and 1654 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:18,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:18,879 INFO L93 Difference]: Finished difference Result 903 states and 2457 transitions. [2025-04-13 22:38:18,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:38:18,879 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:18,879 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:18,888 INFO L225 Difference]: With dead ends: 903 [2025-04-13 22:38:18,888 INFO L226 Difference]: Without dead ends: 715 [2025-04-13 22:38:18,889 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=898, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:38:18,889 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 248 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:18,889 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 91 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:18,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-04-13 22:38:18,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 624. [2025-04-13 22:38:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 623 states have (on average 2.691813804173355) internal successors, (1677), 623 states have internal predecessors, (1677), 0 states have call successors, (0), 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:38:18,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 1677 transitions. [2025-04-13 22:38:18,899 INFO L79 Accepts]: Start accepts. Automaton has 624 states and 1677 transitions. Word has length 56 [2025-04-13 22:38:18,899 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:18,899 INFO L485 AbstractCegarLoop]: Abstraction has 624 states and 1677 transitions. [2025-04-13 22:38:18,899 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:18,899 INFO L278 IsEmpty]: Start isEmpty. Operand 624 states and 1677 transitions. [2025-04-13 22:38:18,900 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:18,900 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:18,900 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:18,900 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable345 [2025-04-13 22:38:18,900 INFO L403 AbstractCegarLoop]: === Iteration 347 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:18,900 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:18,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1104423186, now seen corresponding path program 346 times [2025-04-13 22:38:18,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:18,900 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426911019] [2025-04-13 22:38:18,900 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:38:18,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:18,905 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:18,908 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:38:18,908 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:38:18,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:18,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:18,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:18,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426911019] [2025-04-13 22:38:18,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426911019] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:18,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:18,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:38:18,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271818092] [2025-04-13 22:38:18,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:18,988 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:18,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:18,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:18,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:38:18,988 INFO L87 Difference]: Start difference. First operand 624 states and 1677 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:19,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:19,400 INFO L93 Difference]: Finished difference Result 830 states and 2229 transitions. [2025-04-13 22:38:19,400 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:38:19,400 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:19,400 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:19,409 INFO L225 Difference]: With dead ends: 830 [2025-04-13 22:38:19,409 INFO L226 Difference]: Without dead ends: 642 [2025-04-13 22:38:19,409 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=797, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:38:19,410 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 208 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:19,410 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 89 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:19,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-04-13 22:38:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 570. [2025-04-13 22:38:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 2.65377855887522) internal successors, (1510), 569 states have internal predecessors, (1510), 0 states have call successors, (0), 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:38:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1510 transitions. [2025-04-13 22:38:19,419 INFO L79 Accepts]: Start accepts. Automaton has 570 states and 1510 transitions. Word has length 56 [2025-04-13 22:38:19,419 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:19,419 INFO L485 AbstractCegarLoop]: Abstraction has 570 states and 1510 transitions. [2025-04-13 22:38:19,420 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:19,420 INFO L278 IsEmpty]: Start isEmpty. Operand 570 states and 1510 transitions. [2025-04-13 22:38:19,420 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:19,420 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:19,420 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:19,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable346 [2025-04-13 22:38:19,420 INFO L403 AbstractCegarLoop]: === Iteration 348 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:19,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:19,420 INFO L85 PathProgramCache]: Analyzing trace with hash 889054566, now seen corresponding path program 347 times [2025-04-13 22:38:19,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:19,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801471792] [2025-04-13 22:38:19,421 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:38:19,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:19,425 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:19,433 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:19,433 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:38:19,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:20,192 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:38:20,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:20,192 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801471792] [2025-04-13 22:38:20,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801471792] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:20,192 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053377751] [2025-04-13 22:38:20,192 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:38:20,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:38:20,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:38:20,194 INFO L229 MonitoredProcess]: Starting monitored process 116 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:38:20,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2025-04-13 22:38:20,332 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:20,350 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:20,350 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:38:20,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:20,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:38:20,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:38:20,561 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:38:20,561 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:38:20,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:38:20,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:38:20,756 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:38:20,757 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:38:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:20,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053377751] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:20,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:38:20,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18, 12] total 34 [2025-04-13 22:38:20,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329647669] [2025-04-13 22:38:20,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:20,777 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:20,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:20,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:20,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1107, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:38:20,777 INFO L87 Difference]: Start difference. First operand 570 states and 1510 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:21,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:21,411 INFO L93 Difference]: Finished difference Result 835 states and 2225 transitions. [2025-04-13 22:38:21,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:38:21,412 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:21,412 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:21,420 INFO L225 Difference]: With dead ends: 835 [2025-04-13 22:38:21,420 INFO L226 Difference]: Without dead ends: 661 [2025-04-13 22:38:21,420 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=189, Invalid=2567, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:38:21,420 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 188 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:21,420 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 95 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:21,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-04-13 22:38:21,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 570. [2025-04-13 22:38:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 2.6362038664323375) internal successors, (1500), 569 states have internal predecessors, (1500), 0 states have call successors, (0), 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:38:21,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1500 transitions. [2025-04-13 22:38:21,431 INFO L79 Accepts]: Start accepts. Automaton has 570 states and 1500 transitions. Word has length 56 [2025-04-13 22:38:21,431 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:21,431 INFO L485 AbstractCegarLoop]: Abstraction has 570 states and 1500 transitions. [2025-04-13 22:38:21,431 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:21,431 INFO L278 IsEmpty]: Start isEmpty. Operand 570 states and 1500 transitions. [2025-04-13 22:38:21,431 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:21,431 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:21,431 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:21,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Ended with exit code 0 [2025-04-13 22:38:21,632 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable347 [2025-04-13 22:38:21,632 INFO L403 AbstractCegarLoop]: === Iteration 349 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:21,632 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:21,632 INFO L85 PathProgramCache]: Analyzing trace with hash -428887960, now seen corresponding path program 348 times [2025-04-13 22:38:21,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:21,632 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272061332] [2025-04-13 22:38:21,632 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:38:21,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:21,637 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:21,641 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:38:21,641 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:38:21,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:21,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:21,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:21,738 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272061332] [2025-04-13 22:38:21,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272061332] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:21,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:21,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:38:21,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607656184] [2025-04-13 22:38:21,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:21,738 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:21,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:21,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:21,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:38:21,739 INFO L87 Difference]: Start difference. First operand 570 states and 1500 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:22,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:22,108 INFO L93 Difference]: Finished difference Result 734 states and 1913 transitions. [2025-04-13 22:38:22,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:38:22,109 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:22,109 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:22,117 INFO L225 Difference]: With dead ends: 734 [2025-04-13 22:38:22,118 INFO L226 Difference]: Without dead ends: 540 [2025-04-13 22:38:22,118 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:38:22,118 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 149 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:22,118 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 89 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:22,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-04-13 22:38:22,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-04-13 22:38:22,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 539 states have (on average 2.6363636363636362) internal successors, (1421), 539 states have internal predecessors, (1421), 0 states have call successors, (0), 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:38:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 1421 transitions. [2025-04-13 22:38:22,128 INFO L79 Accepts]: Start accepts. Automaton has 540 states and 1421 transitions. Word has length 56 [2025-04-13 22:38:22,128 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:22,128 INFO L485 AbstractCegarLoop]: Abstraction has 540 states and 1421 transitions. [2025-04-13 22:38:22,128 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:22,128 INFO L278 IsEmpty]: Start isEmpty. Operand 540 states and 1421 transitions. [2025-04-13 22:38:22,128 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:22,128 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:22,128 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:22,129 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable348 [2025-04-13 22:38:22,129 INFO L403 AbstractCegarLoop]: === Iteration 350 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:22,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:22,129 INFO L85 PathProgramCache]: Analyzing trace with hash -734132650, now seen corresponding path program 349 times [2025-04-13 22:38:22,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:22,129 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096804673] [2025-04-13 22:38:22,129 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:38:22,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:22,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:38:22,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:22,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:38:22,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:23,148 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:38:23,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:23,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096804673] [2025-04-13 22:38:23,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096804673] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:23,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225726670] [2025-04-13 22:38:23,148 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:38:23,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:38:23,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:38:23,150 INFO L229 MonitoredProcess]: Starting monitored process 117 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:38:23,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2025-04-13 22:38:23,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:38:23,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:23,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:38:23,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:23,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:38:23,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:38:23,490 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:38:23,491 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:38:23,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:38:23,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:38:23,664 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:38:23,664 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:38:23,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:23,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225726670] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:23,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:38:23,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 31 [2025-04-13 22:38:23,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415388326] [2025-04-13 22:38:23,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:23,685 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:23,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:23,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:23,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=915, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:38:23,685 INFO L87 Difference]: Start difference. First operand 540 states and 1421 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:24,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:24,335 INFO L93 Difference]: Finished difference Result 724 states and 1890 transitions. [2025-04-13 22:38:24,335 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:38:24,336 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:24,336 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:24,344 INFO L225 Difference]: With dead ends: 724 [2025-04-13 22:38:24,344 INFO L226 Difference]: Without dead ends: 480 [2025-04-13 22:38:24,344 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=209, Invalid=2341, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:38:24,344 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 199 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:24,344 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 93 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:24,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-04-13 22:38:24,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-04-13 22:38:24,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 2.62839248434238) internal successors, (1259), 479 states have internal predecessors, (1259), 0 states have call successors, (0), 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:38:24,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 1259 transitions. [2025-04-13 22:38:24,353 INFO L79 Accepts]: Start accepts. Automaton has 480 states and 1259 transitions. Word has length 56 [2025-04-13 22:38:24,353 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:24,353 INFO L485 AbstractCegarLoop]: Abstraction has 480 states and 1259 transitions. [2025-04-13 22:38:24,353 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:24,353 INFO L278 IsEmpty]: Start isEmpty. Operand 480 states and 1259 transitions. [2025-04-13 22:38:24,354 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:24,354 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:24,354 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:24,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Ended with exit code 0 [2025-04-13 22:38:24,554 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable349,117 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:38:24,554 INFO L403 AbstractCegarLoop]: === Iteration 351 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:24,554 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:24,554 INFO L85 PathProgramCache]: Analyzing trace with hash 981007510, now seen corresponding path program 350 times [2025-04-13 22:38:24,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:24,554 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902761408] [2025-04-13 22:38:24,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:38:24,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:24,559 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:24,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:38:24,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:38:24,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:24,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:24,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:24,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902761408] [2025-04-13 22:38:24,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902761408] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:24,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:24,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:38:24,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353938086] [2025-04-13 22:38:24,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:24,652 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:38:24,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:24,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:38:24,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:38:24,653 INFO L87 Difference]: Start difference. First operand 480 states and 1259 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:25,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:25,019 INFO L93 Difference]: Finished difference Result 539 states and 1395 transitions. [2025-04-13 22:38:25,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:38:25,019 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:25,019 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:25,030 INFO L225 Difference]: With dead ends: 539 [2025-04-13 22:38:25,030 INFO L226 Difference]: Without dead ends: 461 [2025-04-13 22:38:25,030 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:38:25,030 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 204 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:25,030 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 59 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:38:25,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-04-13 22:38:25,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2025-04-13 22:38:25,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 2.617391304347826) internal successors, (1204), 460 states have internal predecessors, (1204), 0 states have call successors, (0), 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:38:25,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1204 transitions. [2025-04-13 22:38:25,040 INFO L79 Accepts]: Start accepts. Automaton has 461 states and 1204 transitions. Word has length 56 [2025-04-13 22:38:25,040 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:25,040 INFO L485 AbstractCegarLoop]: Abstraction has 461 states and 1204 transitions. [2025-04-13 22:38:25,040 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:25,040 INFO L278 IsEmpty]: Start isEmpty. Operand 461 states and 1204 transitions. [2025-04-13 22:38:25,040 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:25,041 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:25,041 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:25,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable350 [2025-04-13 22:38:25,041 INFO L403 AbstractCegarLoop]: === Iteration 352 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:25,041 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:25,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1032456762, now seen corresponding path program 351 times [2025-04-13 22:38:25,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:25,041 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923080269] [2025-04-13 22:38:25,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:38:25,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:25,046 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:25,050 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:38:25,050 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:38:25,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:25,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:25,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:25,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923080269] [2025-04-13 22:38:25,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923080269] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:25,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:25,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:38:25,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991597395] [2025-04-13 22:38:25,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:25,146 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:38:25,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:25,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:38:25,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:38:25,146 INFO L87 Difference]: Start difference. First operand 461 states and 1204 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:25,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:25,496 INFO L93 Difference]: Finished difference Result 547 states and 1415 transitions. [2025-04-13 22:38:25,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:38:25,496 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:25,496 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:25,504 INFO L225 Difference]: With dead ends: 547 [2025-04-13 22:38:25,504 INFO L226 Difference]: Without dead ends: 488 [2025-04-13 22:38:25,504 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=182, Invalid=940, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:38:25,504 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 172 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:25,504 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 59 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:38:25,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-04-13 22:38:25,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 465. [2025-04-13 22:38:25,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 2.6120689655172415) internal successors, (1212), 464 states have internal predecessors, (1212), 0 states have call successors, (0), 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:38:25,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1212 transitions. [2025-04-13 22:38:25,513 INFO L79 Accepts]: Start accepts. Automaton has 465 states and 1212 transitions. Word has length 56 [2025-04-13 22:38:25,513 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:25,513 INFO L485 AbstractCegarLoop]: Abstraction has 465 states and 1212 transitions. [2025-04-13 22:38:25,513 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:25,513 INFO L278 IsEmpty]: Start isEmpty. Operand 465 states and 1212 transitions. [2025-04-13 22:38:25,514 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:25,514 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:25,514 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:25,514 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable351 [2025-04-13 22:38:25,514 INFO L403 AbstractCegarLoop]: === Iteration 353 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:25,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:25,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1895238506, now seen corresponding path program 352 times [2025-04-13 22:38:25,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:25,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283716126] [2025-04-13 22:38:25,514 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:38:25,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:25,519 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:25,521 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:38:25,521 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:38:25,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:25,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:25,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:25,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283716126] [2025-04-13 22:38:25,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283716126] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:25,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:25,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:38:25,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111163976] [2025-04-13 22:38:25,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:25,593 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:38:25,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:25,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:38:25,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:38:25,593 INFO L87 Difference]: Start difference. First operand 465 states and 1212 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:25,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:25,930 INFO L93 Difference]: Finished difference Result 513 states and 1317 transitions. [2025-04-13 22:38:25,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:38:25,930 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:25,930 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:25,938 INFO L225 Difference]: With dead ends: 513 [2025-04-13 22:38:25,938 INFO L226 Difference]: Without dead ends: 457 [2025-04-13 22:38:25,938 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=827, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:38:25,938 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 127 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:25,939 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 59 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:38:25,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-04-13 22:38:25,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 457. [2025-04-13 22:38:25,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 2.6140350877192984) internal successors, (1192), 456 states have internal predecessors, (1192), 0 states have call successors, (0), 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:38:25,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 1192 transitions. [2025-04-13 22:38:25,947 INFO L79 Accepts]: Start accepts. Automaton has 457 states and 1192 transitions. Word has length 56 [2025-04-13 22:38:25,947 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:25,947 INFO L485 AbstractCegarLoop]: Abstraction has 457 states and 1192 transitions. [2025-04-13 22:38:25,947 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:25,947 INFO L278 IsEmpty]: Start isEmpty. Operand 457 states and 1192 transitions. [2025-04-13 22:38:25,948 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:25,948 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:25,948 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:25,948 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable352 [2025-04-13 22:38:25,948 INFO L403 AbstractCegarLoop]: === Iteration 354 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:25,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:25,948 INFO L85 PathProgramCache]: Analyzing trace with hash -723581726, now seen corresponding path program 353 times [2025-04-13 22:38:25,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:25,948 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140872012] [2025-04-13 22:38:25,948 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:38:25,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:25,953 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:25,960 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:25,960 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:38:25,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:26,611 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:38:26,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:26,611 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140872012] [2025-04-13 22:38:26,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140872012] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:26,611 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233518657] [2025-04-13 22:38:26,611 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:38:26,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:38:26,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:38:26,613 INFO L229 MonitoredProcess]: Starting monitored process 118 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:38:26,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2025-04-13 22:38:26,753 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:26,771 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:26,771 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:38:26,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:26,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:38:26,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:38:26,911 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:38:26,911 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:38:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:38:26,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:38:27,055 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:38:27,055 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:38:27,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:27,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233518657] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:27,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:38:27,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [15, 12] total 29 [2025-04-13 22:38:27,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017752367] [2025-04-13 22:38:27,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:27,082 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:27,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:27,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:27,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=792, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:38:27,082 INFO L87 Difference]: Start difference. First operand 457 states and 1192 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:27,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:27,691 INFO L93 Difference]: Finished difference Result 551 states and 1427 transitions. [2025-04-13 22:38:27,691 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:38:27,692 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:27,692 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:27,700 INFO L225 Difference]: With dead ends: 551 [2025-04-13 22:38:27,701 INFO L226 Difference]: Without dead ends: 492 [2025-04-13 22:38:27,701 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=245, Invalid=2511, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:38:27,701 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 212 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:27,701 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 59 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:27,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-04-13 22:38:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 465. [2025-04-13 22:38:27,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 2.6120689655172415) internal successors, (1212), 464 states have internal predecessors, (1212), 0 states have call successors, (0), 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:38:27,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1212 transitions. [2025-04-13 22:38:27,710 INFO L79 Accepts]: Start accepts. Automaton has 465 states and 1212 transitions. Word has length 56 [2025-04-13 22:38:27,710 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:27,710 INFO L485 AbstractCegarLoop]: Abstraction has 465 states and 1212 transitions. [2025-04-13 22:38:27,710 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:27,710 INFO L278 IsEmpty]: Start isEmpty. Operand 465 states and 1212 transitions. [2025-04-13 22:38:27,710 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:27,710 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:27,710 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:27,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Forceful destruction successful, exit code 0 [2025-04-13 22:38:27,911 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable353,118 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:38:27,911 INFO L403 AbstractCegarLoop]: === Iteration 355 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:27,911 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:27,911 INFO L85 PathProgramCache]: Analyzing trace with hash -910046982, now seen corresponding path program 354 times [2025-04-13 22:38:27,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:27,911 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612852306] [2025-04-13 22:38:27,911 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:38:27,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:27,916 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:27,920 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:38:27,920 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:38:27,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:28,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:28,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:28,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612852306] [2025-04-13 22:38:28,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612852306] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:28,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:28,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:38:28,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907724713] [2025-04-13 22:38:28,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:28,007 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:38:28,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:28,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:38:28,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:38:28,008 INFO L87 Difference]: Start difference. First operand 465 states and 1212 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:28,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:28,346 INFO L93 Difference]: Finished difference Result 540 states and 1392 transitions. [2025-04-13 22:38:28,347 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:38:28,347 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:28,347 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:28,355 INFO L225 Difference]: With dead ends: 540 [2025-04-13 22:38:28,355 INFO L226 Difference]: Without dead ends: 488 [2025-04-13 22:38:28,355 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:38:28,355 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 139 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:28,355 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 58 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:38:28,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-04-13 22:38:28,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 461. [2025-04-13 22:38:28,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 2.608695652173913) internal successors, (1200), 460 states have internal predecessors, (1200), 0 states have call successors, (0), 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:38:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1200 transitions. [2025-04-13 22:38:28,364 INFO L79 Accepts]: Start accepts. Automaton has 461 states and 1200 transitions. Word has length 56 [2025-04-13 22:38:28,364 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:28,364 INFO L485 AbstractCegarLoop]: Abstraction has 461 states and 1200 transitions. [2025-04-13 22:38:28,364 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:28,364 INFO L278 IsEmpty]: Start isEmpty. Operand 461 states and 1200 transitions. [2025-04-13 22:38:28,364 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:28,364 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:28,365 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:28,365 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable354 [2025-04-13 22:38:28,365 INFO L403 AbstractCegarLoop]: === Iteration 356 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:28,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:28,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1559918554, now seen corresponding path program 355 times [2025-04-13 22:38:28,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:28,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159424947] [2025-04-13 22:38:28,365 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:38:28,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:28,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:38:28,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:28,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:38:28,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:29,264 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:38:29,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:29,264 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159424947] [2025-04-13 22:38:29,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159424947] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:29,264 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998397188] [2025-04-13 22:38:29,264 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:38:29,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:38:29,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:38:29,266 INFO L229 MonitoredProcess]: Starting monitored process 119 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:38:29,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2025-04-13 22:38:29,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:38:29,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:29,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:38:29,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:29,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:38:29,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:38:29,596 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:38:29,596 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:38:29,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:38:29,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:38:29,771 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:38:29,771 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:38:29,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:29,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998397188] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:29,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:38:29,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 32 [2025-04-13 22:38:29,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944453286] [2025-04-13 22:38:29,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:29,796 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:29,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:29,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:29,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=971, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:38:29,796 INFO L87 Difference]: Start difference. First operand 461 states and 1200 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:30,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:30,423 INFO L93 Difference]: Finished difference Result 517 states and 1325 transitions. [2025-04-13 22:38:30,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:38:30,423 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:30,423 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:30,431 INFO L225 Difference]: With dead ends: 517 [2025-04-13 22:38:30,431 INFO L226 Difference]: Without dead ends: 453 [2025-04-13 22:38:30,431 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=238, Invalid=2732, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 22:38:30,431 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 167 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:30,431 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 59 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:30,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-04-13 22:38:30,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2025-04-13 22:38:30,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 2.6106194690265485) internal successors, (1180), 452 states have internal predecessors, (1180), 0 states have call successors, (0), 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:38:30,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 1180 transitions. [2025-04-13 22:38:30,440 INFO L79 Accepts]: Start accepts. Automaton has 453 states and 1180 transitions. Word has length 56 [2025-04-13 22:38:30,440 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:30,440 INFO L485 AbstractCegarLoop]: Abstraction has 453 states and 1180 transitions. [2025-04-13 22:38:30,440 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:30,440 INFO L278 IsEmpty]: Start isEmpty. Operand 453 states and 1180 transitions. [2025-04-13 22:38:30,441 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:30,441 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:30,441 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:30,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Ended with exit code 0 [2025-04-13 22:38:30,641 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 119 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable355 [2025-04-13 22:38:30,641 INFO L403 AbstractCegarLoop]: === Iteration 357 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:30,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:30,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1374122766, now seen corresponding path program 356 times [2025-04-13 22:38:30,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:30,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014711193] [2025-04-13 22:38:30,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:38:30,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:30,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:30,650 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:38:30,650 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:38:30,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:30,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:30,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014711193] [2025-04-13 22:38:30,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014711193] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:30,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:30,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:38:30,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213965451] [2025-04-13 22:38:30,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:30,739 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:38:30,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:30,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:38:30,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:38:30,739 INFO L87 Difference]: Start difference. First operand 453 states and 1180 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:31,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:31,104 INFO L93 Difference]: Finished difference Result 635 states and 1691 transitions. [2025-04-13 22:38:31,104 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:38:31,105 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:31,105 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:31,112 INFO L225 Difference]: With dead ends: 635 [2025-04-13 22:38:31,112 INFO L226 Difference]: Without dead ends: 576 [2025-04-13 22:38:31,112 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:38:31,113 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 202 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:31,113 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 66 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:38:31,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-04-13 22:38:31,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 505. [2025-04-13 22:38:31,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 2.6547619047619047) internal successors, (1338), 504 states have internal predecessors, (1338), 0 states have call successors, (0), 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:38:31,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 1338 transitions. [2025-04-13 22:38:31,122 INFO L79 Accepts]: Start accepts. Automaton has 505 states and 1338 transitions. Word has length 56 [2025-04-13 22:38:31,122 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:31,122 INFO L485 AbstractCegarLoop]: Abstraction has 505 states and 1338 transitions. [2025-04-13 22:38:31,122 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:31,122 INFO L278 IsEmpty]: Start isEmpty. Operand 505 states and 1338 transitions. [2025-04-13 22:38:31,122 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:31,122 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:31,122 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:31,122 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable356 [2025-04-13 22:38:31,123 INFO L403 AbstractCegarLoop]: === Iteration 358 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:31,123 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:31,123 INFO L85 PathProgramCache]: Analyzing trace with hash -653664602, now seen corresponding path program 357 times [2025-04-13 22:38:31,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:31,123 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492031795] [2025-04-13 22:38:31,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:38:31,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:31,128 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:31,132 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:38:31,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:38:31,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:31,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:31,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:31,236 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492031795] [2025-04-13 22:38:31,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492031795] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:31,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:31,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:38:31,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981214442] [2025-04-13 22:38:31,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:31,236 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:38:31,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:31,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:38:31,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:38:31,236 INFO L87 Difference]: Start difference. First operand 505 states and 1338 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:31,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:31,595 INFO L93 Difference]: Finished difference Result 624 states and 1656 transitions. [2025-04-13 22:38:31,595 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:38:31,595 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:31,595 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:31,603 INFO L225 Difference]: With dead ends: 624 [2025-04-13 22:38:31,603 INFO L226 Difference]: Without dead ends: 572 [2025-04-13 22:38:31,604 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:38:31,604 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 165 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:31,604 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 66 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:38:31,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-04-13 22:38:31,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 501. [2025-04-13 22:38:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 2.652) internal successors, (1326), 500 states have internal predecessors, (1326), 0 states have call successors, (0), 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:38:31,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1326 transitions. [2025-04-13 22:38:31,613 INFO L79 Accepts]: Start accepts. Automaton has 501 states and 1326 transitions. Word has length 56 [2025-04-13 22:38:31,613 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:31,613 INFO L485 AbstractCegarLoop]: Abstraction has 501 states and 1326 transitions. [2025-04-13 22:38:31,613 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:31,613 INFO L278 IsEmpty]: Start isEmpty. Operand 501 states and 1326 transitions. [2025-04-13 22:38:31,614 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:31,614 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:31,614 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:31,614 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable357 [2025-04-13 22:38:31,614 INFO L403 AbstractCegarLoop]: === Iteration 359 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:31,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:31,614 INFO L85 PathProgramCache]: Analyzing trace with hash -561098738, now seen corresponding path program 358 times [2025-04-13 22:38:31,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:31,614 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708020245] [2025-04-13 22:38:31,614 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:38:31,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:31,619 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:31,622 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:38:31,622 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:38:31,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:31,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:31,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:31,695 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708020245] [2025-04-13 22:38:31,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708020245] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:31,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:31,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:38:31,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256457230] [2025-04-13 22:38:31,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:31,695 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:38:31,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:31,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:38:31,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:38:31,695 INFO L87 Difference]: Start difference. First operand 501 states and 1326 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:32,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:32,063 INFO L93 Difference]: Finished difference Result 628 states and 1664 transitions. [2025-04-13 22:38:32,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:38:32,064 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:32,064 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:32,073 INFO L225 Difference]: With dead ends: 628 [2025-04-13 22:38:32,073 INFO L226 Difference]: Without dead ends: 568 [2025-04-13 22:38:32,073 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:38:32,073 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 170 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:32,073 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 66 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:38:32,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-04-13 22:38:32,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 497. [2025-04-13 22:38:32,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 2.649193548387097) internal successors, (1314), 496 states have internal predecessors, (1314), 0 states have call successors, (0), 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:38:32,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 1314 transitions. [2025-04-13 22:38:32,083 INFO L79 Accepts]: Start accepts. Automaton has 497 states and 1314 transitions. Word has length 56 [2025-04-13 22:38:32,083 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:32,083 INFO L485 AbstractCegarLoop]: Abstraction has 497 states and 1314 transitions. [2025-04-13 22:38:32,083 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:32,083 INFO L278 IsEmpty]: Start isEmpty. Operand 497 states and 1314 transitions. [2025-04-13 22:38:32,084 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:32,084 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:32,084 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:32,084 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable358 [2025-04-13 22:38:32,084 INFO L403 AbstractCegarLoop]: === Iteration 360 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:32,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:32,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1131236860, now seen corresponding path program 359 times [2025-04-13 22:38:32,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:32,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943987939] [2025-04-13 22:38:32,084 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:38:32,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:32,089 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:32,096 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:32,096 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:38:32,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:32,868 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:38:32,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:32,868 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943987939] [2025-04-13 22:38:32,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943987939] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:32,868 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278432446] [2025-04-13 22:38:32,868 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:38:32,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:38:32,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:38:32,870 INFO L229 MonitoredProcess]: Starting monitored process 120 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:38:32,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2025-04-13 22:38:33,008 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:33,026 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:33,026 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:38:33,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:33,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:38:33,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:38:33,208 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:38:33,208 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:38:33,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:38:33,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:38:33,368 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:38:33,368 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:38:33,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:33,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278432446] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:33,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:38:33,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 31 [2025-04-13 22:38:33,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804565802] [2025-04-13 22:38:33,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:33,396 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:33,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:33,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:33,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=914, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:38:33,396 INFO L87 Difference]: Start difference. First operand 497 states and 1314 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:33,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:33,957 INFO L93 Difference]: Finished difference Result 641 states and 1671 transitions. [2025-04-13 22:38:33,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:38:33,958 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:33,958 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:33,966 INFO L225 Difference]: With dead ends: 641 [2025-04-13 22:38:33,966 INFO L226 Difference]: Without dead ends: 409 [2025-04-13 22:38:33,966 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=2254, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:38:33,967 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 200 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:33,967 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 75 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:33,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-04-13 22:38:33,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2025-04-13 22:38:33,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 408 states have (on average 2.5392156862745097) internal successors, (1036), 408 states have internal predecessors, (1036), 0 states have call successors, (0), 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:38:33,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1036 transitions. [2025-04-13 22:38:33,975 INFO L79 Accepts]: Start accepts. Automaton has 409 states and 1036 transitions. Word has length 56 [2025-04-13 22:38:33,975 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:33,975 INFO L485 AbstractCegarLoop]: Abstraction has 409 states and 1036 transitions. [2025-04-13 22:38:33,975 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:33,975 INFO L278 IsEmpty]: Start isEmpty. Operand 409 states and 1036 transitions. [2025-04-13 22:38:33,975 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:33,975 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:33,975 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:33,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Forceful destruction successful, exit code 0 [2025-04-13 22:38:34,175 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 120 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable359 [2025-04-13 22:38:34,176 INFO L403 AbstractCegarLoop]: === Iteration 361 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:34,176 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:34,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1323214790, now seen corresponding path program 360 times [2025-04-13 22:38:34,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:34,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118683572] [2025-04-13 22:38:34,176 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:38:34,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:34,181 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:34,184 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:38:34,184 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:38:34,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:34,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:34,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:34,290 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118683572] [2025-04-13 22:38:34,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118683572] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:34,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:34,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:38:34,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268619761] [2025-04-13 22:38:34,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:34,290 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:34,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:34,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:34,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:38:34,290 INFO L87 Difference]: Start difference. First operand 409 states and 1036 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:34,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:34,685 INFO L93 Difference]: Finished difference Result 611 states and 1613 transitions. [2025-04-13 22:38:34,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:38:34,685 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:34,685 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:34,693 INFO L225 Difference]: With dead ends: 611 [2025-04-13 22:38:34,693 INFO L226 Difference]: Without dead ends: 552 [2025-04-13 22:38:34,694 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:38:34,694 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 211 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:34,694 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 78 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:34,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-04-13 22:38:34,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 471. [2025-04-13 22:38:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 2.6106382978723404) internal successors, (1227), 470 states have internal predecessors, (1227), 0 states have call successors, (0), 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:38:34,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1227 transitions. [2025-04-13 22:38:34,703 INFO L79 Accepts]: Start accepts. Automaton has 471 states and 1227 transitions. Word has length 56 [2025-04-13 22:38:34,703 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:34,703 INFO L485 AbstractCegarLoop]: Abstraction has 471 states and 1227 transitions. [2025-04-13 22:38:34,703 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:34,703 INFO L278 IsEmpty]: Start isEmpty. Operand 471 states and 1227 transitions. [2025-04-13 22:38:34,703 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:34,703 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:34,703 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:34,704 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable360 [2025-04-13 22:38:34,704 INFO L403 AbstractCegarLoop]: === Iteration 362 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:34,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:34,704 INFO L85 PathProgramCache]: Analyzing trace with hash 346856574, now seen corresponding path program 361 times [2025-04-13 22:38:34,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:34,704 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228583371] [2025-04-13 22:38:34,704 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:38:34,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:34,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:38:34,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:34,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:38:34,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:35,436 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:38:35,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:35,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228583371] [2025-04-13 22:38:35,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228583371] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:35,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818717569] [2025-04-13 22:38:35,436 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:38:35,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:38:35,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:38:35,438 INFO L229 MonitoredProcess]: Starting monitored process 121 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:38:35,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2025-04-13 22:38:35,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:38:35,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:35,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:38:35,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:35,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:38:35,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:38:35,766 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:38:35,766 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:38:35,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:38:35,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:38:35,921 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:38:35,922 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:38:35,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:35,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818717569] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:35,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:38:35,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 22:38:35,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495179101] [2025-04-13 22:38:35,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:35,954 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:35,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:35,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:35,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:38:35,954 INFO L87 Difference]: Start difference. First operand 471 states and 1227 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:36,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:36,524 INFO L93 Difference]: Finished difference Result 600 states and 1578 transitions. [2025-04-13 22:38:36,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:38:36,524 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:36,524 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:36,532 INFO L225 Difference]: With dead ends: 600 [2025-04-13 22:38:36,532 INFO L226 Difference]: Without dead ends: 548 [2025-04-13 22:38:36,532 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=2170, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:38:36,533 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 168 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:36,533 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 76 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:36,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-04-13 22:38:36,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 467. [2025-04-13 22:38:36,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 466 states have (on average 2.607296137339056) internal successors, (1215), 466 states have internal predecessors, (1215), 0 states have call successors, (0), 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:38:36,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 1215 transitions. [2025-04-13 22:38:36,541 INFO L79 Accepts]: Start accepts. Automaton has 467 states and 1215 transitions. Word has length 56 [2025-04-13 22:38:36,542 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:36,542 INFO L485 AbstractCegarLoop]: Abstraction has 467 states and 1215 transitions. [2025-04-13 22:38:36,542 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:36,542 INFO L278 IsEmpty]: Start isEmpty. Operand 467 states and 1215 transitions. [2025-04-13 22:38:36,542 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:36,542 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:36,542 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:36,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Ended with exit code 0 [2025-04-13 22:38:36,742 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable361,121 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:38:36,743 INFO L403 AbstractCegarLoop]: === Iteration 363 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:36,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:36,743 INFO L85 PathProgramCache]: Analyzing trace with hash -510190762, now seen corresponding path program 362 times [2025-04-13 22:38:36,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:36,743 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472218236] [2025-04-13 22:38:36,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:38:36,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:36,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:36,751 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:38:36,751 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:38:36,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:36,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:36,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:36,849 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472218236] [2025-04-13 22:38:36,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472218236] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:36,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:36,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:38:36,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830315432] [2025-04-13 22:38:36,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:36,850 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:36,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:36,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:36,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:38:36,850 INFO L87 Difference]: Start difference. First operand 467 states and 1215 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:37,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:37,244 INFO L93 Difference]: Finished difference Result 604 states and 1586 transitions. [2025-04-13 22:38:37,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:38:37,244 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:37,244 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:37,253 INFO L225 Difference]: With dead ends: 604 [2025-04-13 22:38:37,253 INFO L226 Difference]: Without dead ends: 544 [2025-04-13 22:38:37,253 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:38:37,254 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 183 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:37,254 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 78 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:37,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-04-13 22:38:37,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 463. [2025-04-13 22:38:37,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 2.603896103896104) internal successors, (1203), 462 states have internal predecessors, (1203), 0 states have call successors, (0), 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:38:37,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1203 transitions. [2025-04-13 22:38:37,263 INFO L79 Accepts]: Start accepts. Automaton has 463 states and 1203 transitions. Word has length 56 [2025-04-13 22:38:37,263 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:37,263 INFO L485 AbstractCegarLoop]: Abstraction has 463 states and 1203 transitions. [2025-04-13 22:38:37,263 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:37,263 INFO L278 IsEmpty]: Start isEmpty. Operand 463 states and 1203 transitions. [2025-04-13 22:38:37,263 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:37,263 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:37,263 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:37,263 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable362 [2025-04-13 22:38:37,263 INFO L403 AbstractCegarLoop]: === Iteration 364 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:37,264 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:37,264 INFO L85 PathProgramCache]: Analyzing trace with hash -130715684, now seen corresponding path program 363 times [2025-04-13 22:38:37,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:37,264 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238697733] [2025-04-13 22:38:37,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:38:37,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:37,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:37,272 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:38:37,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:38:37,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:37,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:37,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238697733] [2025-04-13 22:38:37,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238697733] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:37,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:37,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:38:37,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295661200] [2025-04-13 22:38:37,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:37,372 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:37,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:37,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:37,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:38:37,372 INFO L87 Difference]: Start difference. First operand 463 states and 1203 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:37,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:37,776 INFO L93 Difference]: Finished difference Result 669 states and 1755 transitions. [2025-04-13 22:38:37,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:38:37,776 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:37,776 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:37,785 INFO L225 Difference]: With dead ends: 669 [2025-04-13 22:38:37,785 INFO L226 Difference]: Without dead ends: 481 [2025-04-13 22:38:37,785 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:38:37,785 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 245 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:37,786 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 81 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-04-13 22:38:37,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 419. [2025-04-13 22:38:37,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 418 states have (on average 2.5334928229665072) internal successors, (1059), 418 states have internal predecessors, (1059), 0 states have call successors, (0), 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:38:37,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 1059 transitions. [2025-04-13 22:38:37,794 INFO L79 Accepts]: Start accepts. Automaton has 419 states and 1059 transitions. Word has length 56 [2025-04-13 22:38:37,794 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:37,794 INFO L485 AbstractCegarLoop]: Abstraction has 419 states and 1059 transitions. [2025-04-13 22:38:37,794 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:37,794 INFO L278 IsEmpty]: Start isEmpty. Operand 419 states and 1059 transitions. [2025-04-13 22:38:37,795 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:37,795 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:37,795 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:37,795 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable363 [2025-04-13 22:38:37,795 INFO L403 AbstractCegarLoop]: === Iteration 365 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:37,795 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:37,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1002804428, now seen corresponding path program 364 times [2025-04-13 22:38:37,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:37,795 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730678511] [2025-04-13 22:38:37,795 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:38:37,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:37,800 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:37,803 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:38:37,803 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:38:37,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:37,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:37,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:37,877 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730678511] [2025-04-13 22:38:37,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730678511] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:37,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:37,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:38:37,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015256814] [2025-04-13 22:38:37,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:37,877 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:37,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:37,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:37,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:38:37,878 INFO L87 Difference]: Start difference. First operand 419 states and 1059 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:38,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:38,243 INFO L93 Difference]: Finished difference Result 583 states and 1472 transitions. [2025-04-13 22:38:38,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:38:38,244 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:38,244 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:38,251 INFO L225 Difference]: With dead ends: 583 [2025-04-13 22:38:38,251 INFO L226 Difference]: Without dead ends: 399 [2025-04-13 22:38:38,252 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:38:38,252 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 166 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:38,252 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 88 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:38,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-04-13 22:38:38,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2025-04-13 22:38:38,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 398 states have (on average 2.520100502512563) internal successors, (1003), 398 states have internal predecessors, (1003), 0 states have call successors, (0), 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:38:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1003 transitions. [2025-04-13 22:38:38,260 INFO L79 Accepts]: Start accepts. Automaton has 399 states and 1003 transitions. Word has length 56 [2025-04-13 22:38:38,260 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:38,260 INFO L485 AbstractCegarLoop]: Abstraction has 399 states and 1003 transitions. [2025-04-13 22:38:38,260 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:38,260 INFO L278 IsEmpty]: Start isEmpty. Operand 399 states and 1003 transitions. [2025-04-13 22:38:38,261 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:38,261 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:38,261 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:38,261 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable364 [2025-04-13 22:38:38,261 INFO L403 AbstractCegarLoop]: === Iteration 366 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:38,261 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:38,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1907848622, now seen corresponding path program 365 times [2025-04-13 22:38:38,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:38,261 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103817450] [2025-04-13 22:38:38,261 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:38:38,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:38,266 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:38,272 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:38,272 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:38:38,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:38,856 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:38:38,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:38,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103817450] [2025-04-13 22:38:38,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103817450] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:38,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196776759] [2025-04-13 22:38:38,856 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:38:38,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:38:38,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:38:38,858 INFO L229 MonitoredProcess]: Starting monitored process 122 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:38:38,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2025-04-13 22:38:39,001 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:39,018 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:39,018 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:38:39,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:39,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:38:39,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:38:39,178 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:38:39,178 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:38:39,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:38:39,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:38:39,312 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:38:39,313 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:38:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:39,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196776759] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:39,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:38:39,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 29 [2025-04-13 22:38:39,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675484899] [2025-04-13 22:38:39,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:39,339 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:39,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:39,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:39,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=802, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:38:39,340 INFO L87 Difference]: Start difference. First operand 399 states and 1003 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:39,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:39,933 INFO L93 Difference]: Finished difference Result 439 states and 1088 transitions. [2025-04-13 22:38:39,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:38:39,934 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:39,934 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:39,941 INFO L225 Difference]: With dead ends: 439 [2025-04-13 22:38:39,942 INFO L226 Difference]: Without dead ends: 380 [2025-04-13 22:38:39,942 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=212, Invalid=2238, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:38:39,942 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 221 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:39,942 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 74 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:39,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-04-13 22:38:39,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2025-04-13 22:38:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 2.5013192612137205) internal successors, (948), 379 states have internal predecessors, (948), 0 states have call successors, (0), 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:38:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 948 transitions. [2025-04-13 22:38:39,950 INFO L79 Accepts]: Start accepts. Automaton has 380 states and 948 transitions. Word has length 56 [2025-04-13 22:38:39,950 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:39,950 INFO L485 AbstractCegarLoop]: Abstraction has 380 states and 948 transitions. [2025-04-13 22:38:39,950 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:39,950 INFO L278 IsEmpty]: Start isEmpty. Operand 380 states and 948 transitions. [2025-04-13 22:38:39,950 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:39,950 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:39,950 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:39,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Ended with exit code 0 [2025-04-13 22:38:40,151 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 122 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable365 [2025-04-13 22:38:40,151 INFO L403 AbstractCegarLoop]: === Iteration 367 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:40,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:40,151 INFO L85 PathProgramCache]: Analyzing trace with hash 304433646, now seen corresponding path program 366 times [2025-04-13 22:38:40,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:40,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417666931] [2025-04-13 22:38:40,151 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:38:40,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:40,156 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:40,160 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:38:40,160 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:38:40,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:40,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:40,259 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417666931] [2025-04-13 22:38:40,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417666931] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:40,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:40,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:38:40,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339105576] [2025-04-13 22:38:40,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:40,259 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:40,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:40,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:40,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:38:40,260 INFO L87 Difference]: Start difference. First operand 380 states and 948 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:40,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:40,652 INFO L93 Difference]: Finished difference Result 428 states and 1053 transitions. [2025-04-13 22:38:40,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:38:40,652 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:40,652 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:40,661 INFO L225 Difference]: With dead ends: 428 [2025-04-13 22:38:40,661 INFO L226 Difference]: Without dead ends: 376 [2025-04-13 22:38:40,661 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:38:40,661 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 174 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:40,661 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 74 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-04-13 22:38:40,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2025-04-13 22:38:40,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 375 states have (on average 2.496) internal successors, (936), 375 states have internal predecessors, (936), 0 states have call successors, (0), 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:38:40,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 936 transitions. [2025-04-13 22:38:40,669 INFO L79 Accepts]: Start accepts. Automaton has 376 states and 936 transitions. Word has length 56 [2025-04-13 22:38:40,669 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:40,669 INFO L485 AbstractCegarLoop]: Abstraction has 376 states and 936 transitions. [2025-04-13 22:38:40,669 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:40,669 INFO L278 IsEmpty]: Start isEmpty. Operand 376 states and 936 transitions. [2025-04-13 22:38:40,670 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:40,670 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:40,670 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:40,670 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable366 [2025-04-13 22:38:40,670 INFO L403 AbstractCegarLoop]: === Iteration 368 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:40,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:40,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1071511794, now seen corresponding path program 367 times [2025-04-13 22:38:40,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:40,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447898036] [2025-04-13 22:38:40,670 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:38:40,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:40,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:38:40,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:40,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:38:40,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:41,663 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:38:41,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:41,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447898036] [2025-04-13 22:38:41,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447898036] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:41,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548404834] [2025-04-13 22:38:41,664 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:38:41,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:38:41,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:38:41,666 INFO L229 MonitoredProcess]: Starting monitored process 123 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:38:41,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2025-04-13 22:38:41,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 22:38:41,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 22:38:41,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:38:41,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:41,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:38:41,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:38:42,017 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:38:42,017 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-04-13 22:38:42,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:38:42,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:38:42,191 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 22:38:42,191 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-04-13 22:38:42,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:42,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548404834] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:38:42,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:38:42,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 31 [2025-04-13 22:38:42,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409970106] [2025-04-13 22:38:42,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:42,226 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:42,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:42,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:42,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=915, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:38:42,227 INFO L87 Difference]: Start difference. First operand 376 states and 936 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:42,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:42,835 INFO L93 Difference]: Finished difference Result 432 states and 1061 transitions. [2025-04-13 22:38:42,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:38:42,835 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:42,836 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:42,844 INFO L225 Difference]: With dead ends: 432 [2025-04-13 22:38:42,844 INFO L226 Difference]: Without dead ends: 372 [2025-04-13 22:38:42,844 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=214, Invalid=2438, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:38:42,844 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 182 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:42,844 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 74 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:42,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-04-13 22:38:42,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2025-04-13 22:38:42,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 2.490566037735849) internal successors, (924), 371 states have internal predecessors, (924), 0 states have call successors, (0), 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:38:42,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 924 transitions. [2025-04-13 22:38:42,852 INFO L79 Accepts]: Start accepts. Automaton has 372 states and 924 transitions. Word has length 56 [2025-04-13 22:38:42,852 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:42,852 INFO L485 AbstractCegarLoop]: Abstraction has 372 states and 924 transitions. [2025-04-13 22:38:42,852 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:42,852 INFO L278 IsEmpty]: Start isEmpty. Operand 372 states and 924 transitions. [2025-04-13 22:38:42,852 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:42,852 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:42,852 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:42,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Forceful destruction successful, exit code 0 [2025-04-13 22:38:43,053 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable367,123 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:38:43,053 INFO L403 AbstractCegarLoop]: === Iteration 369 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:43,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:43,053 INFO L85 PathProgramCache]: Analyzing trace with hash -714927056, now seen corresponding path program 368 times [2025-04-13 22:38:43,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:43,053 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359243210] [2025-04-13 22:38:43,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:38:43,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:43,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:43,062 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:38:43,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:38:43,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:43,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:43,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:43,163 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359243210] [2025-04-13 22:38:43,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359243210] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:43,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:43,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:38:43,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117374514] [2025-04-13 22:38:43,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:43,164 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:43,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:43,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:43,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:38:43,164 INFO L87 Difference]: Start difference. First operand 372 states and 924 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:43,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:43,555 INFO L93 Difference]: Finished difference Result 516 states and 1281 transitions. [2025-04-13 22:38:43,555 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:38:43,555 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:43,555 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:43,563 INFO L225 Difference]: With dead ends: 516 [2025-04-13 22:38:43,563 INFO L226 Difference]: Without dead ends: 328 [2025-04-13 22:38:43,563 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=840, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:38:43,564 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 239 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:43,564 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 79 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:43,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-04-13 22:38:43,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-04-13 22:38:43,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 2.385321100917431) internal successors, (780), 327 states have internal predecessors, (780), 0 states have call successors, (0), 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:38:43,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 780 transitions. [2025-04-13 22:38:43,571 INFO L79 Accepts]: Start accepts. Automaton has 328 states and 780 transitions. Word has length 56 [2025-04-13 22:38:43,571 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:43,571 INFO L485 AbstractCegarLoop]: Abstraction has 328 states and 780 transitions. [2025-04-13 22:38:43,571 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:43,571 INFO L278 IsEmpty]: Start isEmpty. Operand 328 states and 780 transitions. [2025-04-13 22:38:43,571 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:43,571 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:43,571 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:43,571 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable368 [2025-04-13 22:38:43,572 INFO L403 AbstractCegarLoop]: === Iteration 370 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:43,572 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:43,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1501252884, now seen corresponding path program 369 times [2025-04-13 22:38:43,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:43,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2368934] [2025-04-13 22:38:43,572 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:38:43,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:43,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:43,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 22:38:43,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:38:43,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:43,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:43,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2368934] [2025-04-13 22:38:43,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2368934] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:43,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:43,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:38:43,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007230572] [2025-04-13 22:38:43,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:43,681 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:43,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:43,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:43,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:38:43,681 INFO L87 Difference]: Start difference. First operand 328 states and 780 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:44,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:44,044 INFO L93 Difference]: Finished difference Result 492 states and 1193 transitions. [2025-04-13 22:38:44,044 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:38:44,044 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:44,044 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:44,052 INFO L225 Difference]: With dead ends: 492 [2025-04-13 22:38:44,052 INFO L226 Difference]: Without dead ends: 318 [2025-04-13 22:38:44,053 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:38:44,053 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 189 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:44,053 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 81 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:38:44,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-04-13 22:38:44,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2025-04-13 22:38:44,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 2.356466876971609) internal successors, (747), 317 states have internal predecessors, (747), 0 states have call successors, (0), 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:38:44,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 747 transitions. [2025-04-13 22:38:44,060 INFO L79 Accepts]: Start accepts. Automaton has 318 states and 747 transitions. Word has length 56 [2025-04-13 22:38:44,060 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:44,060 INFO L485 AbstractCegarLoop]: Abstraction has 318 states and 747 transitions. [2025-04-13 22:38:44,060 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:44,060 INFO L278 IsEmpty]: Start isEmpty. Operand 318 states and 747 transitions. [2025-04-13 22:38:44,060 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 22:38:44,060 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:44,061 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:44,061 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable369 [2025-04-13 22:38:44,061 INFO L403 AbstractCegarLoop]: === Iteration 371 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:38:44,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:44,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1027434346, now seen corresponding path program 370 times [2025-04-13 22:38:44,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:44,061 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561620968] [2025-04-13 22:38:44,061 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:38:44,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:44,066 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 22:38:44,068 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 56 statements. [2025-04-13 22:38:44,068 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:38:44,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:38:44,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:44,151 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561620968] [2025-04-13 22:38:44,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561620968] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:44,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:44,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:38:44,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652245298] [2025-04-13 22:38:44,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:44,151 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:38:44,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:44,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:38:44,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:38:44,152 INFO L87 Difference]: Start difference. First operand 318 states and 747 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:44,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:44,513 INFO L93 Difference]: Finished difference Result 318 states and 747 transitions. [2025-04-13 22:38:44,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:38:44,513 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-04-13 22:38:44,514 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:44,521 INFO L225 Difference]: With dead ends: 318 [2025-04-13 22:38:44,521 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 22:38:44,521 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=776, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:38:44,521 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 197 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:44,522 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 81 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:38:44,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 22:38:44,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 22:38:44,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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:38:44,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 22:38:44,526 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2025-04-13 22:38:44,526 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:44,526 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 22:38:44,526 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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:38:44,526 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 22:38:44,526 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 22:38:44,528 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 22:38:44,528 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 22:38:44,528 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 22:38:44,528 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 22:38:44,528 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable370 [2025-04-13 22:38:44,530 INFO L422 BasicCegarLoop]: Path program histogram: [370, 1] [2025-04-13 22:38:44,532 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:38:44,532 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:38:44,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:38:44 BasicIcfg [2025-04-13 22:38:44,533 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:38:44,533 INFO L158 Benchmark]: Toolchain (without parser) took 430847.24ms. Allocated memory was 125.8MB in the beginning and 1.0GB in the end (delta: 922.7MB). Free memory was 87.0MB in the beginning and 888.1MB in the end (delta: -801.2MB). Peak memory consumption was 121.4MB. Max. memory is 8.0GB. [2025-04-13 22:38:44,533 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 163.6MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:38:44,533 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.93ms. Allocated memory is still 125.8MB. Free memory was 87.0MB in the beginning and 71.5MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 22:38:44,533 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.62ms. Allocated memory is still 125.8MB. Free memory was 71.5MB in the beginning and 68.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:38:44,533 INFO L158 Benchmark]: Boogie Preprocessor took 31.79ms. Allocated memory is still 125.8MB. Free memory was 68.8MB in the beginning and 67.3MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:38:44,533 INFO L158 Benchmark]: IcfgBuilder took 519.49ms. Allocated memory is still 125.8MB. Free memory was 67.3MB in the beginning and 80.1MB in the end (delta: -12.8MB). Peak memory consumption was 52.6MB. Max. memory is 8.0GB. [2025-04-13 22:38:44,534 INFO L158 Benchmark]: TraceAbstraction took 430009.34ms. Allocated memory was 125.8MB in the beginning and 1.0GB in the end (delta: 922.7MB). Free memory was 79.4MB in the beginning and 888.1MB in the end (delta: -808.7MB). Peak memory consumption was 115.0MB. Max. memory is 8.0GB. [2025-04-13 22:38:44,534 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.21ms. Allocated memory is still 163.6MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.93ms. Allocated memory is still 125.8MB. Free memory was 87.0MB in the beginning and 71.5MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.62ms. Allocated memory is still 125.8MB. Free memory was 71.5MB in the beginning and 68.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 31.79ms. Allocated memory is still 125.8MB. Free memory was 68.8MB in the beginning and 67.3MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 519.49ms. Allocated memory is still 125.8MB. Free memory was 67.3MB in the beginning and 80.1MB in the end (delta: -12.8MB). Peak memory consumption was 52.6MB. Max. memory is 8.0GB. * TraceAbstraction took 430009.34ms. Allocated memory was 125.8MB in the beginning and 1.0GB in the end (delta: 922.7MB). Free memory was 79.4MB in the beginning and 888.1MB in the end (delta: -808.7MB). Peak memory consumption was 115.0MB. 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 - PositiveResult [Line: 120]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 92 locations, 92 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 429.9s, OverallIterations: 371, TraceHistogramMax: 2, PathProgramHistogramMax: 370, EmptinessCheckTime: 0.5s, AutomataDifference: 212.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 83607 SdHoareTripleChecker+Valid, 133.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83607 mSDsluCounter, 30009 SdHoareTripleChecker+Invalid, 111.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26379 mSDsCounter, 1452 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 461431 IncrementalHoareTripleChecker+Invalid, 462883 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1452 mSolverCounterUnsat, 3630 mSDtfsCounter, 461431 mSolverCounterSat, 1.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24679 GetRequests, 11380 SyntacticMatches, 0 SemanticMatches, 13299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91786 ImplicationChecksByTransitivity, 126.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4085occurred in iteration=9, InterpolantAutomatonStates: 9861, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.9s AutomataMinimizationTime, 371 MinimizatonAttempts, 50678 StatesRemovedByMinimization, 346 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.5s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 167.9s InterpolantComputationTime, 27589 NumberOfCodeBlocks, 26607 NumberOfCodeBlocksAsserted, 615 NumberOfCheckSat, 32372 ConstructedInterpolants, 1368 QuantifiedInterpolants, 289375 SizeOfPredicates, 2137 NumberOfNonLiveVariables, 33148 ConjunctsInSsa, 3431 ConjunctsInUnsatCore, 589 InterpolantComputations, 368 PerfectInterpolantSequences, 1172/1722 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 22:38:44,639 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 0 Received shutdown request...